Jerzy Tiuryn
Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures
FoSSaCS, 2000.

@proceedings{FoSSaCS-2000,
	address       = "Berlin, Germany",
	editor        = "Jerzy Tiuryn",
	isbn          = "3-540-67257-5",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures}",
	volume        = 1784,
	year          = 2000,
}

Contents (25 items)

5 ×#on the
4 ×#type system
3 ×#automaton
3 ×#calculus
3 ×#logic
3 ×#refinement
2 ×#bisimulation
2 ×#equivalence
2 ×#linear
2 ×#mobile

FoSSaCS-2000-BaierS #bisimulation #probability

Norm Functions for Probabilistic Bisimulations with Delays (CB, MS), pp. 1–16.

FoSSaCS-2000-BartheR #calculus #induction #type system

Constructor Subtyping in the Calculus of Inductive Constructions (GB, FvR), pp. 17–34.

FoSSaCS-2000-BerardLS #equivalence #parallel #performance #process #verification

Verifying Performance Equivalence for Timed Basic Parallel Processes (BB, AL, PS), pp. 35–47.

FoSSaCS-2000-Caucal #on the #term rewriting #word

On Word Rewriting Systems Having a Rational Derivation (DC), pp. 48–62.

FoSSaCS-2000-CosmoKP #proving

Proof Nets and Explicit Substitutions (RDC, DK, EP), pp. 63–81.

FoSSaCS-2000-Damiani #rank #type system

Typing Local Definitions and Conditional Expressions with Rank 2 Intersection (FD), pp. 82–97.

FoSSaCS-2000-DrewesHP #graph transformation

Hierarchical Graph Transformation (FD, BH, DP), pp. 98–113.

FoSSaCS-2000-EngelhardtMM #framework #reasoning #refinement

A Program Refinement Framework Supporting Reasoning about Knowledge and Time (KE, RvdM, YM), pp. 114–129.

FoSSaCS-2000-Hannay #higher-order #simulation #system f

A Higher-Order Simulation Relation for System F (JEH), pp. 130–145.

FoSSaCS-2000-HerescuP #probability #π-calculus

Probabilistic Asynchronous π-Calculus (OMH, CP), pp. 146–160.

FoSSaCS-2000-HonsellLST #refinement #λ-calculus

Constructive Data Refinement in Typed λ Calculus (FH, JL, DS, AT), pp. 161–176.

FoSSaCS-2000-HussonM #on the

On Recognizable Stable Trace Languages (JFH, RM), pp. 177–191.

FoSSaCS-2000-LaroussinieS #bisimulation #equivalence #explosion #problem

The State Explosion Problem from Trace to Bisimulation Equivalence (FL, PS), pp. 192–207.

FoSSaCS-2000-LinY #automaton #proving

A Proof System for Timed Automata (HL, WY), pp. 208–222.

FoSSaCS-2000-MaiettiPR #category theory #linear #modelling #type system

Categorical Models for Intuitionistic and Linear Type Theory (MEM, VdP, ER), pp. 223–237.

FoSSaCS-2000-Merro #calculus #locality

Locality and Polyadicity in Asynchronous Name-Passing Calculi (MM), pp. 238–251.

FoSSaCS-2000-Morvan #graph #on the

On Rational Graphs (CM), pp. 252–266.

FoSSaCS-2000-Pinto #automaton #concurrent #interactive

Sequential and Concurrent Abstract Machines for Interaction Nets (JSP), pp. 267–282.

FoSSaCS-2000-QuagliaW #mobile #on the #process

On Synchronous and Asynchronous Mobile Processes (PQ, DW), pp. 283–296.

FoSSaCS-2000-Schubert #first-order #logic #type inference

Type Inference for First-Order Logic (AS), pp. 297–313.

FoSSaCS-2000-Thiemann #adaptation #algebra #programming

An Algebraic Foundation for Adaptive Programming (PT), pp. 314–328.

FoSSaCS-2000-Treinen #automaton #logic #testing

Predicate Logic and Tree Automata with Tests (RT), pp. 329–343.

FoSSaCS-2000-Tsay #composition #linear #logic #verification

Compositional Verification in Linear-Time Temporal Logic (YKT), pp. 344–358.

FoSSaCS-2000-YangR #calculus #on the #refinement #semantics

On the Semantics of Refinement Calculi (HY, USR), pp. 359–374.

FoSSaCS-2000-Zimmer #algorithm #mobile #type system

Subtyping and Typing Algorithms for Mobile Ambients (PZ), pp. 375–390.