Furio Honsell, Marino Miculan
Proceedings of the Fourth International Conference on Foundations of Software Science and Computation Structures
FoSSaCS, 2001.

@proceedings{FoSSaCS-2001,
	address       = "ETAPS 2001 Genova, Italy",
	editor        = "Furio Honsell and Marino Miculan",
	isbn          = "3-540-41864-4",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Fourth International Conference on Foundations of Software Science and Computation Structures}",
	volume        = 2030,
	year          = 2001,
}

Contents (27 items)

5 ×#on the
3 ×#axiom
2 ×#algebra
2 ×#automaton
2 ×#call-by
2 ×#complexity
2 ×#graph
2 ×#model checking
2 ×#process
2 ×#recursion

FoSSaCS-2001-PlotkinP #algebra

Adequacy for Algebraic Effects (GDP, JP), pp. 1–24.

FoSSaCS-2001-AbadiB #communication #symmetry

Secrecy Types for Asymmetric Communication (MA, BB), pp. 25–41.

FoSSaCS-2001-AcetoEI #axiom

Axiomatizing Tropical Semirings (LA, ZÉ, AI), pp. 42–56.

FoSSaCS-2001-BartheP #dependent type #morphism #proving #reuse #type system

Type Isomorphisms and Proof Reuse in Dependent Type Theory (GB, OP), pp. 57–71.

FoSSaCS-2001-BidoitHK #on the #reachability

On the Duality between Observability and Reachability (MB, RH, AK), pp. 72–87.

FoSSaCS-2001-Bojanczyk #automaton #finite #graph #problem

The Finite Graph Problem for Two-Way Alternating Automata (MB), pp. 88–103.

FoSSaCS-2001-BuscemiS #calculus #petri net

High-Level Petri Nets as Type Theories in the Join Calculus (MGB, VS), pp. 104–120.

FoSSaCS-2001-BusiGZ #coordination

Temporary Data in Shared Dataspace Coordination Languages (NB, RG, GZ), pp. 121–136.

FoSSaCS-2001-CalcagnoO #logic #on the

On Garbage and Program Logic (CC, PWO), pp. 137–151.

FoSSaCS-2001-CharatonikDGMT #complexity #mobile #model checking

The Complexity of Model Checking Mobile Ambients (WC, SDZ, ADG, SM, JMT), pp. 152–167.

FoSSaCS-2001-CirsteaKL

The Rho Cube (HC, CK, LL), pp. 168–183.

FoSSaCS-2001-Coppo #equation #recursion #type inference

Type Inference with Recursive Type Equations (MC), pp. 184–198.

FoSSaCS-2001-DurandM #call-by #composition #on the

On the Modularity of Deciding Call-by-Need (ID, AM), pp. 199–213.

FoSSaCS-2001-GourantonRS

Synchronized Tree Languages Revisited and New Applications (VG, PR, HS), pp. 214–229.

FoSSaCS-2001-HabelP #graph transformation #programming language

Computational Completeness of Programming Languages Based on Graph Transformation (AH, DP), pp. 230–245.

FoSSaCS-2001-HasegawaK #axiom #call-by #recursion

Axioms for Recursion in Call-by-Value (MH, YK), pp. 246–260.

FoSSaCS-2001-JensenS #abstract interpretation #analysis #object-oriented #source code

Class Analysis of Object-Oriented Programs through Abstract Interpretation (TPJ, FS), pp. 261–275.

FoSSaCS-2001-KingKV #automaton #complexity #on the #word

On the Complexity of Parity Word Automata (VK, OK, MYV), pp. 276–286.

FoSSaCS-2001-KochMP #approach #data access #graph #policy #specification

Foundations for a Graph-Based Approach to the Specification of Access Control Policies (MK, LVM, FPP), pp. 287–302.

FoSSaCS-2001-KrsticLP #algebra #category theory #process

Categories of Processes Enriched in Final Coalgebras (SK, JL, DP), pp. 303–317.

FoSSaCS-2001-LaroussinieMS #model checking

Model Checking CTL+ and FCTL is Hard (FL, NM, PS), pp. 318–331.

FoSSaCS-2001-Morin #on the #sequence chart #traceability

On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory (RM), pp. 332–346.

FoSSaCS-2001-Nipkow #bytecode #verification

Verified Bytecode Verifiers (TN), pp. 347–363.

FoSSaCS-2001-RocklHB #formal method #higher-order #induction #syntax #π-calculus

Higher-Order Abstract Syntax with Induction in Isabelle/HOL: Formalizing the π-Calculus and Mechanizing the Theory of Contexts (CR, DH, SB), pp. 364–378.

FoSSaCS-2001-Stirling #decidability #parallel #process #set #similarity

Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes (CS), pp. 379–393.

FoSSaCS-2001-Tini #axiom #semantics

An Axiomatic Semantics for the Synchronous Language Gentzen (ST), pp. 394–409.

FoSSaCS-2001-AmbroiseABR #embedded #verification

MARRELLA and the Verification of an Embedded System (DA, PA, KB, BR), pp. 409–412.