Proceedings of the 11th International Conference on Foundations of Software Science and Computation Structures
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Roberto M. Amadio
Proceedings of the 11th International Conference on Foundations of Software Science and Computation Structures
FoSSaCS, 2008.

TCS
DBLP
Scholar
DOI
Full names Links ISxN
@proceedings{FoSSaCS-2008,
	address       = "Budapest, Hungary",
	doi           = "10.1007/978-3-540-78499-9",
	editor        = "Roberto M. Amadio",
	isbn          = "978-3-540-78497-5",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 11th International Conference on Foundations of Software Science and Computation Structures}",
	volume        = 4962,
	year          = 2008,
}

Contents (34 items)

FoSSaCS-2008-Walukiewicz
Finding Your Way in a Forest: On Different Types of Trees and Their Properties (IW), pp. 1–4.
FoSSaCS-2008-GimbertH #game studies #probability #random
Simple Stochastic Games with Few Random Vertices Are Easy to Solve (HG, FH), pp. 5–19.
FoSSaCS-2008-Ummels #complexity #game studies #infinity #multi #nash
The Complexity of Nash Equilibria in Infinite Multiplayer Games (MU), pp. 20–34.
FoSSaCS-2008-AbdullaHAMS #game studies #probability
Stochastic Games with Lossy Channels (PAA, NBH, LdA, RM, SS), pp. 35–49.
FoSSaCS-2008-Goubault-Larrecq #game studies #infinity #probability #simulation
Simulation Hemi-metrics between Infinite-State Stochastic Games (JGL), pp. 50–65.
FoSSaCS-2008-PattinsonS #algebra #finite #logic #modelling #rank #semantics
Beyond Rank 1: Algebraic Semantics and Finite Models for Coalgebraic Logics (DP, LS), pp. 66–80.
FoSSaCS-2008-SelingerV #call-by #λ-calculus
A Linear-non-Linear Model for a Computational Call-by-Value λ Calculus (PS, BV), pp. 81–96.
FoSSaCS-2008-ChambartS #problem
The ω-Regular Post Embedding Problem (PC, PS), pp. 97–111.
FoSSaCS-2008-AntonikHLNW #complexity #problem #specification
Complexity of Decision Problems for Mixed and Modal Specifications (AA, MH, KGL, UN, AW), pp. 112–126.
FoSSaCS-2008-GodoyMT #decidability #morphism
Classes of Tree Homomorphisms with Decidable Preservation of Regularity (GG, SM, ST), pp. 127–141.
FoSSaCS-2008-DrosteQ #automaton #theorem
A Kleene-Schützenberger Theorem for Weighted Timed Automata (MD, KQ), pp. 142–156.
FoSSaCS-2008-BouyerMR #analysis #automaton #robust
Robust Analysis of Timed Automata via Channel Machines (PB, NM, PAR), pp. 157–171.
FoSSaCS-2008-Bojanczyk #ltl
The Common Fragment of ACTL and LTL (MB), pp. 172–185.
FoSSaCS-2008-Bozzelli #complexity #linear
The Complexity of CTL* + Linear Past (LB), pp. 186–200.
FoSSaCS-2008-RazaG #reasoning
Footprints in Local Reasoning (MR, PG), pp. 201–215.
FoSSaCS-2008-GargA #data access #logic
A Modal Deconstruction of Access Control Logics (DG, MA), pp. 216–230.
FoSSaCS-2008-BonsangueRS #algebra #automaton #logic #synthesis
Coalgebraic Logic and Synthesis of Mealy Machines (MMB, JJMMR, AS), pp. 231–245.
FoSSaCS-2008-HasuoJS #algebra #concurrent
The Microcosm Principle and Concurrency in Coalgebra (IH, BJ, AS), pp. 246–260.
FoSSaCS-2008-Parys #commutative #equation #finite
Systems of Equations Satisfied in All Commutative Finite Semigroups (PP), pp. 261–272.
FoSSaCS-2008-GruberJ #bound #communication #complexity #regular expression #using
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity (HG, JJ), pp. 273–286.
FoSSaCS-2008-BaierBG #automaton #on the #probability #problem
On Decision Problems for Probabilistic Büchi Automata (CB, NB, MG), pp. 287–301.
FoSSaCS-2008-ChatterjeeSH #markov #model checking
Model-Checking ω-Regular Properties of Interval Markov Chains (KC, KS, TAH), pp. 302–317.
FoSSaCS-2008-Goubault-Larrecq08a
Prevision Domains and Convex Powercones (JGL), pp. 318–333.
FoSSaCS-2008-GianantonioHL #higher-order #λ-calculus
RPO, Second-Order Contexts, and λ-Calculus (PDG, FH, ML), pp. 334–349.
FoSSaCS-2008-Mishra-LingerS #morphism #polymorphism #type system
Erasure and Polymorphism in Pure Type Systems (NML, TS), pp. 350–364.
FoSSaCS-2008-BarrasB #calculus #dependent type #programming language
The Implicit Calculus of Constructions as a Programming Language with Dependent Types (BB, BB), pp. 365–379.
FoSSaCS-2008-KikuchiL #normalisation
Strong Normalisation of Cut-Elimination That Simulates β-Reduction (KK, SL), pp. 380–394.
FoSSaCS-2008-BonchiM #revisited #semantics
Symbolic Semantics Revisited (FB, UM), pp. 395–412.
FoSSaCS-2008-RangelKE #bisimulation
Deriving Bisimulation Congruences in the Presence of Negative Application Conditions (GR, BK, HE), pp. 413–427.
FoSSaCS-2008-KlinS #calculus #probability #process #semantics
Structural Operational Semantics for Stochastic Process Calculi (BK, VS), pp. 428–442.
FoSSaCS-2008-BraunCP #composition #information management
Compositional Methods for Information-Hiding (CB, KC, CP), pp. 443–457.
FoSSaCS-2008-DarondeauGH #sequence chart
Products of Message Sequence Charts (PD, BG, LH), pp. 458–473.
FoSSaCS-2008-HabermehlIV #array #decidability #integer #question #what
What Else Is Decidable about Integer Arrays? (PH, RI, TV), pp. 474–489.
FoSSaCS-2008-DemriLS #automaton #ltl #model checking
Model Checking Freeze LTL over One-Counter Automata (SD, RL, AS), pp. 490–504.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.