default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLogical Methods in Computer Science, Volume 5
Volume 5, Number 1, 2009
- Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer:
The Complexity of Generalized Satisfiability for Linear Temporal Logic. - Jirí Srba:
Beyond Language Equivalence on Visibly Pushdown Automata. - William Blum, C.-H. Luke Ong:
The Safe Lambda Calculus. - Martin Grohe, Götz Schwandtner:
The Complexity of Datalog on Linear Orders. - Laurent Doyen, Jean-François Raskin:
Antichains for the Automata-Based Approach to Model-Checking. - Christoph Benzmüller, Chad E. Brown, Michael Kohlhase:
Cut-Simulation and Impredicativity. - Jean-Yves Marion:
On tiered small jump operators.
Volume 5, Number 2, 2009
- Koen Claessen, Jan-Willem Roorda:
A Faithful Semantics for Generalised Symbolic Trajectory Evaluation. - Helle Hvid Hansen, Clemens Kupke, Eric Pacuit:
Neighbourhood Structures: Bisimilarity and Basic Model Theory. - Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, Yan Jurski, Mihaela Sighireanu:
A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes. - Mohammad Raza, Philippa Gardner:
Footprints in Local Reasoning. - Alexander Rabinovich:
The Church Problem for Countable Ordinals. - Benedetto Intrigila, Richard Statman:
The Omega Rule is Π11-Complete in the λβ-Calculus. - Krishnendu Chatterjee, Luca de Alfaro, Marco Faella, Axel Legay:
Qualitative Logics and Equivalences for Probabilistic Systems. - Amir M. Ben-Amram, Chin Soon Lee:
Ranking Functions for Size-Change Termination II. - Hugo Gimbert, Florian Horn:
Solving Simple Stochastic Games with Few Random Vertices. - Olha Shkaravska, Marko C. J. D. van Eekelen, Ron van Kesteren:
Polynomial Size Analysis of First-Order Shapely Functions. - José Espírito Santo, Ralph Matthes, Luís Pinto:
Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi. - Tal Lev-Ami, Neil Immerman, Thomas W. Reps, Mooly Sagiv, Siddharth Srivastava, Greta Yorsh:
Simulating reachability using first-order logic with applications to verification of linked data structures. - Florent R. Madelaine
:
Universal Structures and the logic of Forbidden Patterns. - Guillaume Bonfante, Yves Guiraud:
Programs as polygraphs: computability and complexity. - Diletta Cacciagrano, Flavio Corradini, Catuscia Palamidessi:
Explicit fairness in testing semantics. - Jesper Bengtson, Joachim Parrow:
Formalising the pi-calculus using nominal logic.
Volume 5, Number 3, 2009
- Delia Kesner:
A Theory of Explicit Substitutions with Safe and Full Composition. - Colin Stirling:
Decidability of higher-order matching. - Johan van Benthem, Balder ten Cate, Jouko A. Väänänen:
Lindström theorems for fragments of first-order logic. - Philipp Weis, Neil Immerman:
Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words. - Mikolaj Bojanczyk:
Two-Way Unary Temporal Logic over Trees. - Pietro Di Gianantonio, Furio Honsell, Marina Lenisa:
RPO, Second-order Contexts, and Lambda-calculus. - Rasmus Ejlers Møgelberg, Alex Simpson:
Relational Parametricity for Computational Effects. - Nikos Tzevelekos:
Full abstraction for nominal general references. - Neil Ghani, Peter G. Hancock, Dirk Pattinson:
Representations of Stream Processors Using Nested Fixed Points. - Dexter Kozen, Nicholas Ruozzi:
Applications of Metric Coinduction. - Dag Normann:
A rich hierarchy of functionals of finite types.
Volume 5, Number 4, 2009
- Sylvain Lebresne:
A Type System For Call-By-Name Exceptions. - Catalin Hritcu, Jan Schwinghammer:
A Step-indexed Semantics of Imperative Objects. - Jeroen Ketema, Jakob Grue Simonsen:
Infinitary Combinatory Reduction Systems: Confluence. - Olivier Finkel:
The Complexity of Infinite Computations In Models of Set Theory. - Rob J. van Glabbeek, Bas Luttik, Nikola Trcka:
Computation Tree Logic with Deadlock Detection. - Damiano Mazza:
Observational Equivalence and Full Abstraction in the Symmetric Interaction Combinators.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-04 20:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
