Custom cover image
Custom cover image

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

Contributor(s): Resource type: Ressourcentyp: Buch (Online)Book (Online)Language: English Series: SpringerLink Bücher | Lecture notes in computer science ; 4423Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007Description: Online-Ressource (XVI, 379 p. Also available online, digital)ISBN:
  • 9783540713890
Subject(s): Genre/Form: Additional physical formats: 9783540713883 | Buchausg. u.d.T.: Foundations of software science and computational structures. Berlin : Springer, 2007. XVI, 377 S.MSC: MSC: *68-06 | 68Qxx | 00B25RVK: RVK: SS 4800LOC classification:
  • QA76.9.L63 QA76.5913 QA76.63
DOI: DOI: 10.1007/978-3-540-71389-0Online resources: Summary: 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.PPN: PPN: 164675008XPackage identifier: Produktsigel: ZDB-2-SCS | ZDB-2-LNC | ZDB-2-SEB | ZDB-2-SCS | ZDB-2-SXCS | ZDB-2-SEB
No physical items for this record
KIT – The University in the Helmholtz Association                         Home | Impressum | Datenschutz | Barrierefreiheit | KIT