Cover Image
Read Now

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

Bibliographic Details
Other Authors: Seidl, Helmut (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2007, 2007
Edition:1st ed. 2007
Series:Theoretical Computer Science and General Issues
Subjects:
Compilers (computer Programs)
Computer Science Logic And Foundations Of Programming
Compilers And Interpreters
Software Engineering
Computer Science
Formal Languages And Automata Theory
Machine Theory
Theory Of Computation
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
LEADER 02924nmm a2200349 u 4500
001 EB000378436
003 EBX01000000000000000231488
005 00000000000000.0
007 cr|||||||||||||||||||||
008 130626 ||| eng
020 |a 9783540713890 
100 1 |a Seidl, Helmut  |e [editor] 
245 0 0 |a Foundations of Software Science and Computational Structures  |h Elektronische Ressource  |b 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  |c edited by Helmut Seidl 
250 |a 1st ed. 2007 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 2007, 2007 
300 |a XVI, 379 p  |b online resource 
505 0 |a 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 
653 |a Compilers (Computer programs) 
653 |a Computer Science Logic and Foundations of Programming 
653 |a Compilers and Interpreters 
653 |a Software engineering 
653 |a Computer science 
653 |a Software Engineering 
653 |a Formal Languages and Automata Theory 
653 |a Machine theory 
653 |a Theory of Computation 
041 0 7 |a eng  |2 ISO 639-2 
989 |b Springer  |a Springer eBooks 2005- 
490 0 |a Theoretical Computer Science and General Issues 
028 5 0 |a 10.1007/978-3-540-71389-0 
856 4 0 |u https://doi.org/10.1007/978-3-540-71389-0?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 005.1 

Similar Items