Vladimiro Sassone
Proceedings of the Eighth International Conference on Foundations of Software Science and Computation Structures
FoSSaCS, 2005.

@proceedings{FoSSaCS-2005,
	address       = "Edinburgh, Scotland, United Kingdom",
	doi           = "10.1007/b106850",
	editor        = "Vladimiro Sassone",
	isbn          = "3-540-25388-2",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Eighth International Conference on Foundations of Software Science and Computation Structures}",
	volume        = 3441,
	year          = 2005,
}

Contents (32 items)

5 ×#probability
4 ×#automaton
4 ×#logic
3 ×#calculus
3 ×#decidability
2 ×#algebra
2 ×#composition
2 ×#congruence
2 ×#model checking
2 ×#modelling

FoSSaCS-2005-FerrariMT #calculus #model checking

Model Checking for Nominal Calculi (GLF, UM, ET), pp. 1–24.

FoSSaCS-2005-Fiore #combinator #modelling

Mathematical Models of Computational and Combinatorial Structures (MPF), pp. 25–46.

FoSSaCS-2005-MousaviR #congruence

Congruence for Structural Congruences (MRM, MAR), pp. 47–62.

FoSSaCS-2005-LanotteT #congruence #generative #probability #process

Probabilistic Congruence for Semistochastic Generative Processes (RL, ST), pp. 63–78.

FoSSaCS-2005-LuttgenV #approach #bisimulation

Bisimulation on Speed: A Unified Approach (GL, WV), pp. 79–94.

FoSSaCS-2005-AbbesB #branch #probability

Branching Cells as Local States for Event Structures and Nets: Probabilistic Applications (SA, AB), pp. 95–109.

FoSSaCS-2005-DengP #axiom #behaviour #finite #probability

Axiomatizations for Probabilistic Finite-State Behaviors (YD, CP), pp. 110–124.

FoSSaCS-2005-CattaniSKN #nondeterminism #probability

Stochastic Transition Systems for Continuous State Spaces and Non-determinism (SC, RS, MZK, GN), pp. 125–139.

FoSSaCS-2005-LaroussinieS #model checking #probability

Model Checking Durational Probabilistic Systems (FL, JS), pp. 140–154.

FoSSaCS-2005-Stark #algebra #modelling #π-calculus

Free-Algebra Models for the π-Calculus (IS), pp. 155–169.

FoSSaCS-2005-MiculanY

A Unifying Model of Variables and Names (MM, KY), pp. 170–186.

FoSSaCS-2005-Fahrenberg #automaton

A Category of Higher-Dimensional Automata (UF), pp. 187–201.

FoSSaCS-2005-MurawskiW #algol #decidability #higher-order

Third-Order Idealized Algol with Iteration Is Decidable (ASM, IW), pp. 202–218.

FoSSaCS-2005-BouyerCD #automaton #fault #using

Fault Diagnosis Using Timed Automata (PB, FC, DD), pp. 219–233.

FoSSaCS-2005-LarsenR #automaton #multi #reachability

Optimal Conditional Reachability for Multi-priced Timed Automata (KGL, JIR), pp. 234–249.

FoSSaCS-2005-LasotaW #automaton

Alternating Timed Automata (SL, IW), pp. 250–265.

FoSSaCS-2005-JeffreyR #abstraction #polymorphism #π-calculus

Full Abstraction for Polymorphic π-Calculus (AJ, JR), pp. 266–281.

FoSSaCS-2005-LaneveZ #transaction #web

Foundations of Web Transactions (CL, GZ), pp. 282–298.

FoSSaCS-2005-FocardiRS #calculus #process #security

Bridging Language-Based and Process Calculi Security (RF, SR, AS), pp. 299–315.

FoSSaCS-2005-BartolettDF #data access #policy

History-Based Access Control with Local Policies (MB, PD, GLF), pp. 316–332.

FoSSaCS-2005-Froschle #composition

Composition and Decomposition in True-Concurrency (SBF), pp. 333–347.

FoSSaCS-2005-SchaeferV #component #composition #refinement

Component Refinement and CSC Solving for STG Decomposition (MS, WV), pp. 348–363.

FoSSaCS-2005-BontempsS #complexity #sequence chart

The Complexity of Live Sequence Charts (YB, PYS), pp. 364–378.

FoSSaCS-2005-Cheney #logic #proving

A Simpler Proof Theory for Nominal Logic (JC), pp. 379–394.

FoSSaCS-2005-CalcagnoGH #first-order #logic

From Separation Logic to First-Order Logic (CC, PG, MH), pp. 395–409.

FoSSaCS-2005-Goguen #algorithm

Justifying Algorithms for βη-Conversion (HG), pp. 410–424.

FoSSaCS-2005-BozgaI #decidability #on the

On Decidability Within the Arithmetic of Addition and Divisibility (MB, RI), pp. 425–439.

FoSSaCS-2005-Schroder #algebra #logic

Expressivity of Coalgebraic Modal Logic: The Limits and Beyond (LS), pp. 440–454.

FoSSaCS-2005-BonsangueK #logic

Duality for Logics of Transition Systems (MMB, AK), pp. 455–469.

FoSSaCS-2005-Kaiser #confluence #decidability #term rewriting

Confluence of Right Ground Term Rewriting Systems Is Decidable (LK), pp. 470–489.

FoSSaCS-2005-AehligMO #safety #strict #string

Safety Is not a Restriction at Level 2 for String Languages (KA, JGdM, CHLO), pp. 490–504.

FoSSaCS-2005-EdalatLP #calculus #difference #multi

A Computational Model for Multi-variable Differential Calculus (AE, AL, DP), pp. 505–519.