default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Computational Logic (TOCL), Volume 9
Volume 9, Number 1, December 2007
- Sharon Shoham
, Orna Grumberg:
A game-based framework for CTL counterexamples and 3-valued abstraction-refinement. 1 - Jeremy Avigad, Kevin Donnelly, David Gray, Paul Raff:
A formally verified proof of the prime number theorem. 2 - Jan Van den Bussche, Stijn Vansummeren:
Polymorphic type inference for the named nested relational calculus. 3 - Shuvendu K. Lahiri, Randal E. Bryant:
Predicate abstraction with indexed predicates. 4 - Christel Baier, Nathalie Bertrand, Philippe Schnoebelen:
Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties. 5 - Malgorzata Biernacka, Olivier Danvy:
A concrete framework for environment machines. 6 - Fabrizio Angiulli, Gianluigi Greco, Luigi Palopoli:
Outlier detection by logic programming. 7
Volume 9, Number 2, March 2008
- Silvio Ghilardi, Enrica Nicolini, Daniele Zucchelli:
A comprehensive combination framework. 8:1-8:54 - Chiaki Sakama, Katsumi Inoue:
Coordination in answer set programming. 9:1-9:30 - Slawomir Lasota, Igor Walukiewicz:
Alternating timed automata. 10:1-10:27 - Felix Klaedtke:
Bounds on the automata size for Presburger arithmetic. 11:1-11:34 - Véronique Bruyère, Emmanuel Dall'Olio, Jean-François Raskin:
Durations and parametric model-checking in timed automata. 12:1-12:23 - Floris Geerts, Sofie Haesevoets, Bart Kuijpers:
First-order complete and computationally complete query languages for spatio-temporal databases. 13:1-13:51 - Marc Denecker, Eugenia Ternovska:
A logic of nonmonotone inductive definitions. 14:1-14:52
Volume 9, Number 3, June 2008
- Agostino Dovier, Carla Piazza, Gianfranco Rossi:
A uniform approach to constraint-solving for lists, multisets, compact lists, and sets. 15:1-15:30 - Karl Crary, Susmit Sarkar:
Foundational certified code in the Twelf metalogical framework. 16:1-16:26 - Samir Genaim, Andy King:
Inferring non-suspension conditions for logic programs with dynamic scheduling. 17:1-17:43 - Andreas Blass, Yuri Gurevich:
Program termination and well partial orderings. 18:1-18:26 - Andreas Blass, Yuri Gurevich:
Abstract state machines capture parallel algorithms: Correction and extension. 19:1-19:32 - Hana Chockler, Joseph Y. Halpern, Orna Kupferman:
What causes a system to satisfy a specification?. 20:1-20:26 - Simone Bova, Franco Montagna:
Proof search in Hájek's basic logic. 21:1-21:26 - Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini:
Conjunctive query containment and answering under description logic constraints. 22:1-22:31 - Aleksandar Nanevski, Frank Pfenning, Brigitte Pientka:
Contextual modal type theory. 23:1-23:49
Volume 9, Number 4, August 2008
- Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani:
Complexity results for security protocols with Diffie-Hellman exponentiation and commuting public key encryption. 24:1-24:52 - Frank Wolter, Michael Zakharyaschev:
Undecidability of the unification and admissibility problems for modal and description logics. 25:1-25:20 - Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir:
Open answer set programming with guarded programs. 26:1-26:53 - Yi-Dong Shen:
Reasoning with recursive loops under the PLP framework. 27:1-27:31 - Helmut Seidl, Kumar Neeraj Verma:
Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying. 28:1-28:45 - Marco Alberti, Federico Chesani, Marco Gavanelli, Evelina Lamma, Paola Mello, Paolo Torroni:
Verifiable agent interaction in abductive logic programming: The SCIFF framework. 29:1-29:43
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-09-14 23:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
