Lars Birkedal (Ed.): Foundations of Software Science and Computational Structures - 15th International Conference, FOSSACS 2012, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estonia, March 24 - April 1, 2012. Proceedings. Springer 2012 Lecture Notes in Computer Science ISBN 978-3-642-28728-2- Glynn Winskel: Bicategories of Concurrent Games - (Invited Paper). 26-41
- Jirí Adámek, Filippo Bonchi, Mathias Hülsbusch, Barbara König, Stefan Milius, Alexandra Silva: A Coalgebraic Perspective on Minimization and Determinization. 58-73
- Jirí Adámek, Stefan Milius, Lawrence S. Moss, Lurdes Sousa: Well-Pointed Coalgebras (Extended Abstract). 89-103
- Ana Bove, Peter Dybjer, Andrés Sicard-Ramírez: Combining Interactive and Automatic Reasoning in First Order Theories of Functional Programs. 104-118
- Dariusz Biernacki, Sergueï Lenglet: Applicative Bisimulations for Delimited-Control Operators. 119-134
- Sebastian Preugschat, Thomas Wilke: Effective Characterizations of Simple Fragments of Temporal Logic Using Prophetic Automata. 135-149
- Stefan Breuers, Christof Löding, Jörg Olschewski: Improved Ramsey-Based Büchi Complementation. 150-164
- Marco Bernardo, Rocco De Nicola, Michele Loreti: Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes. 195-209
- Silvia Crafa, Daniele Varacca, Nobuko Yoshida: Event Structure Semantics of Parallel Extrusion in the Pi-Calculus. 225-239
- Krishnendu Chatterjee: Robustness of Structurally Equivalent Concurrent Parity Games. 270-285
- Thomas Brihaye, Véronique Bruyère, Julie De Pril, Hugo Gimbert: Subgame Perfection for Equilibria in Quantitative Reachability Games. 286-300
- Patricia Bouyer, Romain Brenguier, Nicolas Markey, Michael Ummels: Concurrent Games with Ordered Objectives. 301-315
- Damiano Mazza, Neil J. Ross: Full Abstraction for Set-Based Models of the Symmetric Interaction Combinators. 316-330
- Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke-Uffmann: On Distributability of Petri Nets - (Extended Abstract). 331-345
- Mathias Hülsbusch, Barbara König: Deriving Bisimulation Congruences for Conditional Reactive Systems. 361-375
- Alexander Kartzow: First-Order Model Checking on Nested Pushdown Trees is Complete for Doubly Exponential Alternating Time. 376-390
- Benedikt Bollig, Aiswarya Cyriac, Paul Gastin, K. Narayan Kumar: Model Checking Languages of Data Words. 391-405
- Stefan Göller, Christoph Haase, Joël Ouaknine, James Worrell: Branching-Time Model Checking of Parametric One-Counter Automata. 406-420
- Di Chen, Franck van Breugel, James Worrell: On the Complexity of Computing Probabilistic Bisimilarity. 437-451
- Pedro R. D'Argenio, Matias David Lee: Probabilistic Transition System Specification: Congruence and Full Abstraction of Bisimulation. 452-466
- Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell: On the Complexity of the Equivalence Problem for Probabilistic Automata. 467-481
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-17T203624 by the dblp team