| 000 | 03799nam a22005655i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-71389-0 | ||
| 003 | DE-He213 | ||
| 005 | 20240730183621.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 100301s2007 gw | s |||| 0|eng d | ||
| 020 |
_a9783540713890 _9978-3-540-71389-0 |
||
| 024 | 7 |
_a10.1007/978-3-540-71389-0 _2doi |
|
| 050 | 4 | _aQA76.758 | |
| 072 | 7 |
_aUMZ _2bicssc |
|
| 072 | 7 |
_aCOM051230 _2bisacsh |
|
| 072 | 7 |
_aUMZ _2thema |
|
| 082 | 0 | 4 |
_a005.1 _223 |
| 245 | 1 | 0 |
_aFoundations of Software Science and Computational Structures _h[electronic resource] : _b10th 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 / _cedited by Helmut Seidl. |
| 250 | _a1st ed. 2007. | ||
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2007. |
|
| 300 |
_aXVI, 379 p. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v4423 |
|
| 505 | 0 | _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. | |
| 650 | 0 |
_aSoftware engineering. _94138 |
|
| 650 | 0 |
_aComputer science. _99832 |
|
| 650 | 0 |
_aMachine theory. _9132774 |
|
| 650 | 0 |
_aCompilers (Computer programs). _93350 |
|
| 650 | 1 | 4 |
_aSoftware Engineering. _94138 |
| 650 | 2 | 4 |
_aTheory of Computation. _9132775 |
| 650 | 2 | 4 |
_aComputer Science Logic and Foundations of Programming. _942203 |
| 650 | 2 | 4 |
_aFormal Languages and Automata Theory. _9132776 |
| 650 | 2 | 4 |
_aCompilers and Interpreters. _931853 |
| 700 | 1 |
_aSeidl, Helmut. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9132777 |
|
| 710 | 2 |
_aSpringerLink (Online service) _9132778 |
|
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540713883 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540836414 |
| 830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v4423 _9132779 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-540-71389-0 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 942 | _cELN | ||
| 999 |
_c91958 _d91958 |
||