14. LICS 1999: Trento, Italy
14th Annual IEEE Symposium on Logic in Computer Science, Trento, Italy, July 2-5, 1999. IEEE Computer Society 1999 ISBN 0-7695-0158-3
Invited Talk
- Harvey Friedman: Some Decision Problems of Enormous Complexity. 2-12
Session 1
- Harald Ganzinger, Christoph Meyer, Margus Veanes: The Two-Variable Guarded Fragment with Transitive Relations. 24-34
Session 2
- Alex K. Simpson: Elementary Axioms for Categories of Classes. 77-85
Session 3
- Anindya Banerjee, Nevin Heintze, Jon G. Riecke: Region Analysis and the Polymorphic Lambda Calculus. 88-97
- Antonio Bucciarelli, Silvia De Lorenzis, Adolfo Piperno, Ivano Salvo: Some Computational Properties of Intersection Types. 109-118
Session 4
- Sophia Drossopoulou, Susan Eisenbach, David Wragg: A Fragment Calculus - Towards a Model of Separate Compilation, Linking and Binary Compatibility. 147-156
- Michele Boreale, Rocco De Nicola, Rosario Pugliese: Proof Techniques for Cryptographic Processes. 157-166
- Dexter Kozen: On Hoare Logic and Kleene Algebra with Tests. 167-172
Session 5
- Michael Marz, Alexander Rohr, Thomas Streicher: Full Abstraction and Universality via Realisability. 174-182
- David J. Pym: On Bunched Predicate Logic. 183-192
Session 6
- Martin Hofmann: Semantical Analysis of Higher-Order Abstract Syntax. 204-213
- Miquel Bofill, Guillem Godoy, Robert Nieuwenhuis, Albert Rubio: Paramodulation with Non-Monotonic Orderings. 225-233
- Harish Devarajan, Dominic J. D. Hughes, Gordon D. Plotkin, Vaughan R. Pratt: Full Completeness of the Multiplicative Linear Logic of Chu Spaces. 234-243
Invited Talk
- Roberto Bruni, Ugo Montanari: Cartesian Closed Double Categories, Their Lambda-Notation, and the Pi-Calculus. 246-265
Session 7
- Jan Johannsen: Weak Bounded Arithmetic, the Diffie-Hellman Problem and Constable's Class K. 268-274
- Albert Atserias, Phokion G. Kolaitis: First-Order Logic vs. Fixed-Point Logic in Finite Set Theory. 275-284
- Joachim Niehren, Martin Müller, Jean-Marc Talbot: Entailment of Atomic Set Constraints is PSPACE-Complete. 285-294
- Harald Ganzinger, Hans de Nivelle: A Superposition Decision Procedure for the Guarded Fragment with Equality. 295-303
Session 8
- Georg Gottlob, Reinhard Pichler: Working with Arms: Complexity Results on Atomic Representations of Herbrand Models. 306-315
- Leonid Libkin: Logics with Counting, Auxiliary Relations, and Lower Bounds for Invariant Queries. 316-325
- Matthias Ruhl: Counting and Addition Cannot Express Deterministic Transitive Closure. 326-334
Session 9
- Lawrence C. Paulson: Proving Security Protocols Correct. 370-381
Session 10
- Joseph Y. Halpern, Richard A. Shore: Reasoning about Common Knowledge with Infinitely Many Agents. 384-393
- Thorsten Altenkirch: Extensional Equality in Intensional Type Theory. 412-420
Session 11
- Pasquale Malacaria, Chris Hankin: Non-Deterministic Games and Program Analysis: An Application to Security. 443-452
Session 12
- Stefano Guerrini: Correctness of Multiplicative Proof Nets Is Linear. 454-463
- Martin Hofmann: Linear Types and Non-Size-Increasing Polynomial Time Computation. 464-473
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team