default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID24th LICS 2009: Los Angeles, CA, USA
- Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, LICS 2009, 11-14 August 2009, Los Angeles, CA, USA. IEEE Computer Society 2009, ISBN 978-0-7695-3746-7
Sessions 1 and 2 (Joint LICS/SAS)
- Edmund M. Clarke:
My 27-year Quest to Overcome the State Explosion Problem. 3 - Jérôme Leroux:
The General Vector Addition System Reachability Problem by Presburger Inductive Invariants. 4-13
Session 3
- Dan R. Ghica:
Applications of Game Semantics: From Program Analysis to Hardware Synthesis. 17-26 - Vineet Kahlon:
Boundedness vs. Unboundedness of Lock Chains: Characterizing Decidability of Pairwise CFL-Reachability for Threads Communicating via Locks. 27-36
Session 4
- Jesper Bengtson, Magnus Johansson, Joachim Parrow, Björn Victor:
Psi-calculi: Mobile Processes, Nominal Data, and Logic. 39-48 - Marcello M. Bonsangue
, Jan J. M. M. Rutten, Alexandra Silva:
An Algebra for Kripke Polynomial Coalgebras. 49-58 - Sumit Nain, Moshe Y. Vardi:
Trace Semantics is Fully Abstract. 59-68
Session 5
- Derek Dreyer, Amal Ahmed, Lars Birkedal:
Logical Step-Indexed Logical Relations. 71-80 - Luís Dominguez:
Fully Abstract Logical Bisimilarity for a Polymorphic Object Calculus. 81-90 - Alberto Carraro, Antonino Salibra:
Reflexive Scott Domains are Not Complete for the Extensional Lambda Calculus. 91-100 - Frank Pfenning, Robert J. Simmons:
Substructural Operational Semantics as Ordered Logic Programming. 101-110
Session 6
- Anuj Dawar, Martin Grohe, Bjarki Holm, Bastian Laubner:
Logics with Rank Operators. 113-122 - Emanuel Kieronski, Lidia Tendera:
On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations. 123-132 - Martin Hofmann, Ulrich Schöpp:
Pointer Programs and Undirected Reachability. 133-142
Session 7
- Oliver Friedmann:
An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it. 145-156 - Tony Tan:
Graph Reachability and Pebble Automata over Infinite Alphabets. 157-166 - Yang Cai, Ting Zhang, Haifeng Luo:
An Improved Lower Bound for the Complementation of Rabin Automata. 167-176
Session 8
- Naoki Kobayashi, C.-H. Luke Ong:
A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes. 179-188 - Dan R. Ghica, Adam Bakewell:
Clipping: A Semantics-Directed Syntactic Approximation. 189-198 - Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger:
Expressiveness and Closure Properties for Quantitative Languages. 199-208
Session 9
- John Baez:
Computation and the Periodic Table. 211 - Samuel Mimram:
The Structure of First-Order Causality. 212-221 - Michele Pagani, Christine Tasson:
The Inverse Taylor Expansion Problem in Linear Logic. 222-231
Session 10
- Stefan Göller, Richard Mayr, Anthony Widjaja To:
On the Computational Complexity of Verifying One-Counter Processes. 235-244 - Udi Boker, Orna Kupferman:
Co-ing Büchi Made Tight and Useful. 245-254 - Mikolaj Bojanczyk, Howard Straubing, Igor Walukiewicz:
Wreath Products of Forest Algebras, with Applications to Tree Logics. 255-263
Session 11
- Joachim De Lataillade:
Dinatural Terms in System F. 267-276 - Thorsten Altenkirch, Peter Morris:
Indexed Containers. 277-285 - C.-H. Luke Ong, Nikos Tzevelekos:
Functional Reachability. 286-295
Session 12
- Michel de Rougemont, Mathieu Tracol:
Statistic Analysis for Probabilistic Processes. 299-308 - Taolue Chen, Tingting Han, Joost-Pieter Katoen, Alexandru Mereacre:
Quantitative Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications. 309-318 - Nathalie Bertrand, Blaise Genest, Hugo Gimbert:
Qualitative Determinacy and Decidability of Stochastic Games with Signals. 319-328
Session 13
- Benjamin Rossman:
Combining Ehrenfeucht-Fraïssé Games. 331 - Kristoffer Arnsfelt Hansen, Michal Koucký, Peter Bro Miltersen:
Winning Concurrent Reachability Games Requires Doubly-Exponential Patience. 332-341 - Alessandro Bianco, Fabio Mogavero, Aniello Murano:
Graded Computation Tree Logic. 342-351
Session 14
- Chuck C. Liang, Dale Miller:
A Unified Sequent Calculus for Focused Proofs. 355-364 - Carles Creus, Guillem Godoy, Francesc Massanes, Ashish Tiwari:
Non-linear Rewrite Closure and Weak Normalization. 365-374 - Michele Basaldella, Claudia Faggian:
Ludics with Repetitions (Exponentials, Interactive Types and Completeness). 375-384
Session 15
- Arnaud Durand, Miki Hermann, Gustav Nordh:
Trichotomy in the Complexity of Minimal Inference. 387-396 - Yijia Chen, Jörg Flum:
A Logic for PTIME and a Parameterized Halting Problem. 397-406 - Yevgeny Kazakov, Ian Pratt-Hartmann:
A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics. 407-416
Session 16
- Andrei A. Bulatov, Dániel Marx:
The Complexity of Global Cardinality Constraints. 419-428 - Florent R. Madelaine, Barnaby Martin:
The Complexity of Positive First-order Logic without Equality. 429-438
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-11-16 23:37 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:
