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, ProceedingsHelmut 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. |
Indhold
Iterator Types | 17 |
Types and Eects for Resource Usage Analysis | 32 |
The Complexity of Generalized Satisfiabilityfor Linear Temporal Logic | 48 |
Formalising the πCalculus Using Nominal Logic | 63 |
Relational Parametricity and Separation Logic | 93 |
ModelChecking OneClockPriced Timed Automata | 108 |
Approximating a Behavioural PseudometricWithout Discount for Probabilistic Systems | 123 |
Optimal Strategy Synthesis inStochastic M ̈uller Games | 138 |
A Distribution Law for CCS anda New Congruence Result for the πCalculus | 228 |
On the Expressiveness and Complexity of ATL | 243 |
Polynomial Constraints forSets with Cardinality Bounds | 258 |
A Lower Bound on Web Services Composition | 274 |
Logical Characterizations of Bisimulations forDiscrete Probabilistic Systems | 287 |
Semantic Barbs and Biorthogonality | 302 |
On the Stability by Union of ReducibilityCandidates | 317 |
An Effective Algorithm for the MembershipProblem for Extended Regular Expressions | 332 |
Generalized Parity Games | 153 |
Tree Automata with Memory Visibility andStructural Constraints | 168 |
Enriched μCalculi Module Checking | 183 |
PDL with Intersection and Converse Is 2EXPComplete | 198 |
Symbolic BackwardsReachability Analysis forHigherOrder Pushdown Systems | 213 |
Complexity Results on Balanced ContextFreeLanguages | 346 |
Logical Reasoning forHigherOrder Functions with Local State | 361 |
| 378 | |
Andre udgaver - Se alle
Foundations of Software Science and Computational Structures: 10th ... Helmut Seidl Uddragsvisning - 2007 |
Almindelige termer og sætninger
A₁ abstract ai+1 algorithm automaton biorthogonal bisimilarity bisimulation Boolean bound names calculus checking complexity Computer Science configuration congruence consider constraints construct context corresponding datatype defined definition denote derivation encoding equivalence example exists EXPTIME finite set formula FOSSACS function game graph given higher-order history expressions ICPDL induction infinite input iter itree Kripke structure labeled language Lemma linear LNCS loop memory modal model-checking module node operational semantics operator p-calculus parity parity games path player probabilistic automata problem Proc process calculi processes proof Proposition pseudometric PSPACE PSPACE-complete pushdown reachability reduction regular expressions relation result rewrite rules satisfiability Section semantics separation logic sequence simulation Springer Streett subset symbol t₁ temporal Theorem transition relation tree automata TWAPTA variables VTAM WCTL winning condition winning strategy
Populære passager
Side 272 - References [1] A. Aiken, D. Kozen, M. Vardi and E. Wimmers. The complexity of set constraints.