LEADER 07717nam 22007695 450 001 996465527703316 005 20200630141938.0 010 $a1-280-30802-8 010 $a9786610308026 010 $a3-540-24730-0 024 7 $a10.1007/b96393 035 $a(CKB)1000000000212340 035 $a(SSID)ssj0000260079 035 $a(PQKBManifestationID)11235303 035 $a(PQKBTitleCode)TC0000260079 035 $a(PQKBWorkID)10191929 035 $a(PQKB)10765765 035 $a(DE-He213)978-3-540-24730-2 035 $a(MiAaPQ)EBC3087789 035 $a(PPN)155202758 035 $a(EXLCZ)991000000000212340 100 $a20121227d2004 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aTools and Algorithms for the Construction and Analysis of Systems$b[electronic resource] $e10th International Conference, TACAS 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29 - April 2, 2004, Proceedings /$fedited by Kurt Jensen, Andreas Podelski 205 $a1st ed. 2004. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2004. 215 $a1 online resource (XIV, 614 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2988 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-21299-X 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aTheorem Proving -- Revisiting Positive Equality -- An Interpolating Theorem Prover -- Minimal Assignments for Bounded Model Checking -- Probabilistic Model Checking -- Numerical vs. Statistical Probabilistic Model Checking: An Empirical Study -- Efficient Computation of Time-Bounded Reachability Probabilities in Uniform Continuous-Time Markov Decision Processes -- Model Checking Discounted Temporal Properties -- Testing -- Automatic Creation of Environment Models via Training -- Error Explanation with Distance Metrics -- Online Efficient Predictive Safety Analysis of Multithreaded Programs -- Tools -- Vooduu: Verification of Object-Oriented Designs Using UPPAAL -- CoPS ? Checker of Persistent Security -- Tampere Verification Tool -- SyncGen: An Aspect-Oriented Framework for Synchronization -- MetaGame: An Animation Tool for Model-Checking Games -- A Tool for Checking ANSI-C Programs -- Explicite State/Petri Nets -- Obtaining Memory-Efficient Reachability Graph Representations Using the Sweep-Line Method -- Automated Generation of a Progress Measure for the Sweep-Line Method -- Tarjan?s Algorithm Makes On-the-Fly LTL Verification More Efficient -- Scheduling -- Resource-Optimal Scheduling Using Priced Timed Automata -- Decidable and Undecidable Problems in Schedulability Analysis Using Timed Automata -- Constraint Solving -- The Succinct Solver Suite -- Binding-Time Analysis for MetaML via Type Inference and Constraint Solving -- A Class of Polynomially Solvable Range Constraints for Interval Analysis without Widenings and Narrowings -- Timed Systems -- A Partial Order Semantics Approach to the Clock Explosion Problem of Timed Automata -- Lower and Upper Bounds in Zone Based Abstractions of Timed Automata -- A Scalable Incomplete Test for the Boundedness of UML RT Models -- Automatic Verification of Time Sensitive Cryptographic Protocols -- Case Studies -- Simulation-Based Verification of Autonomous Controllers via Livingstone PathFinder -- Automatic Parametric Verification of a Root Contention Protocol Based on Abstract State Machines and First Order Timed Logic -- Software -- Refining Approximations in Software Predicate Abstraction -- Checking Strong Specifications Using an Extensible Software Model Checking Framework -- Applying Game Semantics to Compositional Software Modeling and Verification -- Temporal Logic -- Solving Disjunctive/Conjunctive Boolean Equation Systems with Alternating Fixed Points -- How Vacuous Is Vacuous? -- A Temporal Logic of Nested Calls and Returns -- Liveness with Incomprehensible Ranking -- Abstraction -- Guided Invariant Model Checking Based on Abstraction and Symbolic Pattern Databases -- Numeric Domains with Summarized Dimensions -- Symbolically Computing Most-Precise Abstract Operations for Shape Analysis -- Monotonic Abstraction-Refinement for CTL -- Automata Techniques -- Omega-Regular Model Checking -- FASTer Acceleration of Counter Automata in Practice -- From Complementation to Certification. 330 $aThis volume contains the proceedings of the 10th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2004). TACAS 2004 took place in Barcelona, Spain, from March 29th to April 2nd, as part of the 7th European Joint Conferences on Theory and Practice of Software (ETAPS 2004), whose aims, organization, and history are detailed in a foreword by the ETAPS Steering Committee Chair, Josī e Luiz Fiadeiro. TACAS is a forum for researchers, developers, and users interested in ri- rously based tools for the construction and analysis of systems. The conference serves to bridge the gaps between di?erent communities including, but not - mited to, those devoted to formal methods, software and hardware veri?cation, static analysis, programming languages, software engineering, real-time systems, and communication protocols that share common interests in, and techniques for, tool development. In particular, by providing a venue for the discussion of common problems, heuristics, algorithms, data structures, and methodologies, TACAS aims to support researchers in their quest to improve the utility, rel- bility, ?exibility, and e?ciency of tools for building systems. TACASseekstheoreticalpaperswithaclearlinktotoolconstruction,papers describingrelevantalgorithmsandpracticalaspectsoftheirimplementation,- pers giving descriptions of tools and associated methodologies, and case studies with a conceptual message. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2988 606 $aSoftware engineering 606 $aComputer logic 606 $aComputer communication systems 606 $aAlgorithms 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aSoftware Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/I14029 606 $aComputer Communication Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/I13022 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 615 0$aSoftware engineering. 615 0$aComputer logic. 615 0$aComputer communication systems. 615 0$aAlgorithms. 615 14$aSoftware Engineering/Programming and Operating Systems. 615 24$aLogics and Meanings of Programs. 615 24$aSoftware Engineering. 615 24$aComputer Communication Networks. 615 24$aAlgorithm Analysis and Problem Complexity. 676 $a005.1/2 702 $aJensen$b Kurt$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aPodelski$b Andreas$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aTACAS 2004 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465527703316 996 $aTools and Algorithms for the Construction and Analysis of Systems$9772021 997 $aUNISA