10. FoSSaCS 2007:
Braga, Portugal (Part of ETAPS 2007)
Helmut Seidl (Ed.):
Foundations of Software Science and Computational Structures, 10th International Conference, FOSSACS 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007, Braga, Portugal, March 24-April 1, 2007, Proceedings.
Lecture Notes in Computer Science 4423 Springer 2007, ISBN 978-3-540-71388-3 
Invited Talk
Contributed Papers
- Parosh Aziz Abdulla, Pavel Krcál, Wang Yi:
Sampled Universality of Timed Automata.
2-16
- Sandra Alves, Maribel Fernández, Mário Florido, Ian Mackie:
Iterator Types.
17-31
- Massimo Bartoletti, Pierpaolo Degano, Gian Luigi Ferrari, Roberto Zunino:
Types and Effects for Resource Usage Analysis.
32-47
- Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer:
The Complexity of Generalized Satisfiability for Linear Temporal Logic.
48-62
- Jesper Bengtson, Joachim Parrow:
Formalising the pi-Calculus Using Nominal Logic.
63-77
- Clara Bertolissi, Claude Kirchner:
The Rewriting Calculus as a Combinatory Reduction System.
78-92
- Lars Birkedal, Hongseok Yang:
Relational Parametricity and Separation Logic.
93-107
- Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey:
Model-Checking One-Clock Priced Timed Automata.
108-122
- Franck van Breugel, Babita Sharma, James Worrell:
Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems.
123-137
- Krishnendu Chatterjee:
Optimal Strategy Synthesis in Stochastic Müller Games.
138-152
- Krishnendu Chatterjee, Thomas A. Henzinger, Nir Piterman:
Generalized Parity Games.
153-167
- Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin:
Tree Automata with Memory, Visibility and Structural Constraints.
168-182
- Alessandro Ferrante, Aniello Murano:
Enriched µ-Calculi Module Checking.
183-197
- Stefan Göller, Markus Lohrey, Carsten Lutz:
PDL with Intersection and Converse Is 2 EXP-Complete.
198-212
- Matthew Hague, C.-H. Luke Ong:
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems.
213-227
- Daniel Hirschkoff, Damien Pous:
A Distribution Law for CCS and a New Congruence Result for the pi-Calculus.
228-242
- François Laroussinie, Nicolas Markey, Ghassan Oreiby:
On the Expressiveness and Complexity of ATL.
243-257
- Bruno Marnette, Viktor Kuncak, Martin C. Rinard:
Polynomial Constraints for Sets with Cardinality Bounds.
258-273
- Anca Muscholl, Igor Walukiewicz:
A Lower Bound on Web Services Composition.
274-286
- Augusto Parma, Roberto Segala:
Logical Characterizations of Bisimulations for Discrete Probabilistic Systems.
287-301
- Julian Rathke, Vladimiro Sassone, Pawel Sobocinski:
Semantic Barbs and Biorthogonality.
302-316
- Colin Riba:
On the Stability by Union of Reducibility Candidates.
317-331
- Grigore Rosu:
An Effective Algorithm for the Membership Problem for Extended Regular Expressions.
332-345
- Akihiko Tozawa, Yasuhiko Minamide:
Complexity Results on Balanced Context-Free Languages.
346-360
- Nobuko Yoshida, Kohei Honda, Martin Berger:
Logical Reasoning for Higher-Order Functions with Local State.
361-377
Last update Wed May 22 04:37:46 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
