LICS A*

42 papers

YearTitle / Authors
200217th IEEE Symposium on Logic in Computer Science (LICS 2002), 22-25 July 2002, Copenhagen, Denmark, Proceedings
2002A Fully Abstract May Testing Semantics for Concurrent Objects.
Alan Jeffrey, Julian Rathke
2002A Stratified Semantics of General References A Stratified Semantics of General References.
Amal J. Ahmed, Andrew W. Appel, Roberto Virga
2002A Syntactic Approach to Foundational Proof-Carrying Code.
Nadeem Abdul Hamid, Zhong Shao, Valery Trifonov, Stefan Monnier, Zhaozhong Ni
2002Automatic Decidability.
Christopher Lynch, Barbara Morawska
2002Calibrating Computational Feasibility by Abstraction Rank.
Daniel Leivant
2002Complete Problems for Dynamic Complexity Classes.
William Hesse, Neil Immerman
2002Complexity Classes, Propositional Proof Systems, and Formal Theories.
Stephen A. Cook
2002Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory.
Alex K. Simpson
2002Computing Reachability Relations in Timed Automata.
Catalin Dima
2002Decidable and Undecidable Fragments of First-Order Branching Temporal Logics.
Ian M. Hodkinson, Frank Wolter, Michael Zakharyaschev
2002Deciding Confluence of Certain Term Rewriting Systems in Polynomial Time.
Ashish Tiwari
2002Dense Real-Time Games.
Marco Faella, Salvatore La Torre, Aniello Murano
2002Description Logics: Foundations for Class-based Knowledge Representation.
Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini
2002Domain Theory and Differential Calculus (Functions of one Variable).
Abbas Edalat, André Lieutier
2002Efficient Type Inference for Record Concatenation and Subtyping.
Jens Palsberg, Tian Zhao
2002Expressive Equivalence of Least and Inflationary Fixed-Point Logic.
Stephan Kreutzer
2002Games on Graphs and Sequentially Realizable Functionals.
Martin Hyland, Andrea Schalk
2002Linearity in Process Languages.
Mikkel Nygaard, Glynn Winskel
2002Little Engines of Proof.
Natarajan Shankar
2002Modal and Guarded Characterisation Theorems over Finite Transition Systems.
Martin Otto
2002Monadic Queries over Tree-Structured Data.
Georg Gottlob, Christoph Koch
2002Observational Equivalence of 3rd-Order Idealized Algol is Decidable.
C.-H. Luke Ong
2002On The Lambda Y Calculus.
Richard Statman
2002Polarized Games.
Olivier Laurent
2002Probabilistic Abstraction for Model Checking: An Approach Based on Property Testing.
Sophie Laplante, Richard Lassaigne, Frédéric Magniez, Sylvain Peyronnet, Michel de Rougemont
2002Remarks on Isomorphisms in Typed Lambda Calculi with Empty and Sum Types.
Marcelo P. Fiore, Roberto Di Cosmo, Vincent Balat
2002Semantic Minimization of 3-Valued Propositional Formulae.
Thomas W. Reps, Alexey Loginov, Shmuel Sagiv
2002Semantic Subtyping.
Alain Frisch, Giuseppe Castagna, Véronique Benzaken
2002Semantics and Logic of Object Calculi.
Bernhard Reus, Thomas Streicher
2002Separability, Expressiveness, and Decidability in the Ambient Logic.
Daniel Hirschkoff, Étienne Lozes, Davide Sangiorgi
2002Separation Logic: A Logic for Shared Mutable Data Structures.
John C. Reynolds
2002Some Results on Automatic Structures.
Hajime Ishihara, Bakhadyr Khoussainov, Sasha Rubin
2002Temporal Logic with Forgettable Past.
François Laroussinie, Nicolas Markey, Philippe Schnoebelen
2002The 0-1 law fails for frame satisfiability of propositional modal logic.
Jean-Marie Le Bars
2002The Complexity of First-Order and Monadic Second-Order Logic Revisited.
Markus Frick, Martin Grohe
2002The Metric Analogue of Weak Bisimulation for Probabilistic Processes.
Josée Desharnais, Radha Jagadeesan, Vineet Gupta, Prakash Panangaden
2002The Powerdomain of Indexed Valuations.
Daniele Varacca
2002The Proof Complexity of Linear Algebra.
Michael Soltys, Stephen A. Cook
2002Tree Extension Algebras: Logics, Automata, and Query Languages.
Michael Benedikt, Leonid Libkin
2002Tree-Like Counterexamples in Model Checking.
Edmund M. Clarke, Somesh Jha, Yuan Lu, Helmut Veith
2002Unsatisfiable Random Formulas Are Hard to Certify.
Albert Atserias