FoSSaCS B

33 papers

YearTitle / Authors
2009A Description of Iterative Reflections of Monads (Extended Abstract).
Jirí Adámek, Stefan Milius, Jirí Velebil
2009A Kleene Theorem for Polynomial Coalgebras.
Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexandra Silva
2009Beyond Shapes: Lists with Ordered Data.
Kshitij Bansal, Rémi Brochenin, Étienne Lozes
2009Bisimulation for Demonic Schedulers.
Konstantinos Chatzikokolakis, Gethin Norman, David Parker
2009Coalgebraic Hybrid Logic.
Robert S. R. Myers, Dirk Pattinson, Lutz Schröder
2009Concurrency, sigma-Algebras, and Probabilistic Fairness.
Samy Abbes, Albert Benveniste
2009Cryptographic Protocol Composition via the Authentication Tests.
Joshua D. Guttman
2009Delayed Nondeterminism in Continuous-Time Markov Decision Processes.
Martin R. Neuhäußer, Mariëlle Stoelinga, Joost-Pieter Katoen
2009Dependency Tree Automata.
Colin Stirling
2009Facets of Synthesis: Revisiting Church's Problem.
Wolfgang Thomas
2009Foundations 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
Luca de Alfaro
2009Full Abstraction for Reduced ML.
Andrzej S. Murawski, Nikos Tzevelekos
2009Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains.
Morten Kühnrich, Stefan Schwoon, Jirí Srba, Stefan Kiefer
2009Interrupt Timed Automata.
Béatrice Bérard, Serge Haddad
2009Least and Greatest Fixpoints in Game Semantics.
Pierre Clairambault
2009Logics and Bisimulation Games for Concurrency, Causality and Conflict.
Julian Gutierrez
2009Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata.
Orna Kupferman, Nir Piterman
2009Minimal Cost Reachability/Coverability in Priced Timed Petri Nets.
Parosh Aziz Abdulla, Richard Mayr
2009Normal Bisimulations in Calculi with Passivation.
Sergueï Lenglet, Alan Schmitt, Jean-Bernard Stefani
2009On Global Model Checking Trees Generated by Higher-Order Recursion Schemes.
Christopher H. Broadbent, C.-H. Luke Ong
2009On Omega-Languages Defined by Mean-Payoff Conditions.
Rajeev Alur, Aldric Degorre, Oded Maler, Gera Weiss
2009On the Completeness of Dynamic Logic.
Daniel Leivant
2009On the Expressive Power of Restriction and Priorities in CCS with Replication.
Jesús Aranda, Frank D. Valencia, Cristian Versari
2009On the Foundations of Quantitative Information Flow.
Geoffrey Smith
2009Parameter Reduction in Grammar-Compressed Trees.
Markus Lohrey, Sebastian Maneth, Manfred Schmidt-Schauß
2009Reactive Systems, Barbed Semantics, and the Mobile Ambients.
Filippo Bonchi, Fabio Gadducci, Giacoma Valentina Monreale
2009Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types.
Lars Birkedal, Kristian Støvring, Jacob Thamsborg
2009Realizability of Concurrent Recursive Programs.
Benedikt Bollig, Manuela-Lidia Grindei, Peter Habermehl
2009Separating Graph Logic from MSO.
Timos Antonopoulos, Anuj Dawar
2009Synthesis from Component Libraries.
Yoad Lustig, Moshe Y. Vardi
2009Temporal Reasoning about Program Executions.
Rajeev Alur
2009The Calculus of Handshake Configurations.
Luca Fossati, Daniele Varacca
2009Tighter Bounds for the Determinisation of Büchi Automata.
Sven Schewe