Abstract is missing.
- Formal Foundations for AspectsRadha Jagadeesan. 1 [doi]
- Sampled Universality of Timed AutomataParosh Aziz Abdulla, Pavel Krcál, Wang Yi. 2-16 [doi]
- Iterator TypesSandra Alves, Maribel Fernández, Mário Florido, Ian Mackie. 17-31 [doi]
- Types and Effects for Resource Usage AnalysisMassimo Bartoletti, Pierpaolo Degano, Gian Luigi Ferrari, Roberto Zunino. 32-47 [doi]
- The Complexity of Generalized Satisfiability for Linear Temporal LogicMichael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer. 48-62 [doi]
- Formalising the ::::pi::::-Calculus Using Nominal LogicJesper Bengtson, Joachim Parrow. 63-77 [doi]
- The Rewriting Calculus as a Combinatory Reduction SystemClara Bertolissi, Claude Kirchner. 78-92 [doi]
- Relational Parametricity and Separation LogicLars Birkedal, Hongseok Yang. 93-107 [doi]
- Model-Checking One-Clock Priced Timed AutomataPatricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey. 108-122 [doi]
- Approximating a Behavioural Pseudometric Without Discount for Probabilistic SystemsFranck van Breugel, Babita Sharma, James Worrell. 123-137 [doi]
- Optimal Strategy Synthesis in Stochastic Müller GamesKrishnendu Chatterjee. 138-152 [doi]
- Generalized Parity GamesKrishnendu Chatterjee, Thomas A. Henzinger, Nir Piterman. 153-167 [doi]
- Tree Automata with Memory, Visibility and Structural ConstraintsHubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin. 168-182 [doi]
- Enriched µ-Calculi Module CheckingAlessandro Ferrante, Aniello Murano. 183-197 [doi]
- PDL with Intersection and Converse Is 2 EXP-CompleteStefan Göller, Markus Lohrey, Carsten Lutz. 198-212 [doi]
- Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown SystemsMatthew Hague, C.-H. Luke Ong. 213-227 [doi]
- A Distribution Law for CCS and a New Congruence Result for the ::::pi::::-CalculusDaniel Hirschkoff, Damien Pous. 228-242 [doi]
- On the Expressiveness and Complexity of ATLFrançois Laroussinie, Nicolas Markey, Ghassan Oreiby. 243-257 [doi]
- Polynomial Constraints for Sets with Cardinality BoundsBruno Marnette, Viktor Kuncak, Martin C. Rinard. 258-273 [doi]
- A Lower Bound on Web Services CompositionAnca Muscholl, Igor Walukiewicz. 274-286 [doi]
- Logical Characterizations of Bisimulations for Discrete Probabilistic SystemsAugusto Parma, Roberto Segala. 287-301 [doi]
- Semantic Barbs and BiorthogonalityJulian Rathke, Vladimiro Sassone, Pawel Sobocinski. 302-316 [doi]
- On the Stability by Union of Reducibility CandidatesColin Riba. 317-331 [doi]
- An Effective Algorithm for the Membership Problem for Extended Regular ExpressionsGrigore Rosu. 332-345 [doi]
- Complexity Results on Balanced Context-Free LanguagesAkihiko Tozawa, Yasuhiko Minamide. 346-360 [doi]
- Logical Reasoning for Higher-Order Functions with Local StateNobuko Yoshida, Kohei Honda, Martin Berger. 361-377 [doi]