14. LICS 1999: Trento, Italy

Invited Talk

• Harvey Friedman:
  Some Decision Problems of Enormous Complexity. 2-12
  

Session 1

• Erich Grädel, Eric Rosen:
  Two-Variable Descriptions of Regularity. 14-23
  
• Harald Ganzinger, Christoph Meyer, Margus Veanes:
  The Two-Variable Guarded Fragment with Transitive Relations. 24-34
  
• Lauri Hella, Leonid Libkin, Juha Nurmonen, Limsoon Wong:
  Logics with Aggregate Operators. 35-44
  
• Erich Grädel, Igor Walukiewicz:
  Guarded Fixed Point Logic. 45-54
  

Session 2

• Alan Jeffrey, Julian Rathke:
  Towards a Theory of Bisimulation for Local Names. 56-66
  
• Marcelo P. Fiore, Gian Luca Cattani, Glynn Winskel:
  Weak Bisimulation and Open Maps. 67-76
  
• 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
  
• Serenella Cerrito, Delia Kesner:
  Pattern Matching as Cut Elimination. 98-108
  
• Antonio Bucciarelli, Silvia De Lorenzis, Adolfo Piperno, Ivano Salvo:
  Some Computational Properties of Intersection Types. 109-118
  
• A. J. Kfoury, Santiago M. Pericás-Geertsen:
  Type Inference for Recursive Definitions. 119-128
  
• Joseph Y. Halpern, Nir Friedman:
  Plausibility Measures and Default Reasoning: An Overview. 130-135
  

Session 4

• Dario Colazzo, Giorgio Ghelli:
  Subtyping Recursive Types in Kernel Fun. 137-146
  
• 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
  
• Marcelo P. Fiore, Gordon D. Plotkin, Daniele Turi:
  Abstract Syntax and Variable Binding. 193-202
  

Session 6

• Martin Hofmann:
  Semantical Analysis of Higher-Order Abstract Syntax. 204-213
  
• Murdoch Gabbay, Andrew M. Pitts:
  A New Approach to Abstract Syntax Involving Binders. 214-224
  
• 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

• E. Allen Emerson, Richard J. Trefler:
  Parametric Quantitative Temporal Reasoning. 336-343
  
• Augustin Baziramwabo, Pierre McKenzie, Denis Thérien:
  Modular Temporal Logic. 344-351
  
• Javier Esparza, Alain Finkel, Richard Mayr:
  On the Verification of Broadcast Protocols. 352-359
  
• Faron Moller, Alexander Moshe Rabinovich:
  On the Expressive Power of CTL. 360-368
  
• 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
  
• Mark W. Hopkins, Dexter Kozen:
  Parikh's Theorem in Commutative Kleene Algebra. 394-401
  
• Jean-Pierre Jouannaud, Albert Rubio:
  The Higher-Order Recursive Path Ordering. 402-411
  
• Thorsten Altenkirch:
  Extensional Equality in Intensional Type Theory. 412-420
  

Session 11

• Russell Harmer, Guy McCusker:
  A Fully Abstract Game Semantics for Finite Nondeterminism. 422-430
  
• Samson Abramsky, Paul-André Melliès:
  Concurrent Games and Full Completeness. 431-442
  
• 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
  

Last update Thu May 24 04:37:09 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page