|
Conferences in DBLP
- Harvey Friedman
Some Decision Problems of Enormous Complexity. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:2-13 [Conf]
- Erich Grädel, Eric Rosen
Two-Variable Descriptions of Regularity. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:14-23 [Conf]
- Harald Ganzinger, Christoph Meyer, Margus Veanes
The Two-Variable Guarded Fragment with Transitive Relations. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:24-34 [Conf]
- Lauri Hella, Leonid Libkin, Juha Nurmonen, Limsoon Wong
Logics with Aggregate Operators. [Citation Graph (1, 0)][DBLP] LICS, 1999, pp:35-44 [Conf]
- Erich Grädel, Igor Walukiewicz
Guarded Fixed Point Logic. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:45-54 [Conf]
- Alan Jeffrey, Julian Rathke
Towards a Theory of Bisimulation for Local Names. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:56-66 [Conf]
- Marcelo P. Fiore, Gian Luca Cattani, Glynn Winskel
Weak Bisimulation and Open Maps. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:67-76 [Conf]
- Alex K. Simpson
Elementary Axioms for Categories of Classes. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:77-85 [Conf]
- Anindya Banerjee, Nevin Heintze, Jon G. Riecke
Region Analysis and the Polymorphic Lambda Calculus. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:88-97 [Conf]
- Serenella Cerrito, Delia Kesner
Pattern Matching as Cut Elimination. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:98-108 [Conf]
- Antonio Bucciarelli, Silvia De Lorenzis, Adolfo Piperno, Ivano Salvo
Some Computational Properties of Intersection Types. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:109-118 [Conf]
- A. J. Kfoury, Santiago M. Pericás-Geertsen
Type Inference for Recursive Definitions. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:119-129 [Conf]
- Joseph Y. Halpern, Nir Friedman
Plausibility Measures and Default Reasoning: An Overview. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:130-135 [Conf]
- Dario Colazzo, Giorgio Ghelli
Subtyping Recursive Types in Kernel Fun. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:137-146 [Conf]
- Sophia Drossopoulou, Susan Eisenbach, David Wragg
A Fragment Calculus Towards a Model of Separate Compilation, Linking and Binary Compatibility. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:147-156 [Conf]
- Michele Boreale, Rocco De Nicola, Rosario Pugliese
Proof Techniques for Cryptographic Processes. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:157-166 [Conf]
- Dexter Kozen
On Hoare Logic and Kleene Algebra with Tests. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:167-172 [Conf]
- Michael Marz, Alexander Rohr, Thomas Streicher
Full Abstraction and Universality via Realisability. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:174-182 [Conf]
- David J. Pym
On Bunched Predicate Logic. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:183-192 [Conf]
- Marcelo P. Fiore, Gordon D. Plotkin, Daniele Turi
Abstract Syntax and Variable Binding. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:193-202 [Conf]
- Martin Hofmann
Semantical Analysis of Higher-Order Abstract Syntax. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:204-213 [Conf]
- Murdoch Gabbay, Andrew M. Pitts
A New Approach to Abstract Syntax Involving Binders. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:214-224 [Conf]
- Miquel Bofill, Guillem Godoy, Robert Nieuwenhuis, Albert Rubio
Paramodulation with Non-Monotonic Orderings. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:225-233 [Conf]
- Harish Devarajan, Dominic J. D. Hughes, Gordon D. Plotkin, Vaughan R. Pratt
Full Completeness of the Multiplicative Linear Logic of Chu Spaces. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:234-242 [Conf]
- Roberto Bruni, Ugo Montanari
Cartesian Closed Double Categories, Their Lambda-Notation, and the Pi-Calculus. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:246-265 [Conf]
- Jan Johannsen
Weak Bounded Arithmetic, the Diffie-Hellman Problem and Constable's Class K. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:268-274 [Conf]
- Albert Atserias, Phokion G. Kolaitis
First-Order Logic vs. Fixed-Point Logic in Finite Set Theory. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:275-284 [Conf]
- Joachim Niehren, Martin Müller, Jean-Marc Talbot
Entailment of Atomic Set Constraints is PSPACE-Complete. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:285-294 [Conf]
- Harald Ganzinger, Hans de Nivelle
A Superposition Decision Procedure for the Guarded Fragment with Equality. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:295-304 [Conf]
- Georg Gottlob, Reinhard Pichler
Working with Arms: Complexity Results on Atomic Representations of Herbrand Models. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:306-315 [Conf]
- Leonid Libkin
Logics with Counting, Auxiliary Relations, and Lower Bounds for Invariant Queries. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:316-325 [Conf]
- Matthias Ruhl
Counting and Addition Cannot Express Deterministic Transitive Closure. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:326-334 [Conf]
- E. Allen Emerson, Richard J. Trefler
Parametric Quantitative Temporal Reasoning. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:336-343 [Conf]
- Augustin Baziramwabo, Pierre McKenzie, Denis Thérien
Modular Temporal Logic. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:344-351 [Conf]
- Javier Esparza, Alain Finkel, Richard Mayr
On the Verification of Broadcast Protocols. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:352-359 [Conf]
- Faron Moller, Alexander Moshe Rabinovich
On the Expressive Power of CTL. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:360-369 [Conf]
- Lawrence C. Paulson
Proving Security Protocols Correct. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:370-383 [Conf]
- Joseph Y. Halpern, Richard A. Shore
Reasoning about Common Knowledge with Infinitely Many Agents. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:384-393 [Conf]
- Mark W. Hopkins, Dexter Kozen
Parikh's Theorem in Commutative Kleene Algebra. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:394-401 [Conf]
- Jean-Pierre Jouannaud, Albert Rubio
The Higher-Order Recursive Path Ordering. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:402-411 [Conf]
- Thorsten Altenkirch
Extensional Equality in Intensional Type Theory. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:412-420 [Conf]
- Russell Harmer, Guy McCusker
A Fully Abstract Game Semantics for Finite Nondeterminism. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:422-430 [Conf]
- Samson Abramsky, Paul-André Melliès
Concurrent Games and Full Completeness. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:431-442 [Conf]
- Pasquale Malacaria, Chris Hankin
Non-Deterministic Games and Program Analysis: An Application to Security. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:443-452 [Conf]
- Stefano Guerrini
Correctness of Multiplicative Proof Nets Is Linear. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:454-463 [Conf]
- Martin Hofmann
Linear Types and Non-Size-Increasing Polynomial Time Computation. [Citation Graph (0, 0)][DBLP] LICS, 1999, pp:464-473 [Conf]
|