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

Invited Talks

Wolfgang Thomas:
Facets of Synthesis: Revisiting Church's Problem. 1-14
Rajeev Alur:
Temporal Reasoning about Program Executions. 15

Semantics

Pierre Clairambault:
Least and Greatest Fixpoints in Game Semantics. 16-31
Andrzej S. Murawski, Nikos Tzevelekos:
Full Abstraction for Reduced ML. 32-47
Julian Gutierrez:
Logics and Bisimulation Games for Concurrency, Causality and Conflict. 48-62

Logics and Automata

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

Algebras

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

Automata Theory

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

Processes and Models

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

Security

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

Probabilistic and Quantitative Models

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

Synthesis

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

Program Analysis and Semantics

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

Last update Sat May 25 02:54:26 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page