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

Forsideomslag
Helmut Seidl
Springer Science & Business Media, 2. jul. 2007 - 379 sider

This book constitutes the refereed proceedings of the 10th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2007, held in Braga, Portugal in March/April 2007. The 25 revised full papers presented together with the abstract of one invited talk cover a broad spectrum on theories and methods to support analysis, synthesis, transformation and verification of programs and software systems.

 

Hvad folk siger - Skriv en anmeldelse

Vi har ikke fundet nogen anmeldelser de normale steder.

Indhold

Formal Foundations for Aspects
1
Sampled Universality of Timed Automata
2
Iterator Types
17
Types and Effects for Resource Usage Analysis
32
The Complexity of Generalized Satisfiability for Linear Temporal Logic
48
Formalising the πCalculus Using Nominal Logic
63
The Rewriting Calculus as a Combinatory Reduction System
78
Relational Parametricity and Separation Logic
93
PDL with Intersection and Converse Is 2EXPComplete
198
Symbolic BackwardsReachability Analysis for HigherOrder Pushdown Systems
213
A Distribution Law for CCS and a New Congruence Result for the πCalculus
228
On the Expressiveness and Complexity of ATL
243
Polynomial Constraints for Sets with Cardinality Bounds
258
A Lower Bound on Web Services Composition
274
Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
287
Semantic Barbs and Biorthogonality
302

ModelChecking OneClock Priced Timed Automata
108
Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems
123
Optimal Strategy Synthesis in Stochastic Müller Games
138
Generalized Parity Games
153
Tree Automata with Memory Visibility and Structural Constraints
168
Enriched μCalculi Module Checking
183
On the Stability by Union of Reducibility Candidates
317
An Effective Algorithm for the Membership Problem for Extended Regular Expressions
332
Complexity Results on Balanced ContextFree
346
Logical Reasoning for HigherOrder Functions with Local State
361
Author Index
378

Andre udgaver - Se alle

Almindelige termer og sætninger

Bibliografiske oplysninger