Logical Methods in Computer Science, Volume 7
Volume 7, Number 1, 2011
- Barbara Petit: Semantics of Typed Lambda-Calculus with Constructors.
- Guillaume Burel: Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo.
- Mark Kaminski, Sigurd Schneider, Gert Smolka: Terminating Tableaux for Graded Hybrid Logic with Global Modalities and Role Hierarchies.
- Stéphane Lengrand, Roy Dyckhoff, James McKinna: A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems.
- Matthew Hennessy: A calculus for costed computations.
- Ulrich Berger: From coinductive proofs to exact real arithmetic: theory and applications.
- Ross Tate, Michael Stepp, Zachary Tatlock, Sorin Lerner: Equality Saturation: A New Approach to Optimization.
- Jesper Bengtson, Magnus Johansson, Joachim Parrow, Björn Victor: Psi-calculi: a framework for mobile processes with nominal data and logic.
- Taolue Chen, Tingting Han, Joost-Pieter Katoen, Alexandru Mereacre: Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications.
- Sam Staton: Relating coalgebraic notions of bisimulation.
Volume 7, Number 2, 2011
- Giorgi Japaridze: From formulas to cirquents in computability logic.
- Alexandre Miquel: Existential witness extraction in classical realizability and via a negative translation.
- Andreas Abel, Thierry Coquand, Miguel Pagano: A Modular Type-checking algorithm for Type Theory with Singleton Types and Proof Irrelevance.
- Rajeev Goré, Linda Postniece, Alwen Tiu: On the Correspondence between Display Postulates and Deep Inference in Nested Sequent Calculi for Tense Logics.
- Nick Bezhanishvili, Mai Gehrke: Finitely generated free Heyting algebras via Birkhoff duality and coalgebra.
- Dag Normann: Banach Spaces as Data Types.
- Olaf Beyersdorff, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Heribert Vollmer: Model Checking CTL is Almost Always Inherently Sequential.
- Michele Basaldella, Claudia Faggian: Ludics with repetitions (Exponentials, Interactive types and Completeness).
- Mark Bickford, Robert L. Constable, Joseph Y. Halpern, Sabina Petride: Knowledge-Based Synthesis of Distributed Systems Using Event Structures.
- Robert Atkey: Amortised Resource Analysis with Separation Logic.
- Nazanin Tavana, Klaus Weihrauch: Turing machines on represented sets, a model of computation for Analysis.
Volume 7, Number 3, 2011
- Jean-Louis Krivine: Realizability algebras: a program to well order R.
- Amir M. Ben-Amram: Monotonicity Constraints for Termination in the Integer Domain.
- Zvonko Iljazovic: Co-c.e. spheres and cells in computable metric spaces.
- Matthew R. Lakin: Constraint solving in non-permutative nominal abstract syntax.
- Adrian Francalanza, Julian Rathke, Vladimiro Sassone: Permission-Based Separation Logic for Message-Passing Concurrency.
- André Hernich: Answering Non-Monotonic Queries in Relational Data Exchange.
- Tobias Gärtner, Martin Ziegler: Real Analytic Machines and Degrees: A Topological View on Algebraic Limiting Computation.
- Jyotirmoy V. Deshmukh, G. Ramalingam, Venkatesh Prasad Ranganath, Kapil Vaswani: Logical Concurrency Control from Sequential Proofs.
- Pierre Hyvernat: Finiteness spaces, graphs and "coherence".
- Douglas Cenzer, Paul Brodhead, Ferit Toska, Sebastian Wyman: Algorithmic Randomness and Capacity of Closed Sets.
- Michael Ummels, Dominik Wojtczak: The Complexity of Nash Equilibria in Stochastic Multiplayer Games.
- Jan Schwinghammer, Lars Birkedal, Bernhard Reus, Hongseok Yang: Nested Hoare Triples and Frame Rules for Higher-order Store.
- Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan: Power of Randomization in Automata on Infinite Strings.
- Oliver Friedmann: An Exponential Lower Bound for the Latest Deterministic Strategy Iteration Algorithms.
Volume 7, Number 4
- Mahdi Aliakbari, Massoud Pourmahdian: Computational Models of Certain Hyperspaces of Quasi-metric Spaces.
- Vassilios Gregoriades: Computational Models of Certain Hyperspaces of Quasi-metric Spaces.
- Mohamed Faouzi Atig, Ahmed Bouajjani, Shaz Qadeer: Context-Bounded Analysis For Concurrent Programs With Dynamic Creation of Threads.
- Gyesik Lee, Benjamin Werner: Proof-irrelevant model of CC with predicative induction and judgmental equality.
- Krishnendu Chatterjee, Thomas A. Henzinger, Vinayak S. Prabhu: Timed Parity Games: Complexity and Robustness.
- Naoki Kobayashi, C.-H. Luke Ong: Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus.
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T214307 by the dblp team