Frank Pfenning
Proceedings of the 16th International Conference on Foundations of Software Science and Computation Structures
FOSSACS, 2013.

@proceedings{FoSSaCS-2013,
	address       = "Rome, Italy",
	doi           = "10.1007/978-3-642-37075-5",
	editor        = "Frank Pfenning",
	isbn          = "978-3-642-37074-8",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 16th International Conference on Foundations of Software Science and Computation Structures}",
	volume        = 7794,
	year          = 2013,
}

Contents (28 items)

5 ×#logic
4 ×#process
3 ×#algebra
3 ×#composition
3 ×#semantics
2 ×#complexity
2 ×#game studies
2 ×#higher-order
2 ×#modelling
2 ×#monad

FoSSaCS-2013-HaymanH #graph #modelling #rule-based #semantics

Pattern Graphs and Rule-Based Models: The Semantics of Kappa (JH, TH), pp. 1–16.

FoSSaCS-2013-TzevelekosG #automaton

History-Register Automata (NT, RG), pp. 17–33.

FoSSaCS-2013-HuthKP #game studies

Fatal Attractors in Parity Games (MH, JHPK, NP), pp. 34–49.

FoSSaCS-2013-DreierELL #composition #on the #process #π-calculus

On Unique Decomposition of Processes in the Applied π-Calculus (JD, CE, PL, YL), pp. 50–64.

FoSSaCS-2013-BonnetC #bound

Bounded Context-Switching and Reentrant Locking (RB, RC), pp. 65–80.

FoSSaCS-2013-ClementeHSS #communication #process #reachability

Reachability of Communicating Timed Processes (LC, FH, AS, GS), pp. 81–96.

FoSSaCS-2013-ChurchillM #bisimulation #composition

Modular Bisimulation Theory for Computations and Values (MC, PDM), pp. 97–112.

FoSSaCS-2013-OrejasBGM #graph transformation #similarity

Checking Bisimilarity for Attributed Graph Transformation (FO, AB, UG, NM), pp. 113–128.

FoSSaCS-2013-Abou-SalehP #semantics

Comodels and Effects in Mathematical Operational Semantics (FAS, DP), pp. 129–144.

FoSSaCS-2013-KatsumataS #algebra #monad #simulation

Preorders on Monads and Coalgebraic Simulations (SyK, TS), pp. 145–160.

FoSSaCS-2013-MioS #composition #concurrent #probability #process #proving #verification

A Proof System for Compositional Verification of Probabilistic Concurrent Processes (MM, AS), pp. 161–176.

FoSSaCS-2013-Czajka #higher-order #logic #recursion

Partiality and Recursion in Higher-Order Logic (LC0), pp. 177–192.

FoSSaCS-2013-DahlqvistP #algebra #logic

Some Sahlqvist Completeness Results for Coalgebraic Logics (FD, DP), pp. 193–208.

FoSSaCS-2013-Strassburger #logic

Cut Elimination in Nested Sequents for Intuitionistic Modal Logics (LS), pp. 209–224.

FoSSaCS-2013-BauerHK #higher-order #monad #on the #parametricity

On Monadic Parametricity of Second-Order Functionals (AB, MH, AK), pp. 225–240.

FoSSaCS-2013-MurawskiT #game studies #semantics

Deconstructing General References via Game Semantics (ASM, NT), pp. 241–256.

FoSSaCS-2013-KrebbersW #control flow #logic

Separation Logic for Non-local Control Flow and Block Scope Variables (RK, FW), pp. 257–272.

FoSSaCS-2013-KarandikarS #complexity #parametricity #problem #recursion

The Parametric Ordinal-Recursive Complexity of Post Embedding Problems (PK, SS), pp. 273–288.

FoSSaCS-2013-CzerwinskiDLM #regular expression

Deciding Definability by Deterministic Regular Expressions (WC, CD, KL, WM), pp. 289–304.

FoSSaCS-2013-HainryMP #analysis #complexity #process #type system

Type-Based Complexity Analysis for Fork Processes (EH, JYM, RP), pp. 305–320.

FoSSaCS-2013-HofmannRS #morphism #pointer #source code

Pure Pointer Programs and Tree Isomorphism (MH, RR, US), pp. 321–336.

FoSSaCS-2013-GianantonioE

A Language for Differentiable Functions (PDG, AE), pp. 337–352.

FoSSaCS-2013-UmmelsB #markov #modelling

Computing Quantiles in Markov Reward Models (MU, CB), pp. 353–368.

FoSSaCS-2013-AvniK

Parameterized Weighted Containment (GA, OK), pp. 369–384.

FoSSaCS-2013-BolligGM #specification #word

Weighted Specifications over Nested Words (BB, PG, BM), pp. 385–400.

FoSSaCS-2013-Staton #algebra #logic

An Algebraic Presentation of Predicate Logic — (SS), pp. 401–417.

FoSSaCS-2013-Winskel

Strategies as Profunctors (GW), pp. 418–433.

FoSSaCS-2013-Clouston #abstraction #set

Generalised Name Abstraction for Nominal Sets (RC), pp. 434–449.