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 BibTeX
Invited Talk
Contributed Papers
- Parosh Aziz Abdulla, Pavel Krcál, Wang Yi:
Sampled Universality of Timed Automata.
2-16
Electronic Edition (link) BibTeX
- Sandra Alves, Maribel Fernández, Mário Florido, Ian Mackie:
Iterator Types.
17-31
Electronic Edition (link) BibTeX
- Massimo Bartoletti, Pierpaolo Degano, Gian Luigi Ferrari, Roberto Zunino:
Types and Effects for Resource Usage Analysis.
32-47
Electronic Edition (link) BibTeX
- Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer:
The Complexity of Generalized Satisfiability for Linear Temporal Logic.
48-62
Electronic Edition (link) BibTeX
- Jesper Bengtson, Joachim Parrow:
Formalising the pi-Calculus Using Nominal Logic.
63-77
Electronic Edition (link) BibTeX
- Clara Bertolissi, Claude Kirchner:
The Rewriting Calculus as a Combinatory Reduction System.
78-92
Electronic Edition (link) BibTeX
- Lars Birkedal, Hongseok Yang:
Relational Parametricity and Separation Logic.
93-107
Electronic Edition (link) BibTeX
- Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey:
Model-Checking One-Clock Priced Timed Automata.
108-122
Electronic Edition (link) BibTeX
- Franck van Breugel, Babita Sharma, James Worrell:
Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems.
123-137
Electronic Edition (link) BibTeX
- Krishnendu Chatterjee:
Optimal Strategy Synthesis in Stochastic Müller Games.
138-152
Electronic Edition (link) BibTeX
- Krishnendu Chatterjee, Thomas A. Henzinger, Nir Piterman:
Generalized Parity Games.
153-167
Electronic Edition (link) BibTeX
- Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin:
Tree Automata with Memory, Visibility and Structural Constraints.
168-182
Electronic Edition (link) BibTeX
- Alessandro Ferrante, Aniello Murano:
Enriched µ-Calculi Module Checking.
183-197
Electronic Edition (link) BibTeX
- Stefan Göller, Markus Lohrey, Carsten Lutz:
PDL with Intersection and Converse Is 2 EXP-Complete.
198-212
Electronic Edition (link) BibTeX
- Matthew Hague, C.-H. Luke Ong:
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems.
213-227
Electronic Edition (link) BibTeX
- Daniel Hirschkoff, Damien Pous:
A Distribution Law for CCS and a New Congruence Result for the pi-Calculus.
228-242
Electronic Edition (link) BibTeX
- François Laroussinie, Nicolas Markey, Ghassan Oreiby:
On the Expressiveness and Complexity of ATL.
243-257
Electronic Edition (link) BibTeX
- Bruno Marnette, Viktor Kuncak, Martin C. Rinard:
Polynomial Constraints for Sets with Cardinality Bounds.
258-273
Electronic Edition (link) BibTeX
- Anca Muscholl, Igor Walukiewicz:
A Lower Bound on Web Services Composition.
274-286
Electronic Edition (link) BibTeX
- Augusto Parma, Roberto Segala:
Logical Characterizations of Bisimulations for Discrete Probabilistic Systems.
287-301
Electronic Edition (link) BibTeX
- Julian Rathke, Vladimiro Sassone, Pawel Sobocinski:
Semantic Barbs and Biorthogonality.
302-316
Electronic Edition (link) BibTeX
- Colin Riba:
On the Stability by Union of Reducibility Candidates.
317-331
Electronic Edition (link) BibTeX
- Grigore Rosu:
An Effective Algorithm for the Membership Problem for Extended Regular Expressions.
332-345
Electronic Edition (link) BibTeX
- Akihiko Tozawa, Yasuhiko Minamide:
Complexity Results on Balanced Context-Free Languages.
346-360
Electronic Edition (link) BibTeX
- Nobuko Yoshida, Kohei Honda, Martin Berger:
Logical Reasoning for Higher-Order Functions with Local State.
361-377
Electronic Edition (link) BibTeX
Copyright © Tue May 27 17:52:48 2008
by Michael Ley (ley@uni-trier.de)
