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

Helmut Seidl (Herausgeber)

Buch | Softcover

XVI, 379 Seiten

2007 | 2007
Springer Berlin (Verlag)
978-3-540-71388-3 (ISBN)

Artikel merken

lt;p>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.

Invited Talk.- Formal Foundations for Aspects.- Contributed Papers.- Sampled Universality of Timed Automata.- Iterator Types.- Types and Effects for Resource Usage Analysis.- The Complexity of Generalized Satisfiability for Linear Temporal Logic.- Formalising the ?-Calculus Using Nominal Logic.- The Rewriting Calculus as a Combinatory Reduction System.- Relational Parametricity and Separation Logic.- Model-Checking One-Clock Priced Timed Automata.- Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems.- Optimal Strategy Synthesis in Stochastic Müller Games.- Generalized Parity Games.- Tree Automata with Memory, Visibility and Structural Constraints.- Enriched ?-Calculi Module Checking.- PDL with Intersection and Converse Is 2EXP-Complete.- Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems.- A Distribution Law for CCS and a New Congruence Result for the ?-Calculus.- On the Expressiveness and Complexity of ATL.- Polynomial Constraints for Sets with Cardinality Bounds.- A Lower Bound on Web Services Composition.- Logical Characterizations of Bisimulations for Discrete Probabilistic Systems.- Semantic Barbs and Biorthogonality.- On the Stability by Union of Reducibility Candidates.- An Effective Algorithm for the Membership Problem for Extended Regular Expressions.- Complexity Results on Balanced Context-Free Languages.- Logical Reasoning for Higher-Order Functions with Local State.

Erscheint lt. Verlag	9.3.2007
Reihe/Serie	Lecture Notes in Computer Science
Reihe/Serie	Theoretical Computer Science and General Issues
Zusatzinfo	XVI, 379 p.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 235 mm
Gewicht	558 g
Themenwelt	Mathematik / Informatik ► Informatik ► Software Entwicklung
Themenwelt	Informatik ► Theorie / Studium ► Compilerbau
Schlagworte	Automat • Automata • Complexity • Computational Structures • formal methods • Formal Verification • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Logical Foundations • Mathematical Foundations • Modal Logics • Model Checking • Process Algebras • program analysis • program correctness • Program Logics • programming • programming calculi • Programming language • Programming Theory • security • Semantics • Semantics of Programming Languages • Software engineering • software science • Type Theory • verification • Web Services
ISBN-10	3-540-71388-3 / 3540713883
ISBN-13	978-3-540-71388-3 / 9783540713883
Zustand	Neuware