Jörg Flum, Mario Rodríguez-Artalejo
Proceedings of the 13th International Workshop on Computer Science Logic / Eighth Annual Conference of the EACSL
CSL, 1999.

@proceedings{CSL-1999,
	address       = "Madrid, Spain",
	editor        = "Jörg Flum and Mario Rodríguez-Artalejo",
	isbn          = "3-540-66536-6",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 13th International Workshop on Computer Science Logic / Eighth Annual Conference of the EACSL}",
	volume        = 1683,
	year          = 1999,
}

Contents (41 items)

10 ×#logic
4 ×#complexity
4 ×#game studies
3 ×#proving
3 ×#quantifier
3 ×#query
3 ×#type system
3 ×#using
2 ×#analysis
2 ×#bound

CSL-1999-Vianu #database #query

Topological Queries in Spatial Databases (VV), p. 1.

CSL-1999-Balcazar #consistency #learning #query

The Consistency Dimension, Compactness, and Query Learning (JLB), pp. 2–13.

CSL-1999-Grohe #complexity

Descriptive and Parameterized Complexity (MG), pp. 14–31.

CSL-1999-Mosses #logic #semantics #specification

Logical Specification of Operational Semantics (PDM), pp. 32–49.

CSL-1999-DelzannoEP #analysis #constraints #protocol

Constraint-Based Analysis of Broadcast Protocols (GD, JE, AP), pp. 50–66.

CSL-1999-GradelK #complexity #constraints #database

Descriptive Complexity Theory for Constraint Databases (EG, SK), pp. 67–81.

CSL-1999-Leivant #complexity

Applicative Control and Computational Complexity (DL), pp. 82–95.

CSL-1999-ArtsG #erlang #process #verification

Applying Rewriting Techniques to the Verification of Erlang Processes (TA, JG), pp. 96–110.

CSL-1999-MollerLAH #diagrams #difference

Difference Decision Diagrams (JBM, JL, HRA, HH), pp. 111–125.

CSL-1999-Franzle #analysis #hybrid #infinity

Analysis of Hybrid Systems: An Ounce of Realism Can Save an Infinity of States (MF), pp. 126–140.

CSL-1999-KestenP #abstraction #liveness #verification

Verifying Liveness by Augmented Abstraction (YK, AP), pp. 141–156.

CSL-1999-Rasmussen #logic

Signed Interval Logic (TMR), pp. 157–171.

CSL-1999-HirshfeldR #logic

Quantitative Temporal Logic (YH, AMR), pp. 172–187.

CSL-1999-DiekertG #logic

An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces (VD, PG), pp. 188–203.

CSL-1999-Bonelli #using

Using Fields and Explicit Substitutions to Implement Objects and Functions in a de Bruijn Setting (EB), pp. 204–219.

CSL-1999-FernandezM #reduction #λ-calculus

Closed Reductions in the λ-Calculus (MF, IM), pp. 220–234.

CSL-1999-IshtiaqP #modelling #λ-calculus

Kripke Resource Models of a Dependently-Typed, Bunched λ-Calculus (SSI, DJP), pp. 235–249.

CSL-1999-BalatC #linear #logic #morphism

A Linear Logical View of Linear Type Isomorphisms (VB, RDC), pp. 250–265.

CSL-1999-VosV #game studies #logic programming #nash #source code

Choice Logic Programs and Nash Equilibria in Strategic Games (MDV, DV), pp. 266–276.

CSL-1999-HagiharaY #logic

Resolution Method for Modal Logic with Well-Founded Frames (SH, NY), pp. 277–291.

CSL-1999-Tobies #logic #strict

A NExpTime-Complete Description Logic Strictly Contained in C2 (ST), pp. 292–306.

CSL-1999-ArecesBM #complexity #hybrid #logic

A Road-Map on Complexity for Hybrid Logics (CA, PB, MM), pp. 307–321.

CSL-1999-LautemannW #quantifier #reduction

MonadicNLIN and Quantifier-Free Reductions (CL, BW), pp. 322–337.

CSL-1999-Marcinkowski #game studies #reachability

Directed Reachability: From Ajtai-Fagin to Ehrenfeucht-Fraïssé Games (JM), pp. 338–349.

CSL-1999-Bradfield #fixpoint #game studies #quantifier

Fixpoint Alternation and the Game Quantifier (JCB), pp. 350–361.

CSL-1999-Toran #bound

Lower Bounds for Space in Resolution (JT), pp. 362–373.

CSL-1999-Stewart #array #quantifier

Program Schemes, Arrays, Lindström Quantifiers and Zero-One Laws (IAS), pp. 374–388.

CSL-1999-Beklemishev #bound #query

Open Least Element Principle and Bounded Query Computation (LDB), pp. 389–404.

CSL-1999-KerNO #game studies

A Universal Innocent Game Model for the Böhm Tree λ Theory (ADK, HN, CHLO), pp. 405–419.

CSL-1999-CompagnoniG #higher-order #symmetry #type system

Anti-Symmetry of Higher-Order Subtyping (ABC, HG), pp. 420–438.

CSL-1999-GeuversPZ #proving #type system

Safe Proof Checking in Type Theory with Y (HG, EP, JZ), pp. 439–452.

CSL-1999-AltenkirchR #induction #monad #using

Monadic Presentations of λ Terms Using Generalized Inductive Types (TA, BR), pp. 453–468.

CSL-1999-Roversi #logic #proving

A P-Time Completeness Proof for Light Logics (LR), pp. 469–483.

CSL-1999-SeidlN #fixpoint #on the

On Guarding Nested Fixpoints (HS, AN), pp. 484–498.

CSL-1999-KuceraE #algebra #logic

A Logical Viewpoint on Process-Algebraic Quotients (AK, JE), pp. 499–514.

CSL-1999-GastinM #concurrent #parallel #programming language #semantics

A Truly Concurrent Semantics for a Simple Parallel Programming Language (PG, MWM), pp. 515–529.

CSL-1999-Hannay #refinement #specification #system f

Specification Refinement with System F (JEH), pp. 530–545.

CSL-1999-HonsellS

Pre-logical Relations (FH, DS), pp. 546–561.

CSL-1999-KinoshitaP #call-by #programming language

Data-Refinement for Call-By-Value Programming Languages (YK, JP), pp. 562–576.

CSL-1999-Middeldorp #term rewriting

Term Rewriting (AM), p. 577.

CSL-1999-Howe #interactive #proving #theorem proving #type system #using

Interactive Theorem Proving Using Type Theory (DJH), p. 578.