1 option
Tools and Algorithms for the Construction and Analysis of Systems : 10th 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 / edited by Kurt Jensen, Andreas Podelski.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 2988.
- Lecture Notes in Computer Science, 0302-9743 ; 2988
- Language:
- English
- Subjects (All):
- Software engineering.
- Computer logic.
- Computer networks.
- Algorithms.
- Software Engineering/Programming and Operating Systems.
- Logics and Meanings of Programs.
- Software Engineering.
- Computer Communication Networks.
- Algorithm Analysis and Problem Complexity.
- Local Subjects:
- Software Engineering/Programming and Operating Systems.
- Logics and Meanings of Programs.
- Software Engineering.
- Computer Communication Networks.
- Algorithm Analysis and Problem Complexity.
- Physical Description:
- 1 online resource (XIV, 614 pages).
- Edition:
- First edition 2004.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2004.
- System Details:
- text file PDF
- Summary:
- This 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.
- Contents:
- Theorem 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-24730-2
- 9783540247302
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.