Mogens Nielsen, Uffe Engberg
Proceedings of the Fifth International Conference on Foundations of Software Science and Computation Structures
FoSSaCS, 2002.

@proceedings{FoSSaCS-2002,
	address       = "ETAPS 2002 Grenoble, France",
	editor        = "Mogens Nielsen and Uffe Engberg",
	isbn          = "3-540-43366-X",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Fifth International Conference on Foundations of Software Science and Computation Structures}",
	volume        = 2303,
	year          = 2002,
}

Contents (29 items)

4 ×#on the
4 ×#semantics
3 ×#calculus
3 ×#logic
3 ×#model checking
3 ×#proving
2 ×#algebra
2 ×#automaton
2 ×#bound
2 ×#concept

FoSSaCS-2002-Courcelle #higher-order #monad #semantics

Semantical Evaluations as Monadic Second-Order Compatible Structure Transformations (BC), pp. 1–4.

FoSSaCS-2002-Abraham-MummBRS #concept #java #multi #thread #verification

Verification for Java’s Reentrant Multithreading Concept (EÁM, FSdB, WPdR, MS), pp. 5–20.

FoSSaCS-2002-BidoitH #concept #integration #on the #reachability

On the Integration of Observability and Reachability Concepts (MB, RH), pp. 21–36.

FoSSaCS-2002-BoerGM #concurrent #constraints #correctness #proving #source code

Proving Correctness of Timed Concurrent Constraint Programs (FSdB, MG, MCM), pp. 37–51.

FoSSaCS-2002-BolligLN

Generalised Regular MSC Languages (BB, ML, TN), pp. 52–66.

FoSSaCS-2002-BorealeG #calculus #composition #on the #reasoning

On Compositional Reasoning in the Sπ-calculus (MB, DG), pp. 67–81.

FoSSaCS-2002-Cirstea #algebra #logic #on the #reachability #specification

On Specification Logics for Algebra-Coalgebra Structures: Reconciling Reachability and Observability (CC), pp. 82–97.

FoSSaCS-2002-DanvyN #continuation #first-order

A First-Order One-Pass CPS Transformation (OD, LRN), pp. 98–113.

FoSSaCS-2002-Doberkat #probability

The Demonic Product of Probabilistic Relations (EED), pp. 114–128.

FoSSaCS-2002-FerrariMP #algebra #calculus

Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation (GLF, UM, MP), pp. 129–158.

FoSSaCS-2002-Fuhrmann

Varieties of Effects (CF), pp. 144–158.

FoSSaCS-2002-GodardM #graph #product line

A Characterization of Families of Graphs in Which Election Is Possible (EG, YM), pp. 159–172.

FoSSaCS-2002-JancarKMS #automaton #bound #proving

Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds (PJ, AK, FM, ZS), pp. 172–186.

FoSSaCS-2002-JhaPZ #performance

Efficient Type Matching (SJ, JP, TZ), pp. 187–204.

FoSSaCS-2002-KnapikNU #automaton #higher-order

Higher-Order Pushdown Trees Are Easy (TK, DN, PU), pp. 205–222.

FoSSaCS-2002-KochMP #data access #detection #policy #specification

Conflict Detection and Resolution in Access Control Policy Specifications (MK, LVM, FPP), pp. 223–237.

FoSSaCS-2002-Kurz #logic #semantics

Logics Admitting Final Semantics (AK), pp. 238–249.

FoSSaCS-2002-LangeS #fixpoint #logic #model checking

Model Checking Fixed Point Logic with Chop (ML, CS), pp. 250–263.

FoSSaCS-2002-LaroussinieMS #model checking #on the

On Model Checking Durational Kripke Structures (FL, NM, PS), pp. 264–279.

FoSSaCS-2002-Loding #infinity #model checking

Model-Checking Infinite Systems Generated by Ground Tree Rewriting (CL), pp. 280–294.

FoSSaCS-2002-LohreyM #bound #communication

Bounded MSC Communication (ML, AM), pp. 295–309.

FoSSaCS-2002-Martin

The Informatic Derivative at a Compact Element (KM), pp. 310–325.

FoSSaCS-2002-Mossakowski #development #graph

Heterogeneous Development Graphs and Heterogeneous Borrowing (TM), pp. 326–341.

FoSSaCS-2002-PlotkinP #monad

Notions of Computation Determine Monads (GDP, JP), pp. 342–356.

FoSSaCS-2002-Santocanale #calculus #category theory #proving #semantics

A Calculus of Circular Proofs and Its Categorical Semantics (LS), pp. 357–371.

FoSSaCS-2002-SchoppS #process #using #verification

Verifying Temporal Properties Using Explicit Approximants: Completeness for Context-free Processes (US, AKS), pp. 372–386.

FoSSaCS-2002-Srba #commutative

Note on the Tableau Technique for Commutative Transition Systems (JS), pp. 387–401.

FoSSaCS-2002-YangO #reasoning #semantics

A Semantic Basis for Local Reasoning (HY, PWO), pp. 402–416.

FoSSaCS-2002-YoshidaHB #bisimulation

Linearity and Bisimulation (NY, KH, MB), pp. 417–434.