10. LICS 1995:
San Diego, California, USA
Proceedings, 10th Annual IEEE Symposium on Logic in Computer Science,
San Diego, California, USA, 26-29 June 1995.
IEEE Computer Society Press, 1995
- Yonit Kesten, Amir Pnueli:
A Complete Proof Systems for QPTL.
2-12 BibTeX
- Igor Walukiewicz:
Completeness of Kozen's Axiomatisation of the Propositional mu-Calculus.
14-24 BibTeX
- Orna Kupferman, Amir Pnueli:
Once and For All.
25-35 BibTeX
- Bruno Dutertre:
Complete Proof Systems for First Order Interval Temporal Logic.
36-43 BibTeX
- James F. Lynch, Jerzy Tyszkiewicz:
The Infinitary Logic of Sparse Random Graphs.
46-53 BibTeX
- Anuj Dawar, Erich Grädel:
Generalized Quantifiers and 0-1 Laws.
54-64 BibTeX
- Georg Gottlob:
Relativized Logspace and Generalized Quantifiers over Finite Structures.
65-78 BibTeX
- Jan Paredaens, Jan Van den Bussche, Dirk Van Gucht:
First-order Queries on Finite Structures over the Reals.
79-87 BibTeX
- Rajeev Alur, Doron Peled, Wojciech Penczek:
Model-Checking of Causality Properties.
90-100 BibTeX
- Moshe Y. Vardi:
On the Complexity of Modular Model Checking.
101-111 BibTeX
- Farn Wang:
Timing Behavior Analysis for Real-Time Systems.
112-122 BibTeX
- Ahmed Bouajjani, Rachid Echahed, Peter Habermehl:
On the Verification Problem of Nonregular Properties for Nonregular Processes.
123-133 BibTeX
- Michael J. C. Gordon:
The Semantic Challenge of Verilog HDL.
136-145 BibTeX
- Gopalan Nadathur, Donald W. Loveland:
Uniform Proofs and Disjunctive Logic Programming (Extended Abstract).
148-155 BibTeX
- Frank Pfenning:
Structural Cut Elimination.
156-166 BibTeX
- Christopher Lynch:
Paramodulation without Duplication.
167-177 BibTeX
- V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel:
Complexity of Normal Default Logic and Related Modes of Nonmonotonic Reasoning.
178-185 BibTeX
- Alex Mifsud, Robin Milner, A. John Power:
Control Structures.
188-198 BibTeX
- Rob J. van Glabbeek, Gordon D. Plotkin:
Configuration Structures.
199-209 BibTeX
- Simon J. Gay, Rajagopal Nagarajan:
A Typed Calculus of Synchronous Processes.
210-220 BibTeX
- Marino Miculan, Fabio Gadducci:
Modal mu-Types for Processes.
221-231 BibTeX
- Samson Abramsky, Guy McCusker:
Games and Full Abstraction for the Lazy lambda-Calculus.
234-243 BibTeX
- Abbas Edalat:
Domain Theory in Stochastic Processes.
244-254 BibTeX
- Alan Jeffrey:
A Fully Abstract Semantics for a Concurrent Functional Language with Monadic Types.
255-264 BibTeX
- Robert L. Constable:
Experience with Type Theory as a Foundation for Computer Science.
266-279 BibTeX
- Daniel J. Dougherty, Ramesh Subrahmanyam:
Equality between Functionals in the Presence of Coproducts.
282-291 BibTeX
- Giuseppe Longo, Kathleen Milsted, Sergei Soloviev:
A Logic of Subtyping (Extended Abstract).
292-299 BibTeX
- Adolfo Piperno:
Normalization and Extensionality (Extended Abstract).
300-310 BibTeX
- A. J. Kfoury, J. B. Wells:
New Notions of Reduction and Non-Semantic Proofs of beta-Strong Normalization in Typed lambda-Calculi.
311-321 BibTeX
- Alexei P. Stolboushkin:
Finitely Monotone Properties.
324-330 BibTeX
- Kousha Etessami, Neil Immerman:
Tree Canonization and Transitive Closure.
331-341 BibTeX
- Martin Otto:
Ptime Canonization for Two Variables with Counting.
342-352 BibTeX
- Anil Seth:
When Do Fixed Point Logics Capture Complexity Classes?
353-363 BibTeX
- Gilles Dowek, Thérèse Hardin, Claude Kirchner:
Higher-Order Unification via Explicit Substitutions (Extended Abstract).
366-374 BibTeX
- Hubert Comon, Robert Nieuwenhuis, Albert Rubio:
Orderings, AC-Theories and Symbolic Constraint Solving (Extended Abstract).
375-385 BibTeX
- Girish Bhat, Rance Cleaveland, Orna Grumberg:
Efficient On-the-Fly Model Checking for CTL*.
388-397 BibTeX
- Henrik Reif Andersen:
Partial Model Checking (Extended Abstract).
398-407 BibTeX
- Enrico Tronci:
Hardware Verification, Boolean Logic Programming, Boolean Functional Programming.
408-418 BibTeX
- Alex K. Simpson:
Compositionality via Cut-Elimination: Hennessy-Milner Logic for an Arbitrary GSOS.
420-430 BibTeX
- Bengt Jonsson, Wang Yi:
Compositional Testing Preorders for Probabilistic Processes.
431-441 BibTeX
- Vaughan R. Pratt:
The Stone Gamut: A Coordinatization of Mathematics.
444-454 BibTeX
- Erik Palmgren, Viggo Stoltenberg-Hansen:
Logically Presented Domains.
455-463 BibTeX
- François Lamarche:
Games Semantics for Full Propositional Linear Logic.
464-473 BibTeX
- Patrick Lincoln, Andre Scedrov, Natarajan Shankar:
Decision Problems for Second-Order Linear Logic.
476-485 BibTeX
- Max I. Kanovich:
The Complexity of Neutrals in Linear Logic.
486-495 BibTeX
- Alexey P. Kopylov:
Decidability of Linear Affine Logic.
496-504 BibTeX
- Boris A. Trakhtenbrot:
Origins and Metamorphoses of the Trinity: Logic, Nets, Automata.
506-507 BibTeX
- Hubert Comon:
Sequentiality, Second Order Monadic Logic and Tree Automata.
508-517 BibTeX
Copyright © Sat May 16 23:28:47 2009
by Michael Ley (ley@uni-trier.de)
