LICS A*

49 papers

YearTitle / Authors
1995A Complete Proof Systems for QPTL
Yonit Kesten, Amir Pnueli
1995A Fully Abstract Semantics for a Concurrent Functional Language with Monadic Types
Alan Jeffrey
1995A Logic of Subtyping (Extended Abstract)
Giuseppe Longo, Kathleen Milsted, Sergei Soloviev
1995A Typed Calculus of Synchronous Processes
Simon J. Gay, Rajagopal Nagarajan
1995Complete Proof Systems for First Order Interval Temporal Logic
Bruno Dutertre
1995Completeness of Kozen's Axiomatisation of the Propositional mu-Calculus
Igor Walukiewicz
1995Complexity of Normal Default Logic and Related Modes of Nonmonotonic Reasoning
V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
1995Compositional Testing Preorders for Probabilistic Processes
Bengt Jonsson, Wang Yi
1995Compositionality via Cut-Elimination: Hennessy-Milner Logic for an Arbitrary GSOS
Alex K. Simpson
1995Configuration Structures
Rob J. van Glabbeek, Gordon D. Plotkin
1995Control Structures
Alex Mifsud, Robin Milner, A. John Power
1995Decidability of Linear Affine Logic
Alexey P. Kopylov
1995Decision Problems for Second-Order Linear Logic
Patrick Lincoln, Andre Scedrov, Natarajan Shankar
1995Domain Theory in Stochastic Processes
Abbas Edalat
1995Efficient On-the-Fly Model Checking for CTL*
Girish Bhat, Rance Cleaveland, Orna Grumberg
1995Equality between Functionals in the Presence of Coproducts
Daniel J. Dougherty, Ramesh Subrahmanyam
1995Experience with Type Theory as a Foundation for Computer Science
Robert L. Constable
1995Finitely Monotone Properties
Alexei P. Stolboushkin
1995First-order Queries on Finite Structures over the Reals
Jan Paredaens, Jan Van den Bussche, Dirk Van Gucht
1995Games Semantics for Full Propositional Linear Logic
François Lamarche
1995Games and Full Abstraction for the Lazy lambda-Calculus
Samson Abramsky, Guy McCusker
1995Generalized Quantifiers and 0-1 Laws
Anuj Dawar, Erich Grädel
1995Hardware Verification, Boolean Logic Programming, Boolean Functional Programming
Enrico Tronci
1995Higher-Order Unification via Explicit Substitutions (Extended Abstract)
Gilles Dowek, Thérèse Hardin, Claude Kirchner
1995Logically Presented Domains
Erik Palmgren, Viggo Stoltenberg-Hansen
1995Modal mu-Types for Processes
Marino Miculan, Fabio Gadducci
1995Model-Checking of Causality Properties
Rajeev Alur, Doron A. Peled, Wojciech Penczek
1995New Notions of Reduction and Non-Semantic Proofs of beta-Strong Normalization in Typed lambda-Calculi
A. J. Kfoury, J. B. Wells
1995Normalization and Extensionality (Extended Abstract)
Adolfo Piperno
1995On the Complexity of Modular Model Checking
Moshe Y. Vardi
1995On the Verification Problem of Nonregular Properties for Nonregular Processes
Ahmed Bouajjani, Rachid Echahed, Peter Habermehl
1995Once and For All
Orna Kupferman, Amir Pnueli
1995Orderings, AC-Theories and Symbolic Constraint Solving (Extended Abstract)
Hubert Comon, Robert Nieuwenhuis, Albert Rubio
1995Origins and Metamorphoses of the Trinity: Logic, Nets, Automata
Boris A. Trakhtenbrot
1995Paramodulation without Duplication
Christopher Lynch
1995Partial Model Checking (Extended Abstract)
Henrik Reif Andersen
1995Proceedings, 10th Annual IEEE Symposium on Logic in Computer Science, San Diego, California, USA, June 26-29, 1995
1995Ptime Canonization for Two Variables with Counting
Martin Otto
1995Relativized Logspace and Generalized Quantifiers over Finite Structures
Georg Gottlob
1995Sequentiality, Second Order Monadic Logic and Tree Automata
Hubert Comon
1995Structural Cut Elimination
Frank Pfenning
1995The Complexity of Neutrals in Linear Logic
Max I. Kanovich
1995The Infinitary Logic of Sparse Random Graphs
James F. Lynch, Jerzy Tyszkiewicz
1995The Semantic Challenge of Verilog HDL
Michael J. C. Gordon
1995The Stone Gamut: A Coordinatization of Mathematics
Vaughan R. Pratt
1995Timing Behavior Analysis for Real-Time Systems
Farn Wang
1995Tree Canonization and Transitive Closure
Kousha Etessami, Neil Immerman
1995Uniform Proofs and Disjunctive Logic Programming (Extended Abstract)
Gopalan Nadathur, Donald W. Loveland
1995When Do Fixed Point Logics Capture Complexity Classes?
Anil Seth