Tools and Algorithms for the Construction and Analysis of Systems

1. Front Matter

   PDF

2. Invited Contributions

   1. Weighted Pushdown Systems and Trust-Management Systems

      • Somesh Jha, Stefan Schwoon, Hao Wang, Thomas Reps

      Pages 1-26

3. Parametrization and Slicing

   1. Automatic Verification of Parameterized Data Structures

      • Jyotirmoy V. Deshmukh, E. Allen Emerson, Prateek Gupta

      Pages 27-41

   2. Parameterized Verification of π-Calculus Systems

      • Ping Yang, Samik Basu, C. R. Ramakrishnan

      Pages 42-57

   3. Easy Parameterized Verification of Biphase Mark and 8N1 Protocols

      • Geoffrey M. Brown, Lee Pike

      Pages 58-72

   4. Evaluating the Effectiveness of Slicing for Model Reduction of Concurrent Object-Oriented Programs

      • Matthew B. Dwyer, John Hatcliff, Matthew Hoosier, Venkatesh Ranganath, Robby, Todd Wallentine

      Pages 73-89

4. Symbolic Techniques

   1. New Metrics for Static Variable Ordering in Decision Diagrams

      • Radu I. Siminiceanu, Gianfranco Ciardo

      Pages 90-104

   2. Widening ROBDDs with Prime Implicants

      • Neil Kettle, Andy King, Tadeusz Strzemecki

      Pages 105-119

   3. Efficient Guided Symbolic Reachability Using Reachability Expressions

      • Dina Thomas, Supratik Chakraborty, Paritosh Pandya

      Pages 120-134

5. Satisfiability

   1. SDSAT: Tight Integration of Small Domain Encoding and Lazy Approaches in a Separation Logic Solver

      • Malay K Ganai, Muralidhar Talupur, Aarti Gupta

      Pages 135-150

   2. SAT-Based Software Certification

      • Sagar Chaki

      Pages 151-166

   3. Expressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof Assistants

      • Pascal Fontaine, Jean-Yves Marion, Stephan Merz, Leonor Prensa Nieto, Alwen Tiu

      Pages 167-181

   4. Exploration of the Capabilities of Constraint Programming for Software Verification

      • Hélène Collavizza, Michel Rueher

      Pages 182-196

6. Abstraction

   1. Counterexample-Guided Abstraction Refinement for the Analysis of Graph Transformation Systems

      • Barbara König, Vitali Kozioura

      Pages 197-211

   2. Why Waste a Perfectly Good Abstraction?

      • Arie Gurfinkel, Marsha Chechik

      Pages 212-226

   3. Efficient Abstraction Refinement in Interpolation-Based Unbounded Model Checking

      • Bing Li, Fabio Somenzi

      Pages 227-241

   4. Approximating Predicate Images for Bit-Vector Logic

      • Daniel Kroening, Natasha Sharygina

      Pages 242-256

7. Model Checking Algorithms

   1. Finitary Winning in ω-Regular Games

      • Krishnendu Chatterjee, Thomas A. Henzinger

      Pages 257-271

   2. Efficient Model Checking for LTL with Partial Order Snapshots

      • Peter Niebert, Doron Peled

      Pages 272-286

   3. A Local Shape Analysis Based on Separation Logic

      • Dino Distefano, Peter W. O’Hearn, Hongseok Yang

      Pages 287-302

ETAPS 2006 was the ninth instance of the European Joint Conferences on Theory and Practice of Software. ETAPS is an annual federated conference that was established in 1998 by combining a number of existing and new conferences. This year it comprised ?ve conferences (CC, ESOP, FASE, FOSSACS, TACAS), 18 satellite workshops (AC- CAT, AVIS, CMCS, COCV, DCC, EAAI, FESCA, FRCSS, GT-VMT, LDTA, MBT, QAPL, SC, SLAP, SPIN, TERMGRAPH, WITS and WRLA), two tutorials, and seven invited lectures (not including those that were speci?c to the satellite events). We - ceived over 550 submissions to the ?ve conferences this year, giving an overall acc- tance rate of 23%, with acceptance rates below 30% for each conference. Congratu- tions to all the authors who made it to the ?nal programme! I hope that most of the other authorsstill founda way of participatingin this excitingevent and I hope you will continue submitting. The events that comprise ETAPS address various aspects of the system devel- ment process, including speci?cation, design, implementation, analysis and impro- ment. The languages, methodologies and tools which support these activities are all well within its scope. Di?erent blends of theory and practice are represented, with an inclination towards theory with a practical motivation on the one hand and soundly based practice on the other. Many of the issues involved in software design apply to systems in general, including hardware systems, and the emphasis on software is not intended to be exclusive.

• Variable
• abstraction
• algorithm
• algorithms
• automata
• data structure
• logic
• model checking
• object oriented design
• program analysis
• programming
• programming theory
• systems development
• systems modeling
• systems verification
• algorithm analysis and problem complexity

• INRIA, VASY, Grenoble Rhône-Alpes, France

  Holger Hermanns

• Department of Computer Science, University of California, Los Angeles, USA

  Jens Palsberg

Policies and ethics