000 | 06580nam a22005775i 4500 | ||
---|---|---|---|
001 | 978-3-642-36742-7 | ||
003 | DE-He213 | ||
005 | 20240730181834.0 | ||
007 | cr nn 008mamaa | ||
008 | 130220s2013 gw | s |||| 0|eng d | ||
020 |
_a9783642367427 _9978-3-642-36742-7 |
||
024 | 7 |
_a10.1007/978-3-642-36742-7 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYA _2thema |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aTools and Algorithms for the Construction and Analysis of Systems _h[electronic resource] : _b19th International Conference, TACAS 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013, Proceedings / _cedited by Nir Piterman, Scott Smolka. |
250 | _a1st ed. 2013. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2013. |
|
300 |
_aXXIV, 646 p. 137 illus. _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 ; _v7795 |
|
505 | 0 | _aOn-the-Fly Exact Computation of Bisimilarity Distances -- The Quest for Minimal Quotients for Probabilistic Automata -- LTL Model Checking of Interval Markov Chains -- Ramsey vs. Lexicographic Termination Proving -- Structural Counter Abstraction -- Extending Quantifier Elimination to Linear Inequalities on Bit-Vectors -- The MathSAT5 SMT Solver -- Formula Preprocessing in MUS Extraction -- Proof Tree Preserving Interpolation -- Asynchronous Multi-core Incremental SAT Solving -- Model-Checking Iterated Games -- PRISM-games: A Model Checker for Stochastic Multi-Player Games -- PIC2LNT: Model Transformation for Model Checking an Applied Pi-Calculus -- An Overview of the mCRL2 Toolset and Its Recent Advances -- Analysis of Boolean Programs -- Weighted Pushdown Systems with Indexed Weight Domains -- Underapproximation of Procedure Summaries for Integer Programs -- Runtime Verification Based on Register Automata -- Unbounded Model-Checking with Interpolation for Regular Language Constraints -- eVolCheck: Incremental Upgrade Checker for C -- Intertwined Forward-Backward Reachability Analysis Using Interpolants -- An Integrated Specification and Verification Technique or Highly Concurrent Data Structures -- A Verification-Based Approach to Memory Fence Insertion in PSO Memory Systems -- Identifying Dynamic Data Structures by Learning Evolving Patterns in Memory -- Synthesis of Circular Compositional Program Proofs via Abduction -- As Soon as Probable: Optimal Scheduling under Stochastic Uncertainty -- Integer Parameter Synthesis for Timed Automata -- LTL Model-Checking for Malware Detection -- Policy Analysis for Self-administrated Role-Based Access Control -- Model Checking Agent Knowledge in Dynamic Access Control Policies -- Frontiers (Graphics and Quantum) Automatic Testing of Real-Time Graphics Systems -- Equivalence Checking of Quantum Protocols -- Encoding Monomorphic and Polymorphic Types -- Deriving Probability Density Functions from Probabilistic Functional Programs -- Tool Demonstrations Polyglot: Systematic Analysis for Multiple Statechart Formalisms -- Memorax, a Precise and Sound Tool for Automatic Fence Insertion under TSO -- BULL: A Library for Learning Algorithms of Boolean Functions -- AppGuard - Enforcing User Requirements on Android Apps -- Model Checking Database Applications -- Efficient Property Preservation Checking of Model Refinements -- Strength-Based Decomposition of the Property Büchi Automaton for Faster Model Checking -- Competition on Software Verification Second Competition on Software Verification (Summary of SV-COMP 2013) -- CPAchecker with Explicit-Value Analysis Based on CEGAR and Interpolation (Competition Contribution) -- CPAchecker with Sequential Combination of Explicit-State Analysis and Predicate Analysis (Competition Contribution) -- CSeq: A Sequentialization Tool for C (Competition Contribution) -- Handling Unbounded Loops with ESBMC 1.20 (Competition Contribution) -- LLBMC: Improved Bounded Model Checking of C Programs Using LLVM (Competition Contribution) -- Predator: A Tool for Verification of Low-Level List Manipulation (Competition Contribution) -- Symbiotic: Synergy of Instrumentation, Slicing, and Symbolic Execution (Competition Contribution) -- Threader: A Verifier for Multi-threaded Programs (Competition Contribution) -- UFO: Verification with Interpolants and Abstract Interpretation (Competition Contribution) -- Ultimate Automizer with SMTInterpol (Competition Contribution). | |
520 | _aThis book constitutes the proceedings of the 19th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2013, held in Rome, Italy, in March 2013. The 42 papers presented in this volume were carefully reviewed and selected from 172 submissions. They are organized in topical sections named: Markov chains; termination; SAT/SMT; games and synthesis; process algebra; pushdown; runtime verification and model checking; concurrency; learning and abduction; timed automata; security and access control; frontiers (graphics and quantum); functional programs and types; tool demonstrations; explicit-state model checking; Büchi automata; and competition on software verification. | ||
650 | 0 |
_aComputer science. _99832 |
|
650 | 0 |
_aSoftware engineering. _94138 |
|
650 | 0 |
_aAlgorithms. _93390 |
|
650 | 0 |
_aCompilers (Computer programs). _93350 |
|
650 | 1 | 4 |
_aComputer Science Logic and Foundations of Programming. _942203 |
650 | 2 | 4 |
_aSoftware Engineering. _94138 |
650 | 2 | 4 |
_aAlgorithms. _93390 |
650 | 2 | 4 |
_aCompilers and Interpreters. _931853 |
700 | 1 |
_aPiterman, Nir. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9126341 |
|
700 | 1 |
_aSmolka, Scott. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9126342 |
|
710 | 2 |
_aSpringerLink (Online service) _9126343 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783642367410 |
776 | 0 | 8 |
_iPrinted edition: _z9783642367434 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v7795 _9126344 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-642-36742-7 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c91100 _d91100 |