Accepted Papers LPAR 2006

  1. Carsten Schürmann and Mark-Oliver Stehr.
    An Executable Formalization of the HOL/Nuprl Connection in the Metalogical Framework Twelf

  2. Alvaro Cortes-Calabuig, Marc Denecker, Ofer Arieli and Maurice Bruynooghe.
    Representation of Partial Knowledge and Query Answering in Locally Complete Databases

  3. Orna Kupferman, Yoad Lustig and Moshe Vardi.
    On Locally Checkable Properties

  4. Kentaro Kikuchi.
    On a Local-Step Cut-Elimination Procedure for the Intuitionistic Sequent Calculus

  5. Guillaume Bonfante, Marion Jean-Yves and Romain Péchoux.
    Characterization of Alogtime by first order functional programs

  6. Sébastien Limet and Pierre Pillot.
    Deciding Satisfiability of Positive Second Order Joinability Formulae

  7. Peter Baumgartner, Alexander Fuchs and Cesare Tinelli.
    Lemma Learning in the Model Evolution Calculus

  8. Philipp Rümmer.
    Sequential, Parallel and Quantified Updates of First-Order Structures

  9. Gilles Barthe, Benjamin Gregoire and Fernando Pastawski.
    Type-based termination of recursive definitions in the Calculus of Inductive Constructions

  10. Cortier Veronique and Eugen Zalinescu.
    Deciding key cycles for security protocols

  11. Tobias Gedell and Reiner Hähnle.
    Automating Verification of Loops by Parallelization

  12. Boris Motik and Ulrike Sattler.
    A Comparison of Techniques for Querying Large Description Logic ABoxes

  13. Agata Ciabattoni and Kazushige Terui.
    Modular Cut-Elimination: Finding Proofs or Counterexamples

  14. Regis Gascon and Laura Bozzelli.
    Branching Time Temporal Logic Extended with Presburger Constraints

  15. Christel Baier, Nathalie Bertrand and Philippe Schnoebelen.
    On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems

  16. Barbara Fila and Siva Anantharaman.
    Automata for Positive Core XPath Queries on Compressed Documents

  17. Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann and Jürgen Giesl.
    SAT Solving for Argument Filterings

  18. Roberto Bruttomesso, Alessandro Cimatti, Anders Franzen, Alberto Griggio and Roberto Sebastiani.
    Delayed Theory Combination vs. Nelson-Oppen for Satisfiability Modulo Theories: a Comparative Analysis

  19. Hendrik Decker and Davide Martinenghi.
    A Relaxed Approach to Integrity and Inconsistency in Databases

  20. John Matthews, J Moore, Sandip Ray and Daron Vroon.
    Verification Condition Generation via Theorem Proving

  21. Richard Bonichon and Olivier Hermant.
    A Semantic Completeness Proof for Tableaux Modulo

  22. Roberto Bruttomesso, Alessandro Cimatti, Anders Franzen, Alberto Griggio, Alessandro Santuari and Roberto Sebastiani.
    To Ackermann-ize or not to Ackermann-ize? On Efficiently Handling Uninterpreted Function Symbols in SMT(EUF U T)

  23. Stephan Falke and Deepak Kapur.
    Inductive Decidability using Implicit Induction

  24. Hélène Kirchner, Silvio Ranise, Christophe Ringeissen and Duc-Khanh Tran.
    Automatic Combinability of Rewriting Based Satisfiability Procedures

  25. Martin Giese.
    Saturation up to Redundancy for Tableau and Sequent Calculi

  26. Harald Ganzinger and Konstantin Korovin.
    Theory Instantiation

  27. Ozan Kahramanogullari.
    Reducing Nondeterminism in the Calculus of Structures

  28. Jonathan Kavanagh, David Mitchell, Eugenia Ternovska, Jan Manuch, Xiaohong Zhao and Arvind Gupta.
    Constructing Camin-Sokal Phylogenies Via Answer Set Programming

  29. Clark Barrett, Robert Nieuwenhuis, Albert Oliveras and Cesare Tinelli.
    Splitting on Demand in Satisfiability Modulo Theories

  30. Germain Faure.
    Matching modulo superdevelopments. Application to second-order matching.

  31. Pablo Fillottrani and Guillermo Simari.
    Representing defaults and negative information without negation-as-failure

  32. Alwen Tiu.
    A Local System for Intuitionistic Logic

  33. Christian Fermüller and Robert Kosik.
    Combining supervaluation and degree based reasoning under vagueness

  34. Elvira Albert, Puri Arenas and German Puebla.
    An Incremental Approach to Abstraction-Carrying Code

  35. Pawel Pietrzak, Jesus Correas, German Puebla and Manuel Hermenegildo.
    Context-Sensitive Multivariant Assertion Checking in Modular Programs

  36. Nachum Dershowitz, Jieh Hsiang, Guan-Shieng Huang and Daher Kaiss.
    Boolean Rings for Intersection-Based Satisfiability

  37. Georg Moser.
    Derivational Complexity of Knuth-Bendix Orders revisited

  38. Frederic Blanqui and Colin Riba.
    Combining typing and size constraints for checking the termination of higher-order conditional rewrite systems

Last modified: Mon Jul 10 13:44:54 CEST 2006