Tools and Algorithms for the Construction and Analysis of Systems: 9th International Conference, TACAS 2003, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003, Warsaw, Poland, April 7-11, 2003, Proceedings

by Hubert Garavel (Editor), John Hatcliff (Editor)

Overview

ETAPS 2003 was the sixth instance of the European Joint Conferences on T- ory and Practice of Software. ETAPS is an annual federated conference that was establishedin1998bycombininganumberofexistingandnewconferences.This yearitcomprised?veconferences(FOSSACS, FASE, ESOP, CC, TACAS),14- tellite workshops (AVIS, CMCS, COCV, FAMAS, Feyerabend, FICS, LDTA, RSKD, SC, TACoS, UniGra, USE, WITS and WOOD), eight invited lectures (not including those that are speci?c to the satellite events), and several tu- rials. We received a record number of submissions to the ?ve conferences this year: over 500, making acceptance rates fall below 30% for every one of them. Congratulations to all the authors who made it to the ?nal program! I hope that all the other authors still found a way of participating in this exciting event and I hope you will continue submitting. A special event was held to honour the 65th birthday of Prof. Wlad Turski, one of the pioneers of our young science. The deaths of some of our "fathers" in thesummerof2002-Dahl, DijkstraandNygaard-remindedusthatSoftware Science and Technology is, perhaps, no longer that young. Against this sobering background, it is a treat to celebrate one of our most prominent scientists and his lifetime of achievements. It gives me particular personal pleasure that we are able to do this for Wlad during my term as chairman of ETAPS.

Product Details

ISBN-13:	9783540008989
Publisher:	Springer Berlin Heidelberg
Publication date:	05/07/2003
Series:	Lecture Notes in Computer Science , #2619
Edition description:	2003
Pages:	604
Product dimensions:	6.10(w) x 9.17(h) x 0.05(d)

Table of Contents

Invited Contributions.- What Are We Trying to Prove? Reflections on Experiences with Proof-Carrying Code.- Bounded Model Checking and SAT-Based Methods.- Automatic Abstraction without Counterexamples.- Bounded Model Checking for Past LTL.- Experimental Analysis of Different Techniques for Bounded Model Checking.- Mu-Calculus and Temporal Logics.- On the Universal and Existential Fragments of the—-Calculus.- Resets vs. Aborts in Linear Temporal Logic.- A Generic On-the-Fly Solver for Alternation-Free Boolean Equation Systems.- Verification of Parameterized Systems.- Decidability of Invariant Validation for Paramaterized Systems.- Verification and Improvement of the Sliding Window Prool.- Simple Representative Instantiations for Multicast Prools.- Rapid Parameterized Model Checking of Snoopy Cache Coherence Prools.- Abstractions and Counter-Examples.- Proof-Like Counter-Examples.- Multiple-Counterexample Guided Iterative Abstraction Refinement: An Industrial Evaluation.- Verification of Hybrid Systems Based on Counterexample-Guided Abstraction Refinement.- Counter-Example Guided Predicate Abstraction of Hybrid Systems.- Real-Time and Scheduling.- Schedulability Analysis Using Two Clocks.- On Optimal Scheduling under Uncertainty.- Static Guard Analysis in Timed Automata Verification.- Moby/DC – A Tool for Model-Checking Parametric Real-Time Specifications.-—erics: A Tool for Verifying Timed Automata and Estelle Specifications.- Security and Cryptography.- A New Knowledge Representation Strategy for Cryptographic Prool Analysis.- Pattern-Based Abstraction for Verifying Secrecy in Prools.- Modules and Compositional Verification.- Compositional Analysis for Verification of Parameterized Systems.- Learning Assumptions for Compositional Verification.-Automated Module Composition.- Modular Strategies for Recursive Game Graphs.- Symbolic State Spaces and Decision Diagrams.- Saturation Unbound.- Construction of Efficient BDDs for Bounded Arithmetic Constraints.- Performance and Mobility.- Modeling and Analysis of Power-Aware Systems.- A Set of Performance and Dependability Analysis Components for CADP.- The Integrated CWB-NC/PIOATool for Functional Verification and Performance Analysis of Concurrent Systems.- Banana - A Tool for Boundary Ambients Nesting ANAlysis.- State Space Reductions.- State Class Constructions for Branching Analysis of Time Petri Nets.- Branching Processes of High-Level Petri Nets.- Using Petri Net Invariants in State Space Construction.- Optimistic Synchronization-Based State-Space Reduction.- Constraint-Solving and Decision Procedures.- Checking Properties of Heap-Manipulating Procedures with a Constraint Solver.- An Online Proof-Producing Decision Procedure for Mixed-Integer Linear Arithmetic.- Strategies for Combining Decision Procedures.- Testing and Verification.- Generalized Symbolic Execution for Model Checking and Testing.- Code-Based Test Generation for Validation of Functional Processor Descriptions.- Large State Space Visualization.- Automatic Test Generation with AGATHA.- LTSA-MSC: Tool Support for Behaviour Model Elaboration Using Implied Scenarios.