13. FoSSaCS 2010: Paphos, Cyprus (Part of ETAPS 2010)

C.-H. Luke Ong (Ed.): Foundations of Software Science and Computational Structures, 13th International Conference, FOSSACS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings. Lecture Notes in Computer Science 6014 Springer 2010, ISBN 978-3-642-12031-2

FoSSaCS 2010 Invited Talk

Colin Stirling:
Introduction to Decidability of Higher-Order Matching. 1

Semantics of Programming Languages

Jan Schwinghammer, Hongseok Yang, Lars Birkedal, François Pottier, Bernhard Reus:
A Semantic Foundation for Hidden State. 2-17
Jeff Egger, Rasmus Ejlers Møgelberg, Alex Simpson:
Linearly-Used Continuations in the Enriched Effect Calculus. 18-32
Andrzej S. Murawski, Nikos Tzevelekos:
Block Structure vs. Scope Extrusion: Between Innocence and Omniscience. 33-47
Sam Staton:
Completeness for Algebraic Theories of Local State. 48-63

Probabilistic and Randomised Computation

Eugene Asarin, Raphaël Chane-Yack-Fa, Daniele Varacca:
Fair Adversaries and Randomization in Two-Player Games. 64-78
Sonja Georgievska, Suzana Andova:
Retaining the Probabilities in Probabilistic Testing Theory. 79-93

Concurrency and Process Theory

Thomas Wies, Damien Zufferey, Thomas A. Henzinger:
Forward Analysis of Depth-Bounded Processes. 94-108
Andrei Popescu, Elsa L. Gunter:
Incremental Pattern-Based Coinduction for Process Algebra and Its Isabelle Formalization. 109-127
Nobuko Yoshida, Pierre-Malo Deniélou, Andi Bejleri, Raymond Hu:
Parameterised Multiparty Session Types. 128-145
Lucia Acciai, Michele Boreale, Gianluigi Zavattaro:
On the Relationship between Spatial Logics and Behavioral Simulations. 146-160

Modal and Temporal Logics

Balder ten Cate, Gaëlle Fontaine:
An Easy Completeness Proof for the Modal µ-Calculus on Finite Trees. 161-175
Stéphane Demri, Arnaud Sangnier:
When Model-Checking Freeze LTL over Counter Machines Becomes Decidable. 176-190
Flemming Nielson, Hanne Riis Nielson:
Model Checking Is Static Analysis of Modal Logic. 191-205
François Laroussinie, Antoine Meyer, Eudes Petonnet:
Counting CTL. 206-220
Anthony Widjaja To, Leonid Libkin:
Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems. 221-236

Verification

Pierre Chambart, Ph. Schnoebelen:
Toward a Compositional Theory of Leftist Grammars and Transformations. 237-251
Michael Holtmann, Lukasz Kaiser, Wolfgang Thomas:
Degrees of Lookahead in Regular Infinite Games. 252-266
Alexander Heußner, Jérôme Leroux, Anca Muscholl, Grégoire Sutre:
Reachability Analysis of Communicating Pushdown Systems. 267-281
Franck Cassez, Ron van der Meyden, Chenyi Zhang:
The Complexity of Synchronous Notions of Information Flow Security. 282-296

Categorical and Coalgebraic Methods

Thorsten Altenkirch, James Chapman, Tarmo Uustalu:
Monads Need Not Be Endofunctors. 297-311
Stefan Milius, Lawrence S. Moss, Daniel Schwencke:
CIA Structures and the Semantics of Recursion. 312-327
Lutz Schröder, Dirk Pattinson:
Coalgebraic Correspondence Theory. 328-342

Lambda Calculus and Types

Takeshi Tsukada, Naoki Kobayashi:
Untyped Recursion Schemes and Infinite Intersection Types. 343-357
Michele Pagani, Simona Ronchi Della Rocca:
Solvability in Resource Lambda-Calculus. 358-373
Alexis Saurin:
A Hierarchy for Delimited Continuations in Call-by-Name. 374-388

Last update Fri May 25 08:14:19 2012 CET by the DBLP Team —

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