Abstract is missing.
- Introduction to Decidability of Higher-Order MatchingColin Stirling. 1 [doi]
- A Semantic Foundation for Hidden StateJan Schwinghammer, Hongseok Yang, Lars Birkedal, François Pottier, Bernhard Reus. 2-17 [doi]
- Linearly-Used Continuations in the Enriched Effect CalculusJeff Egger, Rasmus Ejlers Møgelberg, Alex Simpson. 18-32 [doi]
- Block Structure vs. Scope Extrusion: Between Innocence and OmniscienceAndrzej S. Murawski, Nikos Tzevelekos. 33-47 [doi]
- Completeness for Algebraic Theories of Local StateSam Staton. 48-63 [doi]
- Fair Adversaries and Randomization in Two-Player GamesEugene Asarin, Raphaël Chane-Yack-Fa, Daniele Varacca. 64-78 [doi]
- Retaining the Probabilities in Probabilistic Testing TheorySonja Georgievska, Suzana Andova. 79-93 [doi]
- Forward Analysis of Depth-Bounded ProcessesThomas Wies, Damien Zufferey, Thomas A. Henzinger. 94-108 [doi]
- Incremental Pattern-Based Coinduction for Process Algebra and Its Isabelle FormalizationAndrei Popescu, Elsa L. Gunter. 109-127 [doi]
- Parameterised Multiparty Session TypesNobuko Yoshida, Pierre-Malo Deniélou, Andi Bejleri, Raymond Hu. 128-145 [doi]
- On the Relationship between Spatial Logics and Behavioral SimulationsLucia Acciai, Michele Boreale, Gianluigi Zavattaro. 146-160 [doi]
- An Easy Completeness Proof for the Modal ::::µ::::-Calculus on Finite TreesBalder ten Cate, Gaëlle Fontaine. 161-175 [doi]
- When Model-Checking Freeze LTL over Counter Machines Becomes DecidableStéphane Demri, Arnaud Sangnier. 176-190 [doi]
- Model Checking ::::Is:::: Static Analysis of Modal LogicFlemming Nielson, Hanne Riis Nielson. 191-205 [doi]
- Counting CTLFrançois Laroussinie, Antoine Meyer, Eudes Petonnet. 206-220 [doi]
- Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite SystemsAnthony Widjaja To, Leonid Libkin. 221-236 [doi]
- Toward a Compositional Theory of Leftist Grammars and TransformationsPierre Chambart, Ph. Schnoebelen. 237-251 [doi]
- Degrees of Lookahead in Regular Infinite GamesMichael Holtmann, Lukasz Kaiser, Wolfgang Thomas. 252-266 [doi]
- Reachability Analysis of Communicating Pushdown SystemsAlexander Heußner, Jérôme Leroux, Anca Muscholl, Grégoire Sutre. 267-281 [doi]
- The Complexity of Synchronous Notions of Information Flow SecurityFranck Cassez, Ron van der Meyden, Chenyi Zhang. 282-296 [doi]
- Monads Need Not Be EndofunctorsThorsten Altenkirch, James Chapman, Tarmo Uustalu. 297-311 [doi]
- CIA Structures and the Semantics of RecursionStefan Milius, Lawrence S. Moss, Daniel Schwencke. 312-327 [doi]
- Coalgebraic Correspondence TheoryLutz Schröder, Dirk Pattinson. 328-342 [doi]
- Untyped Recursion Schemes and Infinite Intersection TypesTakeshi Tsukada, Naoki Kobayashi. 343-357 [doi]
- Solvability in Resource Lambda-CalculusMichele Pagani, Simona Ronchi Della Rocca. 358-373 [doi]
- A Hierarchy for Delimited Continuations in Call-by-NameAlexis Saurin. 374-388 [doi]