ACM 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.
  
• Jeremy Avigad, Kevin Donnelly, David Gray, Paul Raff:
  A formally verified proof of the prime number theorem.
  
• Jan Van den Bussche, Stijn Vansummeren:
  Polymorphic type inference for the named nested relational calculus.
  
• Shuvendu K. Lahiri, Randal E. Bryant:
  Predicate abstraction with indexed predicates.
  
• Christel Baier, Nathalie Bertrand, Ph. Schnoebelen:
  Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties.
  
• Malgorzata Biernacka, Olivier Danvy:
  A concrete framework for environment machines.
  
• Fabrizio Angiulli, Gianluigi Greco, Luigi Palopoli:
  Outlier detection by logic programming.
  

Volume 9, Number 2, March 2008

• Silvio Ghilardi, Enrica Nicolini, Daniele Zucchelli:
  A comprehensive combination framework.
  
• Chiaki Sakama, Katsumi Inoue:
  Coordination in answer set programming.
  
• Slawomir Lasota, Igor Walukiewicz:
  Alternating timed automata.
  
• Felix Klaedtke:
  Bounds on the automata size for Presburger arithmetic.
  
• Véronique Bruyère, Emmanuel Dall'Olio, Jean-François Raskin:
  Durations and parametric model-checking in timed automata.
  
• Floris Geerts, Sofie Haesevoets, Bart Kuijpers:
  First-order complete and computationally complete query languages for spatio-temporal databases.
  
• Marc Denecker, Eugenia Ternovska:
  A logic of nonmonotone inductive definitions.
  

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.
  
• Karl Crary, Susmit Sarkar:
  Foundational certified code in the Twelf metalogical framework.
  
• Samir Genaim, Andy King:
  Inferring non-suspension conditions for logic programs with dynamic scheduling.
  
• Andreas Blass, Yuri Gurevich:
  Program termination and well partial orderings.
  
• Andreas Blass, Yuri Gurevich:
  Abstract state machines capture parallel algorithms: Correction and extension.
  
• Hana Chockler, Joseph Y. Halpern, Orna Kupferman:
  What causes a system to satisfy a specification?.
  
• Simone Bova, Franco Montagna:
  Proof search in Hájek's basic logic.
  
• Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini:
  Conjunctive query containment and answering under description logic constraints.
  
• Aleksandar Nanevski, Frank Pfenning, Brigitte Pientka:
  Contextual modal type theory.
  

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.
  
• Frank Wolter, Michael Zakharyaschev:
  Undecidability of the unification and admissibility problems for modal and description logics.
  
• Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir:
  Open answer set programming with guarded programs.
  
• Yi-Dong Shen:
  Reasoning with recursive loops under the PLP framework.
  
• Helmut Seidl, Kumar Neeraj Verma:
  Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying.
  
• Marco Alberti, Federico Chesani, Marco Gavanelli, Evelina Lamma, Paola Mello, Paolo Torroni:
  Verifiable agent interaction in abductive logic programming: The SCIFF framework.
  

Last update Wed Feb 15 05:46:03 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page