ACM Transactions on Computational Logic (TOCL)
Accepted Papers, 2008
Volume 9, Number 1
A Game-Based Framework for CTL Counterexamples and 3-Valued Abstraction-Refinement
Sharon Shoham and Orna Grumberg (
Electronic Appendix
)
A Formally Verified Proof of the Prime Number Theorem
Jeremy Avigad, Kevin Donnelly, David Gray and Paul Raff
Polymorphic Type Inference for the Named Nested Relational Calculus
Jan Van den Bussche and Stijn Vansummeren
Predicate Abstraction with Indexed Predicates
Shuvendu Lahiri and Randal Bryant
Verifying Nondeterministic Probabilistic Channel Systems Against Omega-Regular Linear-Time Properties
Christel Baier, Nathalie Bertrand and Philippe Schnoebelen
A Concrete Framework for Environment Machines
Malgorzata Biernacka and Olivier Danvy
Outlier Detection by Logic Programming
Fabrizio Angiulli, Gianluigi Greco and Luigi Palopoli (
Electronic Appendix
)
Volume 9, Number 2
A Comprehensive Combination Framework
Silvio Ghilardi, Enrica Nicolini and Daniele Zucchelli
Coordination in Answer Set Programming
Chiaki Sakama and Katsumi Inoue
Alternating Timed Automata
Slawomir Lasota and Igor Walukiewicz
Bounds on the Automata Size for Presburger Arithmetic
Felix Klaedtke
Durations and Parametric Model-Checking in Timed Automata
Véronique Bruyère, Emmanuel Dall'Oli and Jean-Francois Raskin
First-order Complete and Computationally Complete Query Languages for Spatio-Temporal Databases
Sofie Haesevoets, Floris Geerts and Bart Kuijpers
A Logic of Non-Monotone Inductive Definitions
Marc Denecker and Eugenia Ternovska
Volume 9, Number 3
A Uniform Approach to Constraint-solving for Lists, Multisets, Compact Lists, and Sets
Agostino Dovier, Carla Piazza, and Gianfranco Rossi
Foundational Certified Code in the Twelf Metalogical Framework
Karl Crary and Susmit Sarkar
Inferring Non-Suspension Conditions for Logic Programs with Dynamic Scheduling
Samir Genaim and Andy King
Program Termination and Well Partial Orderings
Andreas Blass and Yuri Gurevich
Abstract State Machines Capture Parallel Algorithms: Correction and Extension
Andreas Blass and Yuri Gurevich
What Causes a System to Satisfy a Specification?
Hana Chockler, Joseph Y. Halpern and Orna Kupferman
Proof Search in Hajek's Basic Logic
Simone Bova and Franco Montagna
Conjunctive Query Containment and Answering under Description Logics Constraints
Diego Calvanese, Giuseppe De Giacomo and Maurizio Lenzerini
Contextual Modal Type Theory
Aleksandar Nanevski, Frank Pfenning and Brigitte Pientka
Volume 9, Number 4
Complexity Results for Security Protocols with Diffie-Hellman Exponentiation and Commuting Public Key Encryption
Yannick Chevalier, Ralf Kuesters, Michael Rusinowitch and Mathieu Turuani
Undecidability of the Unification and Admissibility Problems for Modal and Description Logics
Frank Wolter and Michael Zakharyaschev
Open Answer Set Programming with Guarded Programs
Stijn Heymans, Davy Van Nieuwenborgh and Dirk Vermeir
Reasoning with Recursive Loops under the PLP Framework
Yi-Dong Shen
Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying
Helmut Seidl and Kumar Neeraj Verma
Verifiable Agent Interaction in Abductive Logic Programming: the SCIFF Framework
Marco Alberti, Federico Chesani, Marco Gavanelli, Evelina Lamma, Paola Mello and Paolo Torroni
Back to home page