LICS A*

47 papers

YearTitle / Authors
19900-1 Laws for Infinitary Logics (Preliminary Report)
Phokion G. Kolaitis, Moshe Y. Vardi
1990A Categorical Linear Framework for Petri Nets
Carolyn Brown, Doug Gurr
1990A Constraint Sequent Calculus
Jean-Louis Lassez, Ken McAloon
1990A Constructive Proof of Higman's Lemma
Chetan R. Murthy, James R. Russell
1990A Decision Procedure for a Class of Set Constraints (Extended Abstract)
Nevin Heintze, Joxan Jaffar
1990A Linear Semantics for Allowed Logic Programs
Serenella Cerrito
1990A Logic of Concrete Time Intervals (Extended Abstract)
Harry R. Lewis
1990A New AC Unification Algorithm with an Algorithm for Solving Systems of Diophantine Equations
Alexandre Boudet, Evelyne Contejean, Hervé Devie
1990A Per Model of Polymorphism and Recursive Types
Martín Abadi, Gordon D. Plotkin
1990A Theory of Nonmonotonic Rule Systems
V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
1990ALOGTIME and a Conjecture of S. A. Cook (Extended Abstract)
Peter Clote
1990Completeness for typed lazy inequalities
Stavros S. Cosmadakis, Albert R. Meyer, Jon G. Riecke
1990Conditional Lambda-Theories and the Verification of Static Properties of Programs
Mitchell Wand, Zheng-Yu Wang
1990Effective Domains and Intrinsic Structure
Wesley Phoa
1990Equation Solving Using Modal Transition Systems
Kim Guldstrand Larsen, Xinxin Liu
1990Explicit Clock Temporal Logic
Eyal Harel, Orna Lichtenstein, Amir Pnueli
1990Extensional PERs
Peter J. Freyd, P. Mulry, Giuseppe Rosolini, Dana S. Scott
1990Implicit Definability on Finite Structures and Unambiguous Computations (Preliminary Report)
Phokion G. Kolaitis
1990Model-Checking for Real-Time Systems
Rajeev Alur, Costas Courcoubetis, David L. Dill
1990Modelling Shared State in a Shared Action Model
Kenneth J. Goldman, Nancy A. Lynch
1990New Foundations for Fixpoint Computations
Roy L. Crole, Andrew M. Pitts
1990Normal Process Representatives
Vijay Gehlot, Carl A. Gunter
1990On Subsumption and Semiunification in Feature Algebras
Jochen Dörre, William C. Rounds
1990On the Expression of Monadic Second-Order Graph Properties Without Quantifications Over Sets of Edges (Extended Abstract)
Bruno Courcelle
1990On the Limits of Efficient Temporal Decidability (Extended Abstract)
E. Allen Emerson, Michael Evangelist, Jai Srinivasan
1990On the Power of Bounded Concurrency~III: Reasoning About Programs (Preliminary Report)
David Harel, Roni Rosner, Moshe Y. Vardi
1990Polymorphism, Set Theory, and Call-by-Value
Edmund Robinson, Giuseppe Rosolini
1990Proceedings of the Fifth Annual Symposium on Logic in Computer Science (LICS '90), Philadelphia, Pennsylvania, USA, June 4-7, 1990
1990Programming in Equational Logic: Beyond Strong Sequentiality
R. C. Sekar, I. V. Ramakrishnan
1990Proof Transformations for Equational Theories
Tobias Nipkow
1990Reactive, Generative, and Stratified Models of Probabilistic Processes
Rob J. van Glabbeek, Scott A. Smolka, Bernhard Steffen, Chris M. N. Tofts
1990Real-time Logics: Complexity and Expressiveness
Rajeev Alur, Thomas A. Henzinger
1990Recursive Types Reduced to Inductive Types
Peter J. Freyd
1990Single-Threaded Polymorphic Lambda Calculus
Juan C. Guzmán, Paul Hudak
1990Solving Inequations in Term Algebras (Extended Abstract)
Hubert Comon
1990Symbolic Model Checking: 10^20 States and Beyond
Jerry R. Burch, Edmund M. Clarke, Kenneth L. McMillan, David L. Dill, L. J. Hwang
1990Syntactic Theories and Unification
Claude Kirchner, Francis Klay
1990The Classification of Continuous Domains (Extended Abstract)
Achim Jung
1990The Dynamic Logic of Permission
Ron van der Meyden
1990The Nonexistence of Finite Axiomatisations for CCS Congruences
Faron Moller
1990The Semantics of Reflected Proof
Stuart F. Allen, Robert L. Constable, Douglas J. Howe, William E. Aitken
1990The Theory of Ground Rewrite Systems is Decidable
Max Dauchet, Sophie Tison
1990Three Logics for Branching Bisimulation (Extended Abstract)
Rocco De Nicola, Frits W. Vaandrager
1990Type Reconstruction in Finite-Rank Fragments of the Polymorphic lambda-Calculus (Extended Summary)
A. J. Kfoury, Jerzy Tiuryn
1990Universal Domains in the Theory of Denotational Semantics of Programming Languages
Manfred Droste, Rüdiger Göbel
1990Well Rewrite Orderings
Pierre Lescanne
1990When is "Partial" Adequate? A Logic-Based Proof Technique Using Partial Specifications
Rance Cleaveland, Bernhard Steffen