Vai al contenuto principale della pagina
Titolo: |
Foundations of Software Science and Computational Structures [[electronic resource] ] : 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 / / edited by Helmut Seidl
![]() |
Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
Edizione: | 1st ed. 2007. |
Descrizione fisica: | 1 online resource (387 p.) |
Disciplina: | 003 |
Soggetto topico: | Software engineering |
Computer science | |
Machine theory | |
Compilers (Computer programs) | |
Software Engineering | |
Theory of Computation | |
Computer Science Logic and Foundations of Programming | |
Formal Languages and Automata Theory | |
Compilers and Interpreters | |
Persona (resp. second.): | SeidlHelmut |
Note generali: | Description based upon print version of record. |
Nota di bibliografia: | Includes bibliographical references and index. |
Nota di contenuto: | 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. |
Titolo autorizzato: | Foundations of Software Science and Computational Structures ![]() |
ISBN: | 3-540-71389-1 |
Formato: | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione: | Inglese |
Record Nr.: | 996465929203316 |
Lo trovi qui: | Univ. di Salerno |
Opac: | Controlla la disponibilità qui |