default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLogical Methods in Computer Science, Volume 7
Volume 7, Number 1, 2011
- Jules Desharnais, Bernhard Möller, Georg Struth:
Algebraic Notions of Termination. - Barbara Petit:
Semantics of Typed Lambda-Calculus with Constructors. - Guillaume Burel:
Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo. - Dirk Pattinson, Lutz Schröder
:
Generic Modal Cut Elimination Applied to Conditional Logics. - 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. - Gilda Ferreira, Paulo Oliva:
Functional Interpretations of Intuitionistic Linear Logic. - 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. - Tobias Heindel, Pawel Sobocinski:
Being Van Kampen is a universal property. - Jirí Adámek, Stefan Milius, Jirí Velebil:
Semantics of Higher-Order Recursion Schemes.
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. - Dimitrios Vardoulakis, Olin Shivers:
CFA2: a Context-Free Approach to Control-Flow Analysis. - Andreas Abel, Thierry Coquand, Miguel Pagano:
A Modular Type-checking algorithm for Type Theory with Singleton Types and Proof Irrelevance. - Alexis Bès, Alexander Rabinovich:
Decidable Expansions of Labelled Linear Orderings. - Renate A. Schmidt, Dmitry Tishkovsky:
Automated Synthesis of Tableau Calculi. - Filippo Bonchi, Ugo Montanari:
Symbolic and Asynchronous Semantics via Normalized Coalgebras. - 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. - George Metcalfe, Nicola Olivetti:
Towards a Proof Theory of Gödel Modal Logics. - 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. - Wesley Calvert, Ken Kramer, Russell G. Miller:
Noncomputable functions in the Blum-Shub-Smale model. - Derek Dreyer, Amal Ahmed, Lars Birkedal:
Logical Step-Indexed Logical Relations. - Robert Atkey:
Amortised Resource Analysis with Separation Logic. - Adam Koprowski, Henri Binsztok:
TRX: A Formally Verified Parser Interpreter. - Nazanin Tavana, Klaus Weihrauch:
Turing machines on represented sets, a model of computation for Analysis. - Wojciech Kazana, Luc Segoufin:
First-order query evaluation on structures of bounded degree.
Volume 7, Number 3, 2011
- Georg Moser, Andreas Schnabl:
The Derivational Complexity Induced by the Dependency Pair Method. - Jean-Louis Krivine:
Realizability algebras: a program to well order R. - Corina Cîrstea, Clemens Kupke, Dirk Pattinson:
EXPTIME Tableaux for the Coalgebraic mu-Calculus. - 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. - Furio Honsell, Marina Lenisa:
Conway games, algebraically and coalgebraically. - 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. - Marcelo P. Fiore, Chung-Kil Hur:
On the mathematical synthesis of equational logics. - Marcelo Arenas, Ronald Fagin, Alan Nash:
Composition with Target Constraints. - Kord Eickmeyer, Martin Grohe:
Randomisation and Derandomisation in Descriptive Complexity Theory. - Pierre Hyvernat:
Finiteness spaces, graphs and "coherence". - Douglas Cenzer, Paul Brodhead, Ferit Toska, Sebastian Wyman:
Algorithmic Randomness and Capacity of Closed Sets. - Aslan Askarov, Andrew C. Myers:
Attacker Control and Impact for Confidentiality and Integrity. - Steven Awodey, Florian Rabe:
Kripke Semantics for Martin-Löf's Extensional Type Theory. - Filip Maric, Predrag Janicic:
Formalization of Abstract State Transition Systems for SAT. - 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, 2011
- Mahdi Aliakbari, Massoud Pourmahdian:
Computational Models of Certain Hyperspaces of Quasi-metric Spaces. - Vassilios Gregoriades:
Computational Models of Certain Hyperspaces of Quasi-metric Spaces. - Thomas Place, Luc Segoufin:
A decidable characterization of locally testable tree languages. - 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. - Manuel Bodirsky, Jens K. Müller:
The Complexity of Rooted Phylogeny Problems. - Nicole Schweikardt, Thomas Schwentick:
A note on the expressive power of linear orders. - 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.
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 2025-12-05 22:38 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:
