C.-H. Luke Ong
Proceedings of the 13th International Conference on Foundations of Software Science and Computation Structures
FOSSACS, 2010.

@proceedings{FoSSaCS-2010,
	address       = "Paphos, Cyprus",
	doi           = "10.1007/978-3-642-12032-9",
	editor        = "C.-H. Luke Ong",
	isbn          = "978-3-642-12031-2",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 13th International Conference on Foundations of Software Science and Computation Structures}",
	volume        = 6014,
	year          = 2010,
}

Contents (26 items)

3 ×#algebra
3 ×#decidability
3 ×#infinity
3 ×#model checking
2 ×#analysis
2 ×#calculus
2 ×#continuation
2 ×#game studies
2 ×#logic
2 ×#ltl

FoSSaCS-2010-Stirling #decidability #higher-order

Introduction to Decidability of Higher-Order Matching (CS), p. 1.

FoSSaCS-2010-SchwinghammerYBPR #semantics

A Semantic Foundation for Hidden State (JS, HY, LB, FP, BR), pp. 2–17.

FoSSaCS-2010-EggerMS #calculus #continuation

Linearly-Used Continuations in the Enriched Effect Calculus (JE, REM, AS), pp. 18–32.

FoSSaCS-2010-MurawskiT

Block Structure vs. Scope Extrusion: Between Innocence and Omniscience (ASM, NT), pp. 33–47.

FoSSaCS-2010-Staton #algebra

Completeness for Algebraic Theories of Local State (SS), pp. 48–63.

FoSSaCS-2010-AsarinCV #game studies

Fair Adversaries and Randomization in Two-Player Games (EA, RCYF, DV), pp. 64–78.

FoSSaCS-2010-GeorgievskaA #probability #testing

Retaining the Probabilities in Probabilistic Testing Theory (SG, SA), pp. 79–93.

FoSSaCS-2010-WiesZH #analysis #bound #process

Forward Analysis of Depth-Bounded Processes (TW, DZ, TAH), pp. 94–108.

FoSSaCS-2010-PopescuG #algebra #formal method #incremental #induction #process

Incremental Pattern-Based Coinduction for Process Algebra and Its Isabelle Formalization (AP, ELG), pp. 109–127.

FoSSaCS-2010-YoshidaDBH #multi

Parameterised Multiparty Session Types (NY, PMD, AB, RH), pp. 128–145.

FoSSaCS-2010-AcciaiBZ #behaviour #logic #on the #simulation

On the Relationship between Spatial Logics and Behavioral Simulations (LA, MB, GZ), pp. 146–160.

FoSSaCS-2010-CateF #calculus #finite #proving #μ-calculus

An Easy Completeness Proof for the Modal μ-Calculus on Finite Trees (BtC, GF), pp. 161–175.

FoSSaCS-2010-DemriS #decidability #ltl #model checking

When Model-Checking Freeze LTL over Counter Machines Becomes Decidable (SD, AS), pp. 176–190.

FoSSaCS-2010-NielsonN #logic #model checking #static analysis

Model Checking Is Static Analysis of Modal Logic (FN, HRN), pp. 191–205.

FoSSaCS-2010-LaroussinieMP

Counting CTL (FL, AM, EP), pp. 206–220.

FoSSaCS-2010-ToL #algorithm #decidability #infinity #ltl #model checking

Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems (AWT, LL), pp. 221–236.

FoSSaCS-2010-ChambartS #composition #towards

Toward a Compositional Theory of Leftist Grammars and Transformations (PC, PS), pp. 237–251.

FoSSaCS-2010-HoltmannKT #game studies #infinity #lookahead

Degrees of Lookahead in Regular Infinite Games (MH, LK, WT), pp. 252–266.

FoSSaCS-2010-HeussnerLMS #analysis #automaton #communication #reachability

Reachability Analysis of Communicating Pushdown Systems (AH, JL, AM, GS), pp. 267–281.

FoSSaCS-2010-CassezMZ #complexity #data flow #security

The Complexity of Synchronous Notions of Information Flow Security (FC, RvdM, CZ), pp. 282–296.

FoSSaCS-2010-AltenkirchCU #monad

Monads Need Not Be Endofunctors (TA, JC, TU), pp. 297–311.

FoSSaCS-2010-MiliusMS #recursion #semantics

CIA Structures and the Semantics of Recursion (SM, LSM, DS), pp. 312–327.

FoSSaCS-2010-SchroderP #algebra

Coalgebraic Correspondence Theory (LS, DP), pp. 328–342.

FoSSaCS-2010-TsukadaK #infinity #recursion

Untyped Recursion Schemes and Infinite Intersection Types (TT, NK), pp. 343–357.

FoSSaCS-2010-PaganiR #λ-calculus

Solvability in Resource λ-Calculus (MP, SRDR), pp. 358–373.

FoSSaCS-2010-Saurin #call-by #continuation

A Hierarchy for Delimited Continuations in Call-by-Name (AS), pp. 374–388.