Tools and Algorithms for the Construction and Analysis of Systems

1. Front Matter

   PDF

2. Invited Paper

   1. Applications of Craig Interpolants in Model Checking

      • K. L. McMillan

      Pages 1-12

3. Regular Model-Checking

   1. Verifying Programs with Dynamic 1-Selector-Linked Structures in Regular Model Checking

      • Ahmed Bouajjani, Peter Habermehl, Pierre Moro, Tomáš Vojnar

      Pages 13-29

   2. Simulation-Based Iteration of Tree Transducers

      • Parosh Aziz Abdulla, Axel Legay, Julien d’Orso, Ahmed Rezine

      Pages 30-44

   3. Using Language Inference to Verify Omega-Regular Properties

      • Abhay Vardhan, Koushik Sen, Mahesh Viswanathan, Gul Agha

      Pages 45-60

4. Infinite State Systems

   1. On-the-Fly Reachability and Cycle Detection for Recursive State Machines

      • Rajeev Alur, Swarat Chaudhuri, Kousha Etessami, P. Madhusudan

      Pages 61-76

   2. Empirically Efficient Verification for a Class of Infinite-State Systems

      • Jesse Bingham, Alan J. Hu

      Pages 77-92

   3. Context-Bounded Model Checking of Concurrent Software

      • Shaz Qadeer, Jakob Rehof

      Pages 93-107

   4. A Generic Theorem Prover of CSP Refinement

      • Yoshinao Isobe, Markus Roggenbach

      Pages 108-123

5. Abstract Interpretation

   1. Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems

      • Amir Pnueli, Andreas Podelski, Andrey Rybalchenko

      Pages 124-139

   2. An Abstract Interpretation-Based Refinement Algorithm for Strong Preservation

      • Francesco Ranzato, Francesco Tapparo

      Pages 140-156

   3. Dependent Types for Program Understanding

      • Raghavan Komondoor, G. Ramalingam, Satish Chandra, John Field

      Pages 157-173

6. Automata and Logics

   1. A Note on On-the-Fly Verification Algorithms

      • Stefan Schwoon, Javier Esparza

      Pages 174-190

   2. Truly On-the-Fly LTL Model Checking

      • Moritz Hammer, Alexander Knapp, Stephan Merz

      Pages 191-205

   3. Complementation Constructions for Nondeterministic Automata on Infinite Words

      • Orna Kupferman, Moshe Y. Vardi

      Pages 206-221

   4. Using BDDs to Decide CTL

      • Will Marrero

      Pages 222-236

7. Probabilistic Systems, Probabilistic Model-Checking

   1. Model Checking Infinite-State Markov Chains

      • Anne Remke, Boudewijn R. Haverkort, Lucia Cloth

      Pages 237-252

   2. Algorithmic Verification of Recursive Probabilistic State Machines

      • Kousha Etessami, Mihalis Yannakakis

      Pages 253-270

   3. Monte Carlo Model Checking

      • Radu Grosu, Scott A. Smolka

      Pages 271-286

8. Satisfiability

   1. Efficient Conflict Analysis for Finding All Satisfying Assignments of a Boolean Circuit

      • HoonSang Jin, HyoJung Han, Fabio Somenzi

      Pages 287-300

ETAPS 2005 was the eighth 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 conf- ences. This year it comprised ?ve conferences (CC, ESOP, FASE, FOSSACS, TACAS), 17 satellite workshops (AVIS, BYTECODE, CEES, CLASE, CMSB, COCV, FAC, FESCA, FINCO, GCW-DSE, GLPL, LDTA, QAPL, SC, SLAP, TGC, UITP), seven invited lectures (not including those that were speci?c to the satellite events), and several tutorials. We received over 550 submissions to the ?ve conferences this year, giving acceptance rates below 30% for each one. Congratulations to all the authors who made it to the ?nal program! I hope that most of the other authors still found a way of participating in this exciting event and I hope you will continue submitting. The events that comprise ETAPS address various aspects of the system - velopment process, including speci?cation, design, implementation, analysis and improvement. The languages, methodologies and tools which support these - tivities 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 s- tems,andtheemphasisonsoftwareisnotintendedtobeexclusive.

• Debugging
• Java
• Serial ATA
• Simulation
• algorithms
• automata
• logic
• program analysis
• programming
• systems analysis
• systems design
• systems development
• systems modeling
• systems specification
• systems verification
• algorithm analysis and problem complexity

• CNRS - VERIMAG, Gières, France

  Nicolas Halbwachs

• University of Illinois at Chicago,  

  Lenore D. Zuck

Policies and ethics