default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID17th LICS 2002: Copenhagen, Denmark
- 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 22-25 July 2002, Copenhagen, Denmark, Proceedings. IEEE Computer Society 2002, ISBN 0-7695-1483-9
FLoC Joint Invited Lecture
- Natarajan Shankar:
Little Engines of Proof. 3-
Session 1
- Christopher Lynch
, Barbara Morawska:
Automatic Decidability. 7-
Session 2
- Edmund M. Clarke, Somesh Jha, Yuan Lu, Helmut Veith:
Tree-Like Counterexamples in Model Checking. 19-29 - Sophie Laplante, Richard Lassaigne, Frédéric Magniez, Sylvain Peyronnet, Michel de Rougemont:
Probabilistic Abstraction for Model Checking: An Approach Based on Property Testing. 30-39 - Thomas W. Reps, Alexey Loginov, Shmuel Sagiv:
Semantic Minimization of 3-Valued Propositional Formulae. 40-
Session 3
- John C. Reynolds:
Separation Logic: A Logic for Shared Mutable Data Structures. 55-74 - Amal J. Ahmed, Andrew W. Appel, Roberto Virga:
A Stratified Semantics of General References A Stratified Semantics of General References. 75-
Session 4
- Nadeem Abdul Hamid, Zhong Shao, Valery Trifonov, Stefan Monnier, Zhaozhong Ni:
A Syntactic Approach to Foundational Proof-Carrying Code. 89-100 - Alan Jeffrey, Julian Rathke:
A Fully Abstract May Testing Semantics for Concurrent Objects. 101-112 - Bernhard Reus, Thomas Streicher:
Semantics and Logic of Object Calculi. 113-
Session 5
- Jens Palsberg, Tian Zhao:
Efficient Type Inference for Record Concatenation and Subtyping. 125-136 - Alain Frisch, Giuseppe Castagna, Véronique Benzaken:
Semantic Subtyping. 137-146 - Marcelo P. Fiore, Roberto Di Cosmo, Vincent Balat:
Remarks on Isomorphisms in Typed Lambda Calculi with Empty and Sum Types. 147-
Session 6
- Richard Statman:
On The Lambda Y Calculus. 159-166 - Marco Faella, Salvatore La Torre, Aniello Murano:
Dense Real-Time Games. 167-176 - Catalin Dima:
Computing Reachability Relations in Timed Automata. 177-
Session 7
- Georg Gottlob, Christoph Koch:
Monadic Queries over Tree-Structured Data. 189-202 - Michael Benedikt, Leonid Libkin:
Tree Extension Algebras: Logics, Automata, and Query Languages. 203-
Session 8
- Markus Frick, Martin Grohe:
The Complexity of First-Order and Monadic Second-Order Logic Revisited. 215-224 - Jean-Marie Le Bars:
The 0-1 law fails for frame satisfiability of propositional modal logic. 225-234 - Hajime Ishihara, Bakhadyr Khoussainov, Sasha Rubin:
Some Results on Automatic Structures. 235-
Session 9
- C.-H. Luke Ong:
Observational Equivalence of 3rd-Order Idealized Algol is Decidable. 245-256 - Martin Hyland, Andrea Schalk:
Games on Graphs and Sequentially Realizable Functionals. 257-264 - Olivier Laurent:
Polarized Games. 265-
Session 10
- Abbas Edalat, André Lieutier:
Domain Theory and Differential Calculus (Functions of one Variable). 277-286 - Alex K. Simpson:
Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory. 287-298 - Daniele Varacca:
The Powerdomain of Indexed Valuations. 299-
Session 11
- Stephen A. Cook:
Complexity Classes, Propositional Proof Systems, and Formal Theories. 311 - William Hesse, Neil Immerman:
Complete Problems for Dynamic Complexity Classes. 313-
Session 12
- Albert Atserias:
Unsatisfiable Random Formulas Are Hard to Certify. 325-334 - Michael Soltys, Stephen A. Cook:
The Proof Complexity of Linear Algebra. 335-344 - Daniel Leivant:
Calibrating Computational Feasibility by Abstraction Rank. 345-
Session 14
- Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini:
Description Logics: Foundations for Class-based Knowledge Representation. 359-370 - Martin Otto:
Modal and Guarded Characterisation Theorems over Finite Transition Systems. 371-
Session 15
- François Laroussinie, Nicolas Markey, Philippe Schnoebelen:
Temporal Logic with Forgettable Past. 383-392 - Ian M. Hodkinson, Frank Wolter, Michael Zakharyaschev:
Decidable and Undecidable Fragments of First-Order Branching Temporal Logics. 393-402 - Stephan Kreutzer:
Expressive Equivalence of Least and Inflationary Fixed-Point Logic. 403-
Session 16
- Josée Desharnais, Radha Jagadeesan, Vineet Gupta, Prakash Panangaden:
The Metric Analogue of Weak Bisimulation for Probabilistic Processes. 413-422 - Daniel Hirschkoff, Étienne Lozes, Davide Sangiorgi:
Separability, Expressiveness, and Decidability in the Ambient Logic. 423-432 - Mikkel Nygaard, Glynn Winskel:
Linearity in Process Languages. 433-
Session 17
- Ashish Tiwari:
Deciding Confluence of Certain Term Rewriting Systems in Polynomial Time. 447-
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-05 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:
