Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
LICS, 1997.

@proceedings{LICS-1997,
	address       = "Warsaw, Poland",
	ee            = "http://www.computer.org/csdl/proceedings/lics/1997/7925/00/index.html",
	isbn          = "0-8186-7925-5",
	publisher     = "{IEEE Computer Society}",
	title         = "{Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science}",
	year          = 1997,
}

Contents (39 items)

7 ×#logic
4 ×#complexity
4 ×#linear
4 ×#process
3 ×#game studies
3 ×#higher-order
3 ×#induction
3 ×#on the
3 ×#reasoning
2 ×#algebra

LICS-1997-Baader #order #reduction

Combination of Compatible Reduction Orderings that are Total on Ground Terms (FB), pp. 2–13.

LICS-1997-BouhoulaJ #automation #induction

Automata-Driven Automated Induction (AB, JPJ), pp. 14–25.

LICS-1997-ComonJ

Ground Reducibility is EXPTIME-Complete (HC, FJ), pp. 26–34.

LICS-1997-CosmoK #normalisation #proving

Strong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets (RDC, DK), pp. 35–46.

LICS-1997-KanovichI #concurrent #linear #logic #process #specification

Temporal Linear Logic Specifications for Concurrent Processes (MIK, TI), pp. 48–57.

LICS-1997-Laird #abstraction #functional

Full Abstraction for Functional Languages with Control (JL), pp. 58–67.

LICS-1997-BaillotDE #game studies #linear #logic

Believe it or not, AJM’s Games Model is a Model of Classical Linear Logic (PB, VD, TE, LR), pp. 68–75.

LICS-1997-Hughes #game studies #system f

Games and Definability for System F (DJDH), pp. 76–86.

LICS-1997-AndersenH #diagrams

Boolean Expression Diagrams (HRA, HH), pp. 88–98.

LICS-1997-DziembowskiJW #game studies #how #infinity #memory management #question

How Much Memory is Needed to Win Infinite Games? (SD, MJ, IW), pp. 99–110.

LICS-1997-HuthK #analysis #model checking

Quantitative Analysis and Model Checking (MH, MZK), pp. 111–122.

LICS-1997-Kobayashi #calculus #concurrent #process

A Partially Deadlock-Free Typed Process Calculus (NK0), pp. 128–139.

LICS-1997-Rathke #fixpoint #induction #process

Unique Fixpoint Induction for Value-Passing Processes (JR), pp. 140–148.

LICS-1997-BluteDEP #bisimulation #markov #process

Bisimulation for Labelled Markov Processes (RB, JD, AE, PP), pp. 149–158.

LICS-1997-AsarinCM #automaton #theorem

A Kleene Theorem for Timed Automata (EA, PC, OM), pp. 160–171.

LICS-1997-Janin #automaton #calculus #fixpoint #reduction #theorem

Automata, Tableaus and a Reduction Theorem for Fixpoint Calculi in Arbitrary Complete Lattices (DJ), pp. 172–182.

LICS-1997-ThiagarajanW #linear #logic

An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces (PST, IW), pp. 183–194.

LICS-1997-Kozen #algebra #complexity #on the #reasoning

On the Complexity of Reasoning in Kleene Algebra (DK), pp. 195–202.

LICS-1997-Libkin #finite #locality #modelling #on the

On the Forms of Locality over Finite Models (LL), pp. 204–215.

LICS-1997-Grohe #finite #scalability

Large Finite Structures with Few Lk-Types (MG), pp. 216–227.

LICS-1997-EtessamiVW #first-order #logic

First-Order Logic with Two Variables and Unary Temporal Logic (KE, MYV, TW), pp. 228–235.

LICS-1997-MatzT #graph #infinity #monad #quantifier

The Monadic Quantifier Alternation Hierarchy over Graphs is Infinite (OM, WT), pp. 236–244.

LICS-1997-PottsEE #semantics

Semantics of Exact Real Arithmetic (PJP, AE, MHE), pp. 248–257.

LICS-1997-RieckeS #call-by #relational

A Relational Account of Call-by-Value Sequentiality (JGR, AS), pp. 258–267.

LICS-1997-FiorePP #axiom #set

Complete Cuboidal Sets in Axiomatic Domain Theory (MPF, GDP, AJP), pp. 268–278.

LICS-1997-TuriP #semantics #towards

Towards a Mathematical Operational Semantics (DT, GDP), pp. 280–291.

LICS-1997-Vorobyov #decidability

The “Hardest” Natural Decidable Theory (SGV), pp. 294–305.

LICS-1997-GradelOR #decidability #logic

Two-Variable Logic with Counting is Decidable (EG, MO, ER), pp. 306–317.

LICS-1997-PacholskiST #complexity #logic

Complexity of Two-Variable Logic with Counting (LP, WS, LT), pp. 318–327.

LICS-1997-ZhangR #complexity #reasoning

Complexity of Power Default Reasoning (GQZ, WCR), pp. 328–339.

LICS-1997-HeintzeM #analysis #on the #polynomial #type system

On the Cubic Bottleneck in Subtyping and Flow Analysis (NH, DAM), pp. 342–351.

LICS-1997-HengleinR #complexity #type system

The Complexity of Subtype Entailment for Simple Types (FH, JR), pp. 352–361.

LICS-1997-CharatonikP #constraints #set

Set Constraints with Intersection (WC, AP), pp. 362–372.

LICS-1997-EscardoS #algebra #induction #recursion

Induction and Recursion on the Partial Real Line via Biquotients of Bifree Algebras (MHE, TS), pp. 376–386.

LICS-1997-HofmannS #continuation #modelling #λ-calculus #μ-calculus

Continuation Models are Universal for λμ-Calculus (MH, TS), pp. 387–395.

LICS-1997-Dezani-CiancagliniTU #parallel

Discrimination by Parallel Observers (MDC, JT, PU), pp. 396–407.

LICS-1997-Goubault-Larrecq #higher-order #unification

Ramified Higher-Order Unification (JGL), pp. 410–421.

LICS-1997-CervesatoP #higher-order #linear

Linear Higher-Order Pre-Unification (IC, FP), pp. 422–433.

LICS-1997-McDowellM #higher-order #logic #reasoning #syntax

A Logic for Reasoning with Higher-Order Abstract Syntax (RM, DM), pp. 434–445.