LPAR B

49 papers

YearTitle / Authors
2008(LIA) - Model Evolution with Linear Integer Arithmetic Constraints.
Peter Baumgartner, Alexander Fuchs, Cesare Tinelli
2008A Conditional Logical Framework.
Furio Honsell, Marina Lenisa, Luigi Liquori, Ivan Scagnetto
2008A Constraint Sequent Calculus for First-Order Logic with Linear Integer Arithmetic.
Philipp Rümmer
2008A Formal Language for Cryptographic Pseudocode.
Michael Backes, Matthias Berg, Dominique Unruh
2008A Formalised Lower Bound on Undirected Graph Reachability.
Ulrich Schöpp
2008A Higher-Order Iterative Path Ordering.
Cynthia Kop, Femke van Raamsdonk
2008A Logic of Singly Indexed Arrays.
Peter Habermehl, Radu Iosif, Tomás Vojnar
2008A Quantifier Elimination Algorithm for Linear Real Arithmetic.
David Monniaux
2008Alternation Elimination by Complementation (Extended Abstract).
Christian Dax, Felix Klaedtke
2008An Algorithmic Interpretation of a Deep Inference System.
Kai Brünnler, Richard McKinley
2008Approximating Term Rewriting Systems: A Horn Clause Specification and Its Implementation.
John P. Gallagher, Mads Rosendahl
2008Complexity, Graphs, and the Dependency Pair Method.
Nao Hirokawa, Georg Moser
2008Cut Elimination for First Order Gödel Logic by Hyperclause Resolution.
Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller
2008Data-Oblivious Stream Productivity.
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks
2008Decidable and Undecidable Fragments of Halpern and Shoham's Interval Temporal Logic: Towards a Complete Classification.
Davide Bresolin, Dario Della Monica, Valentin Goranko, Angelo Montanari, Guido Sciavicco
2008Default Logics with Preference Order: Principles and Characterisations.
Tore Langholm
2008Discounted Properties of Probabilistic Pushdown Automata.
Tomás Brázdil, Václav Brozek, Jan Holecek, Antonín Kucera
2008Distributed Consistency-Based Diagnosis.
Vincent Armant, Philippe Dague, Laurent Simon
2008Efficient Generation of Unsatisfiability Proofs and Cores in SAT.
Roberto Asín, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell
2008Encoding Queues in Satisfiability Modulo Theories Based Bounded Model Checking.
Tommi A. Junttila, Jori Dubrovin
2008Fast Counting with Bounded Treewidth.
Michael Jakl, Reinhard Pichler, Stefan Rümmele, Stefan Woltran
2008Focusing Strategies in the Sequent Calculus of Synthetic Connectives.
Kaustuv Chaudhuri
2008From One Session to Many: Dynamic Tags for Security Protocols.
Myrto Arapinis, Stéphanie Delaune, Steve Kremer
2008Imogen: Focusing the Polarized Inverse Method for Intuitionistic Propositional Logic.
Sean McLaughlin, Frank Pfenning
2008Improving Context-Sensitive Dependency Pairs.
Beatriz Alarcón, Fabian Emmes, Carsten Fuhs, Jürgen Giesl, Raúl Gutiérrez, Salvador Lucas, Peter Schneider-Kamp, René Thiemann
2008Justification-Based Local Search with Adaptive Noise Strategies.
Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä
2008Logic for Programming, Artificial Intelligence, and Reasoning, 15th International Conference, LPAR 2008, Doha, Qatar, November 22-27, 2008. Proceedings
Iliano Cervesato, Helmut Veith, Andrei Voronkov
2008Model Checking - My 27-Year Quest to Overcome the State Explosion Problem.
Edmund M. Clarke
2008Nominal Renaming Sets.
Murdoch James Gabbay, Martin Hofmann
2008On Bounded Reachability of Programs with Set Comprehensions.
Margus Veanes, Ando Saabas
2008On Computing Constraint Abduction Answers.
Michael J. Maher, Ge Huang
2008On the Computational Complexity of Spatial Logics with Connectedness Constraints.
Roman Kontchakov, Ian Pratt-Hartmann, Frank Wolter, Michael Zakharyaschev
2008On the Relative Succinctness of Nondeterministic Büchi and co-Büchi Word Automata.
Benjamin Aminof, Orna Kupferman, Omer Lev
2008Program Complexity in Hierarchical Module Checking.
Aniello Murano, Margherita Napoli, Mimmo Parente
2008Reasoning Using Knots.
Thomas Eiter, Magdalena Ortiz, Mantas Simkus
2008Reasoning about XML with Temporal Logics and Automata.
Leonid Libkin, Cristina Sirangelo
2008Recurrent Reachability Analysis in Regular Model Checking.
Anthony Widjaja To, Leonid Libkin
2008Reveal: A Formal Verification Tool for Verilog Designs.
Zaher S. Andraus, Mark H. Liffiton, Karem A. Sakallah
2008Role Conjunctions in Expressive Description Logics.
Birte Glimm, Yevgeny Kazakov
2008Symmetry Breaking for Maximum Satisfiability.
João Marques-Silva, Inês Lynce, Vasco Manquinho
2008The Max-Atom Problem and Its Relevance.
Marc Bezem, Robert Nieuwenhuis, Enric Rodríguez-Carbonell
2008The Variable Hierarchy for the Lattice µ-Calculus.
Walid Belkhir, Luigi Santocanale
2008Towards Practical Feasibility of Core Computation in Data Exchange.
Reinhard Pichler, Vadim Savenkov
2008Tractable Quantified Constraint Satisfaction Problems over Positive Temporal Templates.
Witold Charatonik, Michal Wrona
2008Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings.
Luca Pulina, Armando Tacchella
2008Uncurrying for Termination.
Nao Hirokawa, Aart Middeldorp, Harald Zankl
2008Valigator: A Verification Tool with Bound and Invariant Generation.
Thomas A. Henzinger, Thibaud Hottelier, Laura Kovács
2008Variable Dependencies of Quantified CSPs.
Marko Samer
2008Weak beta-theta-Normalization and Normalization by Evaluation for System F.
Andreas Abel