Lars Birkedal
Proceedings of the 15th International Conference on Foundations of Software Science and Computation Structures
FOSSACS, 2012.

@proceedings{FoSSaCS-2012,
	address       = "Tallinn, Estonia",
	doi           = "10.1007/978-3-642-28729-9",
	editor        = "Lars Birkedal",
	isbn          = "978-3-642-28728-2",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 15th International Conference on Foundations of Software Science and Computation Structures}",
	volume        = 7213,
	year          = 2012,
}

Contents (31 items)

5 ×#automaton
5 ×#probability
4 ×#game studies
4 ×#on the
3 ×#bisimulation
3 ×#concurrent
3 ×#model checking
2 ×#abstraction
2 ×#algebra
2 ×#complexity

FoSSaCS-2012-CaliGOP #diagrams #query #uml

Querying UML Class Diagrams (AC, GG, GO, AP), pp. 1–25.

FoSSaCS-2012-Winskel #concurrent #game studies

Bicategories of Concurrent Games — (GW), pp. 26–41.

FoSSaCS-2012-AtkeyGJJ #induction

Fibrational Induction Meets Effects (RA, NG, BJ, PJ), pp. 42–57.

FoSSaCS-2012-AdamekBHKMS #algebra

A Coalgebraic Perspective on Minimization and Determinization (JA, FB, MH, BK, SM, AS), pp. 58–73.

FoSSaCS-2012-AhmanCU #monad #question

When Is a Container a Comonad? (DA, JC, TU), pp. 74–88.

FoSSaCS-2012-AdamekMMS #algebra

Well-Pointed Coalgebras (JA, SM, LSM, LS), pp. 89–103.

FoSSaCS-2012-BoveDS #automation #first-order #functional #interactive #reasoning #source code

Combining Interactive and Automatic Reasoning in First Order Theories of Functional Programs (AB, PD, ASR), pp. 104–118.

FoSSaCS-2012-BiernackiL #bisimulation

Applicative Bisimulations for Delimited-Control Operators (DB, SL), pp. 119–134.

FoSSaCS-2012-PreugschatW #automaton #effectiveness #logic #using

Effective Characterizations of Simple Fragments of Temporal Logic Using Prophetic Automata (SP, TW), pp. 135–149.

FoSSaCS-2012-BreuersLO #automaton

Improved Ramsey-Based Büchi Complementation (SB, CL, JO), pp. 150–164.

FoSSaCS-2012-SeidlR

Extending H₁-Clauses with Path Disequalities (HS, AR), pp. 165–179.

FoSSaCS-2012-JagadeesanPR #exclamation

Brookes Is Relaxed, Almost! (RJ, GP, JR), pp. 180–194.

FoSSaCS-2012-BernardoNL #nondeterminism #probability #process #testing

Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes (MB, RDN, ML), pp. 195–209.

FoSSaCS-2012-PetersN #encoding #question

Is It a “Good” Encoding of Mixed Choice? (KP, UN), pp. 210–224.

FoSSaCS-2012-CrafaVY #parallel #semantics #π-calculus

Event Structure Semantics of Parallel Extrusion in the π-Calculus (SC, DV, NY), pp. 225–239.

FoSSaCS-2012-GorinS

Narcissists Are Easy, Stepmothers Are Hard (DG, LS), pp. 240–254.

FoSSaCS-2012-KurzST #on the #regular expression

On Nominal Regular Languages with Binders (AK, TS, ET), pp. 255–269.

FoSSaCS-2012-Chatterjee #concurrent #game studies #robust

Robustness of Structurally Equivalent Concurrent Parity Games (KC), pp. 270–285.

FoSSaCS-2012-BrihayeBPG #game studies #reachability

Subgame Perfection for Equilibria in Quantitative Reachability Games (TB, VB, JDP, HG), pp. 286–300.

FoSSaCS-2012-BouyerBMU #concurrent #game studies #order

Concurrent Games with Ordered Objectives (PB, RB, NM, MU), pp. 301–315.

FoSSaCS-2012-MazzaR #abstraction #combinator #interactive #modelling #symmetry

Full Abstraction for Set-Based Models of the Symmetric Interaction Combinators (DM, NJR), pp. 316–330.

FoSSaCS-2012-GlabbeekGS #on the #petri net

On Distributability of Petri Nets — (RJvG, UG, JWSU), pp. 331–345.

FoSSaCS-2012-ToninhoCP #process

Functions as Session-Typed Processes (BT, LC, FP), pp. 346–360.

FoSSaCS-2012-HulsbuschK #bisimulation

Deriving Bisimulation Congruences for Conditional Reactive Systems (MH, BK), pp. 361–375.

FoSSaCS-2012-Kartzow #automaton #exponential #first-order #model checking

First-Order Model Checking on Nested Pushdown Trees is Complete for Doubly Exponential Alternating Time (AK), pp. 376–390.

FoSSaCS-2012-BolligCGK #model checking #word

Model Checking Languages of Data Words (BB, AC, PG, KNK), pp. 391–405.

FoSSaCS-2012-GollerHOW #automaton #model checking #parametricity

Branching-Time Model Checking of Parametric One-Counter Automata (SG, CH, JO, JW), pp. 406–420.

FoSSaCS-2012-NainV #probability

Synthesizing Probabilistic Composers (SN, MYV), pp. 421–436.

FoSSaCS-2012-ChenBW #complexity #on the #probability #similarity

On the Complexity of Computing Probabilistic Bisimilarity (DC, FvB, JW), pp. 437–451.

FoSSaCS-2012-DArgenioL #abstraction #bisimulation #congruence #probability #specification

Probabilistic Transition System Specification: Congruence and Full Abstraction of Bisimulation (PRD, MDL), pp. 452–466.

FoSSaCS-2012-KieferMOWW #automaton #complexity #equivalence #on the #probability #problem

On the Complexity of the Equivalence Problem for Probabilistic Automata (SK, ASM, JO, BW, JW), pp. 467–481.