Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCID11th LICS 1996: New Brunswick, New Jersey
- Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science, New Brunswick, New Jersey, USA, July 27-30, 1996. IEEE Computer Society 1996, ISBN 0-8186-7463-6
- J. Antonio Medina, Neil Immerman:
A Generalization of Fagin's Theorem. 2-12 - Jerzy Marcinkowski:
DATALOG SIRUPs Uniform Boundedness is Undecidable. 13-24 - Michael Benedikt, Leonid Libkin:
On the Structure of Queries in Constraint Query Languages. 25-34 - Ian Stark:
A Fully Abstract Domain Model for the pi-Calculus. 36-42 - Marcelo P. Fiore, Eugenio Moggi, Davide Sangiorgi:
A Fully-Abstract Model for the pi-Calculus (Extended Abstract). 43-54 - Gian Luca Cattani, Vladimiro Sassone:
Higher Dimensional Transition Systems. 55-62 - V. Natarajan, Rance Cleaveland:
An Algebraic Theory of Process Efficiency. 63-72 - Jerzy Tiuryn, Pawel Urzyczyn:
The Subtyping Problem for Second-Order Types is Undecidable. 74-85 - David Aspinall, Adriana B. Compagnoni:
Subtyping Dependent Types (Summary). 86-97 - Thorsten Altenkirch, Martin Hofmann, Thomas Streicher:
Reduction-Free Normalisation for a Polymorphic System. 98-106 - Kousha Etessami, Thomas Wilke:
An Until Hierarchy for Temporal Logic. 108-117 - Ramaswamy Ramanujam:
Locally Linear Time Temporal Logic. 118-127 - Helmut Seidl:
A Modal Mu-Calculus for Durational Transition Systems. 128-137 - David A. McAllester, Robert Givan, Carl Witty, Dexter Kozen:
Tarskian Set Constraints. 138-147 - Andrew M. Pitts:
Reasoning about Local Variables with Operationally-Based Logical Relations. 152-163 - Stephen D. Brookes:
The Essence of Parallel Algol. 164-173 - Guy McCusker:
Games and Full Abstraction for FPC. 174-183 - Rowan Davies:
A Temporal-Logic Approach to Binding-Time Analysis. 184-195 - Patrice Godefroid, David E. Long:
Symbolic Protocol Verification With Queue BDDs. 198-206 - Rajeev Alur, Thomas A. Henzinger:
Reactive Modules. 207-218 - Rajeev Alur, Kenneth L. McMillan, Doron A. Peled:
Model-Checking of Correctness Conditions for Concurrent Objects. 219-228 - C.-H. Luke Ong
:
A Semantic View of Classical Proofs: Type-Theoretic, Categorical, and Denotational Characterizations (Preliminary Extended Abstract). 230-241 - Martín Abadi, Marcelo P. Fiore:
Syntactic Considerations on Recursive Types. 242-252 - Gerd G. Hillebrand, Paris C. Kanellakis:
On the Expressive Power of Simply Typed and Let-Polymorphic Lambda Calculi. 253-263 - Iliano Cervesato, Frank Pfenning:
A Linear Logical Framework. 264-275 - Thomas A. Henzinger:
The Theory of Hybrid Automata. 278-292 - Bernard Willems, Pierre Wolper:
Partial-Order Methods for Model Checking: From Linear Time to Branching Time. 294-303 - Girish Bhat, Rance Cleaveland:
Efficient Model Checking via the Equational µ-Calculus. 304-312 - Parosh Aziz Abdulla, Karlis Cerans, Bengt Jonsson, Yih-Kuen Tsay:
General Decidability Theorems for Infinite-State Systems. 313-321 - Orna Kupferman, Shmuel Safra, Moshe Y. Vardi:
Relating Word and Tree Automata. 322-332 - Tirza Hirst, David Harel:
More About Recursive Structures: Descriptive Complexity and Zero-One Laws. 334-347 - Phokion G. Kolaitis, Moshe Y. Vardi:
On the Expressive Power of Variable-Confined Logics. 348-359 - Gregory L. McColm:
Zero-One Laws for Gilbert Random Graphs. 360-369 - Abbas Edalat:
The Scott Topology Induces the Weak Topology. 372-381 - Abbas Edalat, Martín Hötzel Escardó:
Integration in Real PCF. 382-393 - Vincent Danos, Hugo Herbelin, Laurent Regnier:
Game Semantics & Abstract Machines. 394-405 - Shekhar Pradhan:
Semantics of Normal Logic Programs and Contested Information. 406-415 - P. N. Benton, Philip Wadler:
Linear Logic, Monads and the Lambda Calculus. 420-431 - Peter Selinger:
Order-Incompleteness and Finite Lambda Models (Extended Abstract). 432-439 - César A. Muñoz:
Confluence and Preservation of Strong Normalisation in an Explicit Substitutions Calculus. 440-447 - Inge Bethke, Jan Willem Klop, Roel C. de Vrijer:
Completing Partial Combinatory Algebras With Unique Head-Normal Forms. 448-454 - David A. Basin, Harald Ganzinger:
Complexity Analysis Based on Ordered Resolution. 456-465 - Paliath Narendran:
Solving Linear Equations over Polynomial Semirings. 466-472 - Robert Nieuwenhuis:
Basic Paramodulation and Decidable Theories (Extended Abstract). 473-482 - Juha Nurmonen:
Counting Modulo Quantifiers on Finite Linearly Ordered Trees. 484-493 - Anatoli Degtyarev, Yuri V. Matiyasevich, Andrei Voronkov:
Simultaneous E-Unification and Related Algorithmic Problems. 494-502 - Anatoli Degtyarev, Andrei Voronkov:
Decidability Problems for the Prenex Fragment of Intuitionistic Logic. 503-512 - V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel:
On the Complexity of Abduction. 513-522 - Yuri V. Matiyasevich, Géraud Sénizergues:
Decision Problems for Semi-Thue Systems with a Few Rules. 523-531
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2021-10-16 02:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp has been originally created in 1993 at:
since 2018, dblp is operated and maintained by:
the dblp computer science bibliography is funded and supported by:
