12. FoSSaCS 2009: York, UK (Part of ETAPS 2009)

Luca de Alfaro (Ed.): Foundations of Software Science and Computational Structures, 12th International Conference, FOSSACS 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings. Lecture Notes in Computer Science 5504 Springer 2009, ISBN 978-3-642-00595-4 BibTeX

Invited Talks

Wolfgang Thomas:
Facets of Synthesis: Revisiting Church's Problem. 1-14
Electronic Edition (link) BibTeX
Rajeev Alur:
Temporal Reasoning about Program Executions. 15
Electronic Edition (link) BibTeX

Semantics

Pierre Clairambault:
Least and Greatest Fixpoints in Game Semantics. 16-31
Electronic Edition (link) BibTeX
Andrzej S. Murawski, Nikos Tzevelekos:
Full Abstraction for Reduced ML. 32-47
Electronic Edition (link) BibTeX
Julian Gutiérrez:
Logics and Bisimulation Games for Concurrency, Causality and Conflict. 48-62
Electronic Edition (link) BibTeX

Logics and Automata

Timos Antonopoulos, Anuj Dawar:
Separating Graph Logic from MSO. 63-77
Electronic Edition (link) BibTeX
Daniel Leivant:
On the Completeness of Dynamic Logic. 78-91
Electronic Edition (link) BibTeX
Colin Stirling:
Dependency Tree Automata. 92-106
Electronic Edition (link) BibTeX
Christopher Broadbent, Luke Ong:
On Global Model Checking Trees Generated by Higher-Order Recursion Schemes. 107-121
Electronic Edition (link) BibTeX

Algebras

Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexandra Silva:
A Kleene Theorem for Polynomial Coalgebras. 122-136
Electronic Edition (link) BibTeX
Rob Myers, Dirk Pattinson, Lutz Schröder:
Coalgebraic Hybrid Logic. 137-151
Electronic Edition (link) BibTeX
Jirí Adámek, Stefan Milius, Jiri Velebil:
A Description of Iterative Reflections of Monads (Extended Abstract). 152-166
Electronic Edition (link) BibTeX

Automata Theory

Sven Schewe:
Tighter Bounds for the Determinisation of Büchi Automata. 167-181
Electronic Edition (link) BibTeX
Orna Kupferman, Nir Piterman:
Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata. 182-196
Electronic Edition (link) BibTeX
Béatrice Bérard, Serge Haddad:
Interrupt Timed Automata. 197-211
Electronic Edition (link) BibTeX
Markus Lohrey, Sebastian Maneth, Manfred Schmidt-Schauß:
Parameter Reduction in Grammar-Compressed Trees. 212-226
Electronic Edition (link) BibTeX

Processes and Models

Luca Fossati, Daniele Varacca:
The Calculus of Handshake Configurations. 227-241
Electronic Edition (link) BibTeX
Jesús Aranda, Frank D. Valencia, Cristian Versari:
On the Expressive Power of Restriction and Priorities in CCS with Replication. 242-256
Electronic Edition (link) BibTeX
Sergueï Lenglet, Alan Schmitt, Jean-Bernard Stefani:
Normal Bisimulations in Calculi with Passivation. 257-271
Electronic Edition (link) BibTeX
Filippo Bonchi, Fabio Gadducci, Giacoma Valentina Monreale:
Reactive Systems, Barbed Semantics, and the Mobile Ambients. 272-287
Electronic Edition (link) BibTeX

Security

Geoffrey Smith:
On the Foundations of Quantitative Information Flow. 288-302
Electronic Edition (link) BibTeX
Joshua D. Guttman:
Cryptographic Protocol Composition via the Authentication Tests. 303-317
Electronic Edition (link) BibTeX
Konstantinos Chatzikokolakis, Gethin Norman, David Parker:
Bisimulation for Demonic Schedulers. 318-332
Electronic Edition (link) BibTeX

Probabilistic and Quantitative Models

Rajeev Alur, Aldric Degorre, Oded Maler, Gera Weiss:
On Omega-Languages Defined by Mean-Payoff Conditions. 333-347
Electronic Edition (link) BibTeX
Parosh Aziz Abdulla, Richard Mayr:
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets. 348-363
Electronic Edition (link) BibTeX
Martin R. Neuhäußer, Mariëlle Stoelinga, Joost-Pieter Katoen:
Delayed Nondeterminism in Continuous-Time Markov Decision Processes. 364-379
Electronic Edition (link) BibTeX
Samy Abbes, Albert Benveniste:
Concurrency, sigma-Algebras, and Probabilistic Fairness. 380-394
Electronic Edition (link) BibTeX

Synthesis

Yoad Lustig, Moshe Y. Vardi:
Synthesis from Component Libraries. 395-409
Electronic Edition (link) BibTeX
Benedikt Bollig, Manuela-Lidia Grindei, Peter Habermehl:
Realizability of Concurrent Recursive Programs. 410-424
Electronic Edition (link) BibTeX

Program Analysis and Semantics

Kshitij Bansal, Rémi Brochenin, Étienne Lozes:
Beyond Shapes: Lists with Ordered Data. 425-439
Electronic Edition (link) BibTeX
Morten Kühnrich, Stefan Schwoon, Jirí Srba, Stefan Kiefer:
Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains. 440-455
Electronic Edition (link) BibTeX
Lars Birkedal, Kristian Støvring, Jacob Thamsborg:
Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types. 456-470
Electronic Edition (link) BibTeX