Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
LICS, 1996.

@proceedings{LICS-1996,
	address       = "New Brunswick, New Jersey, USA",
	ee            = "http://www.computer.org/csdl/proceedings/lics/1996/7463/00/index.html",
	isbn          = "0-8186-7463-6",
	publisher     = "{IEEE Computer Society}",
	title         = "{Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science}",
	year          = 1996,
}

Contents (49 items)

7 ×#logic
5 ×#decidability
5 ×#linear
4 ×#on the
4 ×#problem
3 ×#automaton
3 ×#calculus
3 ×#complexity
3 ×#model checking
3 ×#normalisation

LICS-1996-MedinaI #theorem

A Generalization of Fagin’s Theorem (JAM, NI), pp. 2–12.

LICS-1996-Marcinkowski #bound #datalog #decidability

DATALOG SIRUPs Uniform Boundedness is Undecidable (JM), pp. 13–24.

LICS-1996-BenediktL #constraints #on the #query

On the Structure of Queries in Constraint Query Languages (MB, LL), pp. 25–34.

LICS-1996-Stark #abstract domain #domain model #π-calculus

A Fully Abstract Domain Model for the π-Calculus (IS), pp. 36–42.

LICS-1996-FioreMS #π-calculus

A Fully-Abstract Model for the π-Calculus (MPF, EM, DS), pp. 43–54.

LICS-1996-CattaniS #higher-order

Higher Dimensional Transition Systems (GLC, VS), pp. 55–62.

LICS-1996-NatarajanC #algebra #performance #process

An Algebraic Theory of Process Efficiency (VN, RC), pp. 63–72.

LICS-1996-TiurynU #decidability #higher-order #problem #type system

The Subtyping Problem for Second-Order Types is Undecidable (JT, PU), pp. 74–85.

LICS-1996-AspinallC #dependent type #type system

Subtyping Dependent Types (DA, ABC), pp. 86–97.

LICS-1996-AltenkirchHS #normalisation #polymorphism

Reduction-Free Normalisation for a Polymorphic System (TA, MH, TS), pp. 98–106.

LICS-1996-EtessamiW #logic

An Until Hierarchy for Temporal Logic (KE, TW), pp. 108–117.

LICS-1996-Ramanujam #linear #logic

Locally Linear Time Temporal Logic (RR), pp. 118–127.

LICS-1996-Seidl #calculus #μ-calculus

A Modal μ-Calculus for Durational Transition Systems (HS), pp. 128–137.

LICS-1996-McAllesterGWK #constraints #set

Tarskian Set Constraints (DAM, RG, CW, DK), pp. 138–147.

LICS-1996-Pitts #logic #reasoning

Reasoning about Local Variables with Operationally-Based Logical Relations (AMP), pp. 152–163.

LICS-1996-Brookes #algol #parallel

The Essence of Parallel Algol (SDB), pp. 164–173.

LICS-1996-McCusker #abstraction #game studies

Games and Full Abstraction for FPC (GM), pp. 174–183.

LICS-1996-Davies #analysis #approach

A Temporal-Logic Approach to Binding-Time Analysis (RD), pp. 184–195.

LICS-1996-GodefroidL #protocol #queue #verification

Symbolic Protocol Verification With Queue BDDs (PG, DEL), pp. 198–206.

LICS-1996-AlurH

Reactive Modules (RA, TAH), pp. 207–218.

LICS-1996-AlurMP #concurrent #correctness #model checking

Model-Checking of Correctness Conditions for Concurrent Objects (RA, KLM, DP), pp. 219–228.

LICS-1996-Ong #category theory #proving #semantics

A Semantic View of Classical Proofs: Type-Theoretic, Categorical, and Denotational Characterizations (CHLO), pp. 230–241.

LICS-1996-AbadiF #recursion

Syntactic Considerations on Recursive Types (MA, MPF), pp. 242–252.

LICS-1996-HillebrandK #on the #power of #λ-calculus

On the Expressive Power of Simply Typed and Let-Polymorphic λ Calculi (GGH, PCK), pp. 253–263.

LICS-1996-CervesatoP #framework #linear #logic

A Linear Logical Framework (IC, FP), pp. 264–275.

LICS-1996-Henzinger #automaton #formal method #hybrid

The Theory of Hybrid Automata (TAH), pp. 278–292.

LICS-1996-WillemsW #branch #linear #model checking #partial order

Partial-Order Methods for Model Checking: From Linear Time to Branching Time (BW, PW), pp. 294–303.

LICS-1996-BhatC #calculus #equation #model checking #performance #μ-calculus

Efficient Model Checking via the Equational μ-Calculus (GB, RC), pp. 304–312.

LICS-1996-AbdullaCJT #decidability #infinity #theorem

General Decidability Theorems for Infinite-State Systems (PAA, KC, BJ, YKT), pp. 313–321.

LICS-1996-KupfermanSV #automaton #word

Relating Word and Tree Automata (OK, SS, MYV), pp. 322–332.

LICS-1996-HirstH #complexity #recursion

More About Recursive Structures: Descriptive Complexity and Zero-One Laws (TH, DH), pp. 334–347.

LICS-1996-KolaitisV #logic #on the #power of

On the Expressive Power of Variable-Confined Logics (PGK, MYV), pp. 348–359.

LICS-1996-McColm #graph #random

Zero-One Laws for Gilbert Random Graphs (GLM), pp. 360–369.

LICS-1996-Edalat

The Scott Topology Induces the Weak Topology (AE), pp. 372–381.

LICS-1996-EdalatE #integration

Integration in Real PCF (AE, MHE), pp. 382–393.

LICS-1996-DanosHR #automaton #game studies #semantics

Game Semantics & Abstract Machines (VD, HH, LR), pp. 394–405.

LICS-1996-Pradhan #logic programming #semantics #source code

Semantics of Normal Logic Programs and Contested Information (SP), pp. 406–415.

LICS-1996-BentonW #linear #logic #monad #λ-calculus

Linear Logic, Monads and the λ Calculus (PNB, PW), pp. 420–431.

LICS-1996-Selinger #finite #modelling

Order-Incompleteness and Finite λ Models (PS), pp. 432–439.

LICS-1996-Munoz #calculus #confluence #normalisation

Confluence and Preservation of Strong Normalisation in an Explicit Substitutions Calculus (CAM), pp. 440–447.

LICS-1996-BethkeKV #algebra #combinator #normalisation

Completing Partial Combinatory Algebras With Unique Head-Normal Forms (IB, JWK, RCdV), pp. 448–454.

LICS-1996-BasinG #analysis #complexity #order

Complexity Analysis Based on Ordered Resolution (DAB, HG), pp. 456–465.

LICS-1996-Narendran #equation #linear #polynomial

Solving Linear Equations over Polynomial Semirings (PN), pp. 466–472.

LICS-1996-Nieuwenhuis #decidability

Basic Paramodulation and Decidable Theories (RN), pp. 473–482.

LICS-1996-Nurmonen #finite #order #quantifier

Counting Modulo Quantifiers on Finite Linearly Ordered Trees (JN), pp. 484–493.

LICS-1996-DegtyarevMV #algorithm #problem

Simultaneous E-Unification and Related Algorithmic Problems (AD, YM, AV), pp. 494–502.

LICS-1996-DegtyarevV #decidability #logic #problem

Decidability Problems for the Prenex Fragment of Intuitionistic Logic (AD, AV), pp. 503–512.

LICS-1996-MarekNR #abduction #complexity #on the

On the Complexity of Abduction (VWM, AN, JBR), pp. 513–522.

LICS-1996-MatiyasevichS #problem

Decision Problems for Semi-Thue Systems with a Few Rules (YM, GS), pp. 523–531.