LEADER 04244nam  22007455  450 
001 996465929203316
005 20230220131026.0
010   $a3-540-71389-1
024 7 $a10.1007/978-3-540-71389-0
035   $a(CKB)1000000000490590
035   $a(EBL)3061531
035   $a(SSID)ssj0000317775
035   $a(PQKBManifestationID)11923552
035   $a(PQKBTitleCode)TC0000317775
035   $a(PQKBWorkID)10295538
035   $a(PQKB)11435172
035   $a(DE-He213)978-3-540-71389-0
035   $a(MiAaPQ)EBC3061531
035   $a(MiAaPQ)EBC6282946
035   $a(PPN)123727014
035   $a(EXLCZ)991000000000490590
100   $a20100301d2007      u|             0
101 0 $aeng
135   $aur|n|---|||||
181   $ctxt
182   $cc
183   $acr
200 10$aFoundations of Software Science and Computational Structures$b[electronic resource] $e10th 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 /$fedited by Helmut Seidl
205   $a1st ed. 2007.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2007.
215   $a1 online resource (387 p.)
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4423
300   $aDescription based upon print version of record.
311   $a3-540-71388-3 
320   $aIncludes bibliographical references and index.
327   $aInvited 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.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4423
606   $aSoftware engineering
606   $aComputer science
606   $aMachine theory
606   $aCompilers (Computer programs)
606   $aSoftware Engineering
606   $aTheory of Computation
606   $aComputer Science Logic and Foundations of Programming
606   $aFormal Languages and Automata Theory
606   $aCompilers and Interpreters
615  0$aSoftware engineering.
615  0$aComputer science.
615  0$aMachine theory.
615  0$aCompilers (Computer programs).
615 14$aSoftware Engineering.
615 24$aTheory of Computation.
615 24$aComputer Science Logic and Foundations of Programming.
615 24$aFormal Languages and Automata Theory.
615 24$aCompilers and Interpreters.
676   $a003
702   $aSeidl$b Helmut$4edt$4http://id.loc.gov/vocabulary/relators/edt
712 12$aETAPS 2007$f(2007 :$eBraga, Portugal)
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a996465929203316
996   $aFoundations of Software Science and Computational Structures$9772755
997   $aUNISA