LICS A*

47 papers

YearTitle / Authors
199914th Annual IEEE Symposium on Logic in Computer Science, Trento, Italy, July 2-5, 1999
1999A Fragment Calculus - Towards a Model of Separate Compilation, Linking and Binary Compatibility.
Sophia Drossopoulou, Susan Eisenbach, David Wragg
1999A Fully Abstract Game Semantics for Finite Nondeterminism.
Russell Harmer, Guy McCusker
1999A New Approach to Abstract Syntax Involving Binders.
Murdoch Gabbay, Andrew M. Pitts
1999A Superposition Decision Procedure for the Guarded Fragment with Equality.
Harald Ganzinger, Hans de Nivelle
1999Abstract Syntax and Variable Binding.
Marcelo P. Fiore, Gordon D. Plotkin, Daniele Turi
1999Cartesian Closed Double Categories, Their Lambda-Notation, and the Pi-Calculus.
Roberto Bruni, Ugo Montanari
1999Concurrent Games and Full Completeness.
Samson Abramsky, Paul-André Melliès
1999Correctness of Multiplicative Proof Nets Is Linear.
Stefano Guerrini
1999Counting and Addition Cannot Express Deterministic Transitive Closure.
Matthias Ruhl
1999Elementary Axioms for Categories of Classes.
Alex K. Simpson
1999Entailment of Atomic Set Constraints is PSPACE-Complete.
Joachim Niehren, Martin Müller, Jean-Marc Talbot
1999Extensional Equality in Intensional Type Theory.
Thorsten Altenkirch
1999First-Order Logic vs. Fixed-Point Logic in Finite Set Theory.
Albert Atserias, Phokion G. Kolaitis
1999Full Abstraction and Universality via Realisability.
Michael Marz, Alexander Rohr, Thomas Streicher
1999Full Completeness of the Multiplicative Linear Logic of Chu Spaces.
Harish Devarajan, Dominic J. D. Hughes, Gordon D. Plotkin, Vaughan R. Pratt
1999Guarded Fixed Point Logic.
Erich Grädel, Igor Walukiewicz
1999Linear Types and Non-Size-Increasing Polynomial Time Computation.
Martin Hofmann
1999Logics with Aggregate Operators.
Lauri Hella, Leonid Libkin, Juha Nurmonen, Limsoon Wong
1999Logics with Counting, Auxiliary Relations, and Lower Bounds for Invariant Queries.
Leonid Libkin
1999Modular Temporal Logic.
Augustin Baziramwabo, Pierre McKenzie, Denis Thérien
1999Non-Deterministic Games and Program Analysis: An Application to Security.
Pasquale Malacaria, Chris Hankin
1999On Bunched Predicate Logic.
David J. Pym
1999On Hoare Logic and Kleene Algebra with Tests.
Dexter Kozen
1999On the Expressive Power of CTL.
Faron Moller, Alexander Moshe Rabinovich
1999On the Verification of Broadcast Protocols.
Javier Esparza, Alain Finkel, Richard Mayr
1999Parametric Quantitative Temporal Reasoning.
E. Allen Emerson, Richard J. Trefler
1999Paramodulation with Non-Monotonic Orderings.
Miquel Bofill, Guillem Godoy, Robert Nieuwenhuis, Albert Rubio
1999Parikh's Theorem in Commutative Kleene Algebra.
Mark W. Hopkins, Dexter Kozen
1999Pattern Matching as Cut Elimination.
Serenella Cerrito, Delia Kesner
1999Plausibility Measures and Default Reasoning: An Overview.
Joseph Y. Halpern, Nir Friedman
1999Proof Techniques for Cryptographic Processes.
Michele Boreale, Rocco De Nicola, Rosario Pugliese
1999Proving Security Protocols Correct.
Lawrence C. Paulson
1999Reasoning about Common Knowledge with Infinitely Many Agents.
Joseph Y. Halpern, Richard A. Shore
1999Region Analysis and the Polymorphic Lambda Calculus.
Anindya Banerjee, Nevin Heintze, Jon G. Riecke
1999Semantical Analysis of Higher-Order Abstract Syntax.
Martin Hofmann
1999Some Computational Properties of Intersection Types.
Antonio Bucciarelli, Silvia De Lorenzis, Adolfo Piperno, Ivano Salvo
1999Some Decision Problems of Enormous Complexity.
Harvey Friedman
1999Subtyping Recursive Types in Kernel Fun.
Dario Colazzo, Giorgio Ghelli
1999The Higher-Order Recursive Path Ordering.
Jean-Pierre Jouannaud, Albert Rubio
1999The Two-Variable Guarded Fragment with Transitive Relations.
Harald Ganzinger, Christoph Meyer, Margus Veanes
1999Towards a Theory of Bisimulation for Local Names.
Alan Jeffrey, Julian Rathke
1999Two-Variable Descriptions of Regularity.
Erich Grädel, Eric Rosen
1999Type Inference for Recursive Definitions.
A. J. Kfoury, Santiago M. Pericás-Geertsen
1999Weak Bisimulation and Open Maps.
Marcelo P. Fiore, Gian Luca Cattani, Glynn Winskel
1999Weak Bounded Arithmetic, the Diffie-Hellman Problem and Constable's Class K.
Jan Johannsen
1999Working with Arms: Complexity Results on Atomic Representations of Herbrand Models.
Georg Gottlob, Reinhard Pichler