Proceedings of the 12th 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

Luca de Alfaro
Proceedings of the 12th International Conference on Foundations of Software Science and Computation Structures
FOSSACS, 2009.

TCS
DBLP
Scholar
DOI
Full names Links ISxN
@proceedings{FoSSaCS-2009,
	address       = "York, England, United Kingdom",
	doi           = "10.1007/978-3-642-00596-1",
	editor        = "Luca de Alfaro",
	isbn          = "978-3-642-00595-4",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 12th International Conference on Foundations of Software Science and Computation Structures}",
	volume        = 5504,
	year          = 2009,
}

Contents (32 items)

FoSSaCS-2009-Thomas #problem #synthesis
Facets of Synthesis: Revisiting Church’s Problem (WT), pp. 1–14.
FoSSaCS-2009-Alur #reasoning
Temporal Reasoning about Program Executions (RA), p. 15.
FoSSaCS-2009-Clairambault #fixpoint #game studies #semantics
Least and Greatest Fixpoints in Game Semantics (PC), pp. 16–31.
FoSSaCS-2009-MurawskiT #abstraction #ml
Full Abstraction for Reduced ML (ASM, NT), pp. 32–47.
FoSSaCS-2009-Gutierrez #bisimulation #concurrent #game studies #logic
Logics and Bisimulation Games for Concurrency, Causality and Conflict (JG), pp. 48–62.
FoSSaCS-2009-AntonopoulosD #graph #logic
Separating Graph Logic from MSO (TA, AD), pp. 63–77.
FoSSaCS-2009-Leivant #logic #on the
On the Completeness of Dynamic Logic (DL), pp. 78–91.
FoSSaCS-2009-Stirling #automaton #dependence
Dependency Tree Automata (CS), pp. 92–106.
FoSSaCS-2009-BroadbentO #higher-order #model checking #on the #recursion
On Global Model Checking Trees Generated by Higher-Order Recursion Schemes (CHB, CHLO), pp. 107–121.
FoSSaCS-2009-BonsangueRS #algebra #polynomial #theorem
A Kleene Theorem for Polynomial Coalgebras (MMB, JJMMR, AS), pp. 122–136.
FoSSaCS-2009-MyersPS #algebra #hybrid #logic
Coalgebraic Hybrid Logic (RSRM, DP, LS), pp. 137–151.
FoSSaCS-2009-AdamekMV #monad
A Description of Iterative Reflections of Monads (JA, SM, JV), pp. 152–166.
FoSSaCS-2009-Schewe #automaton #bound #nondeterminism
Tighter Bounds for the Determinisation of Büchi Automata (SS), pp. 167–181.
FoSSaCS-2009-KupfermanP #automaton #bound
Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata (OK, NP), pp. 182–196.
FoSSaCS-2009-BerardH #automaton
Interrupt Timed Automata (BB, SH), pp. 197–211.
FoSSaCS-2009-LohreyMS #parametricity #reduction
Parameter Reduction in Grammar-Compressed Trees (ML, SM, MSS), pp. 212–226.
FoSSaCS-2009-FossatiV #calculus
The Calculus of Handshake Configurations (LF, DV), pp. 227–241.
FoSSaCS-2009-ArandaVV #on the #power of #replication #strict
On the Expressive Power of Restriction and Priorities in CCS with Replication (JA, FDV, CV), pp. 242–256.
FoSSaCS-2009-LengletSS #bisimulation #calculus
Normal Bisimulations in Calculi with Passivation (SL, AS, JBS), pp. 257–271.
FoSSaCS-2009-BonchiGM #mobile #semantics
Reactive Systems, Barbed Semantics, and the Mobile Ambients (FB, FG, GVM), pp. 272–287.
FoSSaCS-2009-Smith #data flow #on the
On the Foundations of Quantitative Information Flow (GS), pp. 288–302.
FoSSaCS-2009-Guttman #authentication #composition #encryption #protocol #testing
Cryptographic Protocol Composition via the Authentication Tests (JDG), pp. 303–317.
FoSSaCS-2009-ChatzikokolakisNP #bisimulation
Bisimulation for Demonic Schedulers (KC, GN, DP), pp. 318–332.
FoSSaCS-2009-AlurDMW #on the
On ω-Languages Defined by Mean-Payoff Conditions (RA, AD, OM, GW), pp. 333–347.
FoSSaCS-2009-AbdullaM #low cost #petri net #reachability
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets (PAA, RM), pp. 348–363.
FoSSaCS-2009-NeuhausserSK #markov #nondeterminism #process
Delayed Nondeterminism in Continuous-Time Markov Decision Processes (MRN, MS, JPK), pp. 364–379.
FoSSaCS-2009-AbbesB #algebra #concurrent #probability
Concurrency, σ-Algebras, and Probabilistic Fairness (SA, AB), pp. 380–394.
FoSSaCS-2009-LustigV #component #library #synthesis
Synthesis from Component Libraries (YL, MYV), pp. 395–409.
FoSSaCS-2009-BolligGH #concurrent #recursion #source code
Realizability of Concurrent Recursive Programs (BB, MLG, PH), pp. 410–424.
FoSSaCS-2009-BansalBL #order
Beyond Shapes: Lists with Ordered Data (KB, RB, ÉL), pp. 425–439.
FoSSaCS-2009-KuhnrichSSK #analysis #data flow #infinity #interprocedural
Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains (MK, SS, JS, SK), pp. 440–455.
FoSSaCS-2009-BirkedalST #morphism #parametricity #polymorphism #recursion #semantics
Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types (LB, KS, JT), pp. 456–470.

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.