13. LICS 1998:
Indianapolis,
Indiana,
USA
Thirteenth Annual IEEE Symposium on Logic in Computer Science,
21-24 June,
1998,
Indianapolis,
Indiana,
IEEE Computer Society,
1998
Invited Lecture
Finite Model Theory I
Verification
- Witold Charatonik, David A. McAllester, Damian Niwinski, Andreas Podelski, Igor Walukiewicz:
The Horn Mu-calculus.
58-69 BibTeX
- E. Allen Emerson, Kedar S. Namjoshi:
On Model Checking for Non-Deterministic Infinite-State Systems.
70-80 BibTeX
- Orna Kupferman, Moshe Y. Vardi:
Freedom, Weakness, and Determinism: From Linear-Time to Branching-Time.
81-92 BibTeX
- George C. Necula, Peter Lee:
Efficient Representation and Validation of Proofs.
93-104 BibTeX
- Martín Abadi, Cédric Fournet, Georges Gonthier:
Secure Implementation of Channel Abstractions.
105-116 BibTeX
Logics
Tutorial
Concurrency I
Category Theory
- Lars Birkedal, Aurelio Carboni, Giuseppe Rosolini, Dana S. Scott:
Type Theory via Exact Categories.
188-198 BibTeX
- Claudio Hermida, Michael Makkai, John Power:
Higher Dimensional Multigraphs.
199-206 BibTeX
- Peter Johnstone, John Power, Toru Tsujishita, Hiroshi Watanabe, James Worrell:
An Axiomatics for Categories of Transition Systems as Coalgebras.
207-213 BibTeX
- Gian Luca Cattani, Marcelo P. Fiore, Glynn Winskel:
A Theory of Recursive Domains with Applications to Concurrency.
214-225 BibTeX
Invited Lecture
Tutorial
Theorem Proving and Rewriting
Game Semantics
Type Theory
- Makoto Tatsuta:
Realizability for Constructive Theory of Functions and Classes and its Application to Program Synthesis.
358-367 BibTeX
- Hirofumi Yokouchi:
Completeness of Type Assignment Systems with Intersection, Union, and Type Quantifiers.
368-379 BibTeX
- Ramesh Viswanathan:
Full Abstraction for First-Order Objects with Recursive Types and Subtyping.
380-391 BibTeX
Invited Lecture
Calculus and Lambda-Calculus
Constraints and Complexity
Concurrency II
Finite Model Theory II
Copyright © Sat May 16 23:28:47 2009
by Michael Ley (ley@uni-trier.de)
