default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID23rd LICS 2008: Pittsburgh, Pennsylvania, USA
- Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24-27 June 2008, Pittsburgh, PA, USA. IEEE Computer Society 2008, ISBN 978-0-7695-3183-0
Session 1 (Joint CSF/LICS)
- Christoph Sprenger
, David A. Basin:
Cryptographically-Sound Protocol-Model Abstractions. CSF 2008: 115-129 - Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan:
On the Expressiveness and Complexity of Randomization in Finite State Monitors. 18-29
Session 2 (Joint CSF/LICS)
Session 3: Logical Frameworks
- Andrew Gacek, Dale Miller, Gopalan Nadathur:
Combining Generic Judgments with Recursive Definitions. 33-44 - Christian Urban, James Cheney, Stefan Berghofer:
Mechanizing the Metatheory of LF. 45-56 - Marcelo P. Fiore:
Second-Order and Dependently-Sorted Abstract Syntax. 57-68 - Carsten Schürmann, Jeffrey Sarnat:
Structural Logical Relations. 69-80
Session 4: Lambda Calculus
- Makoto Tatsuta:
Types for Hereditary Permutators. 83-92 - Adrià Gascón, Guillem Godoy, Manfred Schmidt-Schauß:
Context Matching for Compressed Terms. 93-102
Session 5: Short Talks (Joint CSF/LICS)
Session 6: Algebraic Reasoning
- Dexter Kozen:
Nonlocal Flow of Control and Kleene Algebra with Tests. 105-117 - Gordon D. Plotkin, Matija Pretnar:
A Logic for Algebraic Effects. 118-129 - Emmanuel Beffara:
An Algebraic Process Calculus. 130-141
Session 7: Process Calculi
- Ivan Lanese, Jorge A. Pérez, Davide Sangiorgi, Alan Schmitt:
On the Expressiveness and Decidability of Higher-Order Process Calculi. 145-155 - Taolue Chen, Wan J. Fokkink:
On the Axiomatizability of Impossible Futures: Preorder versus Equivalence. 156-165 - Sam Staton:
General Structural Operational Semantics through Categorical Logic. 166-177
Session 8: Model Checking
- Vineet Kahlon:
Parameterization as Abstraction: A Tractable Approach to the Dataflow Analysis of Concurrent Programs. 181-192 - Arnaud Carayol, Matthew Hague, Antoine Meyer, C.-H. Luke Ong, Olivier Serre:
Winning Regions of Higher-Order Pushdown Games. 193-204 - Pierre Chambart, Philippe Schnoebelen:
The Ordinal Recursive Complexity of Lossy Channel Systems. 205-216 - Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Marcus Größer:
Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata. 217-226
Session 9: Proof Theory
- Agata Ciabattoni, Nikolaos Galatos, Kazushige Terui:
From Axioms to Analytic Rules in Nonclassical Logics. 229-240 - Daniel R. Licata, Noam Zeilberger, Robert Harper:
Focusing on Binding and Computation. 241-252 - Guillaume Burel:
A First-Order Representation of Pure Type Systems Using Superdeduction. 253-263
Session 10: Computational Complexity
- Martin Grohe:
The Quest for a Logic Capturing PTIME. 267-271 - Søren Riis:
On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity. 272-283 - Klaus Aehlig, Arnold Beckmann:
On the Computational Complexity of Cut-Reduction. 284-293
Session 11: Constraints
- Víctor Dalmau, Benoît Larose:
Maltsev + Datalog --> Symmetric Datalog. 297-306 - Catarina Carvalho, Víctor Dalmau, Andrei A. Krokhin:
Caterpillar Duality for Constraint Satisfaction Problems. 307-316 - Hubie Chen, Florent R. Madelaine, Barnaby Martin:
Quantified Constraints and Containment Problems. 317-328
Session 12: Reasoning About Programs
- François Pottier:
Hiding Local State in Direct Style: A Higher-Order Anti-Frame Rule. 331-340 - Søren B. Lassen, Paul Blain Levy:
Typed Normal Form Bisimulation for Parametric Polymorphism. 341-352 - Andrzej S. Murawski:
Reachability Games and Game Semantics: Comparing Nondeterministic Programs. 353-363 - Abbas Edalat:
Weak Topology and a Differentiable Operator for Lipschitz Maps. 364-375
Session 13: Probabilistic Systems
- James F. Lynch:
A Logical Characterization of Individual-Based Models. 379-390 - Tomás Brázdil, Vojtech Forejt, Jan Kretínský, Antonín Kucera:
The Satisfiability Problem for Probabilistic CTL. 391-402
Session 14: Finite Model Theory
- Yiannis N. Moschovakis:
The Axiomatic Derivation of Absolute Lower Bounds. 405 - Martin Grohe:
Definable Tree Decompositions. 406-417 - David Duris:
Hypergraph Acyclicity and Extension Preservation Theorems. 418-427
Session 15: Automata Theory
- Greg Hjorth, Bakhadyr Khoussainov, Antonio Montalbán, André Nies:
From Automatic Structures to Borel Structures. 431-441 - Mikolaj Bojanczyk, Luc Segoufin, Howard Straubing:
Piecewise Testable Tree Languages. 442-451 - Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre:
Collapsible Pushdown Automata and Recursion Schemes. 452-461
Session 16: Linear Logic
- Marc de Falco:
The Geometry of Interaction of Differential Interaction Nets. 465-475 - Paulin Jacobé de Naurois, Virgile Mogbil:
Correctness of Multiplicative Additive Proof Structures is NL-Complete. 476-485 - Olivier Laurent, Roberto Maieli:
Cut Elimination for Monomial MALL Proof Nets. 486-497 - Olivier Delande, Dale Miller:
A Neutral Approach to Proof and Refutation in MALL. 498-508
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-10-29 01:26 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:
