000 | 05201nam a22005895i 4500 | ||
---|---|---|---|
001 | 978-3-540-85762-4 | ||
003 | DE-He213 | ||
005 | 20240730200705.0 | ||
007 | cr nn 008mamaa | ||
008 | 100301s2008 gw | s |||| 0|eng d | ||
020 |
_a9783540857624 _9978-3-540-85762-4 |
||
024 | 7 |
_a10.1007/978-3-540-85762-4 _2doi |
|
050 | 4 | _aQA76.6-76.66 | |
072 | 7 |
_aUM _2bicssc |
|
072 | 7 |
_aCOM051000 _2bisacsh |
|
072 | 7 |
_aUM _2thema |
|
082 | 0 | 4 |
_a005.11 _223 |
245 | 1 | 0 |
_aTheoretical Aspects of Computing - ICTAC 2008 _h[electronic resource] : _b5th International Colloquium, Istanbul, Turkey, September 1-3, 2008, Proceedings / _cedited by John S. Fitzgerald, Anne E. Haxthausen, Husnu Yenigun. |
250 | _a1st ed. 2008. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2008. |
|
300 |
_aXI, 455 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 ; _v5160 |
|
505 | 0 | _aUsing Design Patterns in Formal Methods: An Event-B Approach -- A Unified Approach to Abstract Interpretation, Formal Verification and Testing of C/C++ Modules -- The Three Platonic Models of Divergence-Strict CSP -- Monotonic Abstraction in Action -- Non-interleaving Semantics with Causality for Nondeterministic Dataflow -- Symbolic Reachability for Process Algebras with Recursive Data Types -- Inclusion Test Algorithms for One-Unambiguous Regular Expressions -- Refinement of Kripke Models for Dynamics -- Tomorrow and All our Yesterdays: MTL Satisfiability over the Integers -- A Theory of Pointers for the UTP -- Recasting Constraint Automata into Büchi Automata -- A Complete Realisability Semantics for Intersection Types and Arbitrary Expansion Variables -- Towards Efficient Verification of Systems with Dynamic Process Creation -- An Observational Model for Transactional Calculus of Services Orchestration -- Everything Is PSPACE-Complete in Interaction Systems -- A New Approach for the Construction of Multiway Decision Graphs -- Congruence Results of Scope Equivalence for a Graph Rewriting Model of Concurrent Programs -- Guided Test Generation from CSP Models -- Relaxing Goodness Is Still Good -- Benchmarking Model- and Satisfiability-Checking on Bi-infinite Time -- Formal Analysis of Workflows Using UML 2.0 Activities and Graph Transformation Systems -- Testing Concurrent Objects with Application-Specific Schedulers -- A Theory of Bounded Fair Scheduling -- Fair Exchange Is Incomparable to Consensus -- Automatic Generation of CSP // B Skeletons from xUML Models -- Bounded Model Checking for Partial Kripke Structures -- Verification of Linear Duration Invariants by Model Checking CTL Properties -- Exact Response Time Scheduling Analysis of Accumulatively Monotonic Multiframe Real Time Tasks.-Endomorphisms for Non-trivial Non-linear Loop Invariant Generation -- Instantiation for Parameterised Boolean Equation Systems. | |
520 | _aThis book constitutes the refereed proceedings of the 5th International Colloquium on Theoretical Aspects of Computing, ICTAC 2008 held in Istanbul, Turkey in September 2008. The 27 revised full papers were carefully reviewed and selected from over 70 submissions. The aim of the colloquium is to bring together practitioners and researchers from academia, industry and government to present research results, and exchange experience, ideas, and solutions for their problems in theoretical aspects of computing such as automata theory and formal languages, principles and semantics of programming languages, software architectures and their description languages, software specification, refinement, and verification, model checking and theorem proving, real-time, embedded and hybrid systems, theory of parallel, distributed, and internet-based (grid) computing, simulation and modeling, and service-oriented development. | ||
650 | 0 |
_aComputer programming. _94169 |
|
650 | 0 |
_aSoftware engineering. _94138 |
|
650 | 0 |
_aComputer science. _99832 |
|
650 | 0 |
_aAlgorithms. _93390 |
|
650 | 1 | 4 |
_aProgramming Techniques. _9164415 |
650 | 2 | 4 |
_aSoftware Engineering. _94138 |
650 | 2 | 4 |
_aTheory of Computation. _9164416 |
650 | 2 | 4 |
_aAlgorithms. _93390 |
700 | 1 |
_aFitzgerald, John S. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9164417 |
|
700 | 1 |
_aHaxthausen, Anne E. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9164418 |
|
700 | 1 |
_aYenigun, Husnu. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9164419 |
|
710 | 2 |
_aSpringerLink (Online service) _9164420 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540857617 |
776 | 0 | 8 |
_iPrinted edition: _z9783540858140 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v5160 _9164421 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-540-85762-4 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c96182 _d96182 |