Logical Methods in Computer Science, Volume 6

Volume 6, Number 1, 2010

• Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier:
  O-Minimal Hybrid Reachability Games.
  
• Guy McCusker:
  A Graph Model for Imperative Computation.
  
• Manfred Droste, Guo-Qiang Zhang:
  Bifinite Chu Spaces.
  
• Achim Blumensath:
  Guarded Second-Order Logic, Spanning Trees, and Network Flows.
  
• Christian Mathissen:
  Weighted Logics for Nested Words and Algebraic Formal Power Series.
  
• Bernard Boigelot, Julien Brusten, Véronique Bruyère:
  On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases.
  
• Jeroen Ketema, Jakob Grue Simonsen:
  Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies.
  

Volume 6, Number 2, 2010

• Bart Jacobs:
  Orthomodular lattices, Foulis Semigroups and Dagger Kernel Categories.
  
• Achim Blumensath, Bruno Courcelle:
  On the Monadic Second-Order Transduction Hierarchy.
  
• Chad E. Brown, Gert Smolka:
  Analytic Tableaux for Simple Type Theory and its First-Order Fragment.
  
• José L. Balcázar:
  Redundancy, Deduction Schemes, and Minimum-Size Bases for Association Rules.
  
• Jörg Endrullis, Dimitri Hendriks:
  Transforming Outermost into Context-Sensitive Rewriting.
  

Volume 6, Number 3, 2010

• Ronald Garcia, Andrew Lumsdaine, Amr Sabry:
  Lazy Evaluation and Delimited Control.
  
• Amir M. Ben-Amram:
  Size-Change Termination, Monotonicity Constraints and Ranking Functions.
  
• James Brotherston, Cristiano Calcagno:
  Classical BI: Its Semantics and Proof Theory.
  
• David Monniaux:
  Automatic Modular Abstractions for Template Numerical Constraints.
  
• Peter A. Jonsson, Johan Nordlander:
  Positive Supercompilation for a Higher-Order Call-By-Value Language.
  
• Chris Hawblitzel, Erez Petrank:
  Automated Verification of Practical Garbage Collectors.
  
• Roman Kontchakov, Ian Pratt-Hartmann, Frank Wolter, Michael Zakharyaschev:
  Spatial logics with connectedness predicates.
  
• Luis Barguñó, Guillem Godoy, Eduard Huntingford, Ashish Tiwari:
  Termination of Rewriting with Right-Flat Rules Modulo Permutative Theories.
  
• Petter Kristian Køber:
  Domain Representable Spaces Defined by Strictly Positive Induction.
  
• Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger:
  Expressiveness and Closure Properties for Quantitative Languages.
  
• Thomas Ehrhard, Olivier Laurent:
  Acyclic Solos and Differential Interaction Nets.
  
• Alwen Tiu, Rajeev Goré, Jeremy E. Dawson:
  A Proof Theoretic Analysis of Intruder Theories.
  
• Krishnendu Chatterjee, Luca de Alfaro, Rupak Majumdar, Vishwanath Raman:
  Algorithms for Game Metrics (Full Version).
  
• Parosh Aziz Abdulla, Pavel Krcál, Wang Yi:
  Sampled Semantics of Timed Automata.
  
• Makoto Hamana:
  Initial Algebra Semantics for Cyclic Sharing Tree Structures.
  
• Benedikt Bollig, Dietrich Kuske, Ingmar Meinecke:
  Propositional Dynamic Logic for Message-Passing Systems.
  
• Franz Baader, Barbara Morawska:
  Unification in the Description Logic EL.
  
• Stefan Kahrs:
  Modularity of Convergence and Strong Convergence in Infinitary Rewriting.
  
• Federico Aschieri, Stefano Berardi:
  Interactive Learning-Based Realizability for Heyting Arithmetic with EM1.
  
• Jörg Endrullis, Roel C. de Vrijer, Johannes Waldmann:
  Local Termination: theory and practice.
  
• Hans Zantema:
  Well-definedness of Streams by Transformation and Termination.
  
• Jérôme Leroux:
  The General Vector Addition System Reachability Problem by Presburger Inductive Invariants.
  
• Alexandra Silva, Marcello M. Bonsangue, Jan J. M. M. Rutten:
  Non-Deterministic Kleene Coalgebras.
  
• Peter LeFanu Lumsdaine:
  Weak omega-categories from intensional type theory.
  
• Juha Kontinen, Heribert Vollmer:
  On Second-Order Monadic Monoidal and Groupoidal Quantifiers.
  

Volume 6, Number 4, 2010

• Mikolaj Bojanczyk, Luc Segoufin:
  Tree Languages Defined in First-Order Logic with One Quantifier Alternation.
  
• Martín Abadi, Gordon D. Plotkin:
  A Model of Cooperative Threads.
  
• Olivier Laurent:
  Game semantics for first-order logic.
  
• Andrei A. Bulatov, Dániel Marx:
  The complexity of global cardinality constraints.
  
• William Lovas, Frank Pfenning:
  Refinement Types for Logical Frameworks and Their Interpretation as Proof Irrelevance.
  
• Marc de Falco:
  An Explicit Framework for Interaction Nets.
  
• Ugo Dal Lago, Martin Hofmann:
  Bounded Linear Logic, Revisited.
  
• Takeshi Tsukada, Atsushi Igarashi:
  A Logical Foundation for Environment Classifiers.
  
• Stéphane Demri, Alexander Rabinovich:
  The complexity of linear-time temporal logic over the class of ordinals.
  
• Silvio Ghilardi, Silvio Ranise:
  Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis.
  
• Michele Basaldella, Kazushige Terui:
  On the meaning of logical completeness.
  
• Arnon Avron, Ori Lahav:
  On Constructive Connectives and Systems.
  

Last update Sat May 18 20:45:09 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page