default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID15th FoSSaCS 2012: Tallinn, Estonia (Part of ETAPS 2012)
- Lars Birkedal:
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. Lecture Notes in Computer Science 7213, Springer 2012, ISBN 978-3-642-28728-2 - Andrea Calì, Georg Gottlob
, Giorgio Orsi, Andreas Pieris:
Querying UML Class Diagrams. 1-25 - Glynn Winskel:
Bicategories of Concurrent Games - (Invited Paper). 26-41 - Robert Atkey, Neil Ghani, Bart Jacobs, Patricia Johann:
Fibrational Induction Meets Effects. 42-57 - Jirí Adámek, Filippo Bonchi, Mathias Hülsbusch, Barbara König, Stefan Milius, Alexandra Silva:
A Coalgebraic Perspective on Minimization and Determinization. 58-73 - Danel Ahman, James Chapman, Tarmo Uustalu:
When Is a Container a Comonad? 74-88 - 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 - Helmut Seidl, Andreas Reuß:
Extending ${\cal H}_1$ -Clauses with Path Disequalities. 165-179 - Radha Jagadeesan, Gustavo Petri, James Riely:
Brookes Is Relaxed, Almost! 180-194 - Marco Bernardo, Rocco De Nicola, Michele Loreti:
Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes. 195-209 - Kirstin Peters, Uwe Nestmann:
Is It a "Good" Encoding of Mixed Choice? 210-224 - Silvia Crafa, Daniele Varacca, Nobuko Yoshida:
Event Structure Semantics of Parallel Extrusion in the Pi-Calculus. 225-239 - Daniel Gorín, Lutz Schröder:
Narcissists Are Easy, Stepmothers Are Hard. 240-254 - Alexander Kurz, Tomoyuki Suzuki, Emilio Tuosto:
On Nominal Regular Languages with Binders. 255-269 - 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 - Bernardo Toninho, Luís Caires, Frank Pfenning:
Functions as Session-Typed Processes. 346-360 - 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 - Sumit Nain, Moshe Y. Vardi:
Synthesizing Probabilistic Composers. 421-436 - 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-31 20:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
