Buch, Englisch, Band 4423, 379 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1230 g
Foundations of Software Science and Computational Structures
Erscheinungsjahr 2007
ISBN: 978-3-540-71388-3
Verlag: Springer
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
Buch, Englisch, Band 4423, 379 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1230 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-540-71388-3
Verlag: Springer
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.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
- Interdisziplinäres Wissenschaften Wissenschaften: Forschung und Information Kybernetik, Systemtheorie, Komplexe Systeme
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Software Engineering Objektorientierte Softwareentwicklung
- Mathematik | Informatik Mathematik Mathematik Interdisziplinär Systemtheorie
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Prozedurale Programmierung
Weitere Infos & Material
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.