+612 9045 4394
 
CHECKOUT
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 - Kurt Jensen

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

By: Kurt Jensen (Editor), Andreas Podelski (Editor)

Paperback

Published: 18th March 2004
Ships: 5 to 9 business days
5 to 9 business days
$181.29
or 4 easy payments of $45.32 with Learn more

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.

Revisiting positive equalityp. 1
An interpolating theorem proverp. 16
Minimal assignments for bounded model checkingp. 31
Numerical vs. statistical probabilistic model checking : an empirical studyp. 46
Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processesp. 61
Model checking discounted temporal propertiesp. 77
Automatic creation of environment models via trainingp. 93
Error explanation with distance metricsp. 108
Online efficient predictive safety analysis of multithreaded programsp. 123
Vooduu : verification of object-oriented designs using UPPAALp. 139
CoPS - checker of persistent securityp. 144
Tampere verification toolp. 153
SyneGen : an aspect-oriented framework for synchronizationp. 158
MetaGame : an animation tool for model-checking gamesp. 163
A tool for checking ANSI-C programsp. 168
Obtaining memory-efficient reachability graph representations using the sweep-line methodp. 177
Automated generation of a progress measure for the sweep-line methodp. 192
Tarjan's algorithm makes on-the-fly LTL verification more efficientp. 205
Resource-optimal scheduling using priced timed automatap. 220
Decidable and undecidable problems in schedulability analysis using timed automatap. 236
The succinct solver suitep. 251
Binding-time analysis for MetaML via type inference and constraint solvingp. 266
A class of polynomially solvable range constraints for interval analysis without widenings and narrowingsp. 280
A partial order semantics approach to the clock explosion problem of timed automatap. 296
Lower and upper bounds in zone based abstractions of timed automatap. 312
A scalable incomplete test for the boundedness of UML RT modelsp. 327
Automatic verification of time sensitive cryptographic protocolsp. 342
Simulation-based verification of autonomous controllers via Livingstone PathFinderp. 357
Automatic parametric verification of a root contention protocol based on abstract state machines and first order timed logicp. 372
Refining approximations in software predicate abstractionp. 388
Checking strong specifications using an extensible software model checking frameworkp. 404
Applying game semantics to compositional software modeling and verificationp. 421
Solving disjunctive/conjunctive Boolean equation systems with alternating fixed pointsp. 436
How vacuous is vacuous?p. 451
A temporal logic of nested calls and returnsp. 467
Liveness with incomprehensible rankingp. 482
Guided invariant model checking based on abstraction and symbolic pattern databasesp. 497
Numeric domains with summarized dimensionsp. 512
Symbolically computing most-precise abstract operations for shape analysisp. 530
Monotonic abstraction-refinement for CTLp. 546
Omega-regular model checkingp. 561
FASTer acceleration of counter automata in practicep. 576
From complementation to certificationp. 591
Author indexp. 607
Table of Contents provided by Blackwell. All Rights Reserved.

ISBN: 9783540212997
ISBN-10: 354021299X
Series: Lecture Notes in Computer Science,
Audience: General
Format: Paperback
Language: English
Number Of Pages: 614
Published: 18th March 2004
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 3.23
Weight (kg): 0.87