Advertisement

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

  • Hubert Garavel
  • John Hatcliff
Conference proceedings TACAS 2003

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2619)

Table of contents

  1. Front Matter
    Pages I-XVI
    PDF

  2. Invited Contributions

    1. What Are We Trying to Prove? Reflections on Experiences with Proof-Carrying Code
      Peter Lee
      Pages 1-1
      PDF

  3. Bounded Model Checking and SAT-Based Methods

    1. Automatic Abstraction without Counterexamples
      Kenneth L. McMillan, Nina Amla
      Pages 2-17
      PDF
    2. Bounded Model Checking for Past LTL
      Marco Benedetti, Alessandro Cimatti
      Pages 18-33
      PDF
    3. Experimental Analysis of Different Techniques for Bounded Model Checking
      Nina Amla, Robert Kurshan, Kenneth L. McMillan, Ricardo Medel
      Pages 34-48
      PDF

  4. Mu-Calculus and Temporal Logics

    1. On the Universal and Existential Fragments of the μ-Calculus
      Thomas A. Henzinger, Orna Kupferman, Rupak Majumdar
      Pages 49-64
      PDF
    2. Resets vs. Aborts in Linear Temporal Logic
      Roy Armoni, Doron Bustan, Orna Kupferman, MosheY. Vardi
      Pages 65-80
      PDF
    3. A Generic On-the-Fly Solver for Alternation-Free Boolean Equation Systems
      Radu Mateescu
      Pages 81-96
      PDF

  5. Verification of Parameterized Systems

    1. Decidability of Invariant Validation for Paramaterized Systems
      Pascal Fontaine, E. Pascal Gribomont
      Pages 97-112
      PDF
    2. Verification and Improvement of the Sliding Window Protocol
      Dmitri Chkliaev, Jozef Hooman, Erik de Vink
      Pages 113-127
      PDF
    3. Simple Representative Instantiations for Multicast Protocols
      Javier Esparza, Monika Maidl
      Pages 128-143
      PDF
    4. Rapid Parameterized Model Checking of Snoopy Cache Coherence Protocols
      E. Allen Emerson, Vineet Kahlon
      Pages 144-159
      PDF

  6. Abstractions and Counter-Examples

    1. Proof-Like Counter-Examples
      Arie Gurfinkel, Marsha Chechik
      Pages 160-175
      PDF
    2. Multiple-Counterexample Guided Iterative Abstraction Refinement: An Industrial Evaluation
      Marcelo Glusman, Gila Kamhi, Sela Mador-Haim, Ranan Fraer, Moshe Y. Vardi
      Pages 176-191
      PDF
    3. Verification of Hybrid Systems Based on Counterexample-Guided Abstraction Refinement
      Edmund Clarke, Ansgar Fehnker, Zhi Han, Bruce Krogh, Olaf Stursberg, Michael Theobald
      Pages 192-207
      PDF
    4. Counter-Example Guided Predicate Abstraction of Hybrid Systems
      Rajeev Alur, Thao Dang, Franjo Ivančić1
      Pages 208-223
      PDF

  7. Real-Time and Scheduling

    1. Schedulability Analysis Using Two Clocks
      Elena Fersman, Leonid Mokrushin, Paul Pettersson, Wang Yi
      Pages 224-239
      PDF
    2. On Optimal Scheduling under Uncertainty
      Yasmina Abdeddaïm, Eugene Asarin, Oded Maler
      Pages 240-253
      PDF
    3. Static Guard Analysis in Timed Automata Verification
      Gerd Behrmann, Patricia Bouyer, Emmanuel Fleury, Kim G. Larsen
      Pages 254-270
      PDF
    4. Moby/DC – A Tool for Model-Checking Parametric Real-Time Specifications
      Henning Dierks, Josef Tapken
      Pages 271-277
      PDF
    5. √erics: A Tool for Verifying Timed Automata and Estelle Specifications
      Piotr Dembiński, Agata Janowska, Paweł Janowski, Wojciech Penczek, Agata Półrola, Maciej Szreter et al.
      Pages 278-283
      PDF

  8. Security and Cryptography

    1. A New Knowledge Representation Strategy for Cryptographic Protocol Analysis
      Ivan Cibrario B., Luca Durante, Riccardo Sisto, Adriano Valenzano
      Pages 284-298
      PDF
    2. Pattern-Based Abstraction for Verifying Secrecy in Protocols
      Liana Bozga, Yassine Lakhnech, Michael Périn
      Pages 299-314
      PDF

  9. Modules and Compositional Verification

    1. Compositional Analysis for Verification of Parameterized Systems
      Samik Basu, C. R. Ramakrishnan
      Pages 315-330
      PDF
    2. Learning Assumptions for Compositional Verification
      Jamieson M. Cobleigh, Dimitra Giannakopoulou, Corina S. PĂsĂreanu
      Pages 331-346
      PDF
    3. Automated Module Composition
      Stavros Tripakis
      Pages 347-362
      PDF
    4. Modular Strategies for Recursive Game Graphs
      Rajeev Alur, Salvatore La Torre, Parthasarathy Madhusudan
      Pages 363-378
      PDF

  10. Symbolic State Spaces and Decision Diagrams

    1. Saturation Unbound
      Gianfranco Ciardo, Robert Marmorstein, Radu Siminiceanu
      Pages 379-393
      PDF
    2. Construction of Efficient BDDs for Bounded Arithmetic Constraints
      Constantinos Bartzis, Tevfik Bultan
      Pages 394-408
      PDF

  11. Performance and Mobility

    1. Modeling and Analysis of Power-Aware Systems
      Oleg Sokolsky, Anna Philippou, Insup Lee, Kyriakos Christou
      Pages 409-424
      PDF
    2. A Set of Performance and Dependability Analysis Components for CADP
      Holger Hermanns, Christophe Joubert
      Pages 425-430
      PDF
    3. The Integrated CWB-NC/PIOATool for Functional Verification and Performance Analysis of Concurrent Systems
      Dezhuang Zhang, Rance Cleaveland, Eugene W. Stark
      Pages 431-436
      PDF
    4. Banana - A Tool for Boundary Ambients Nesting ANAlysis
      Chiara Braghin, Agostino Cortesi, Stefano Filippone, Riccardo Focardi, Flaminia L. Luccio, Carla Piazza
      Pages 437-441
      PDF

  12. State Space Reductions

    1. State Class Constructions for Branching Analysis of Time Petri Nets
      Bernard Berthomieu, François Vernadat
      Pages 442-457
      PDF
    2. Branching Processes of High-Level Petri Nets
      Victor Khomenko, Maciej Koutny
      Pages 458-472
      PDF
    3. Using Petri Net Invariants in State Space Construction
      Karsten Schmidt
      Pages 473-488
      PDF
    4. Optimistic Synchronization-Based State-Space Reduction
      Scott D. Stoller, Ernie Cohen
      Pages 489-504
      PDF

  13. Constraint-Solving and Decision Procedures

    1. Checking Properties of Heap-Manipulating Procedures with a Constraint Solver
      Mandana Vaziri, Daniel Jackson
      Pages 505-520
      PDF
    2. An Online Proof-Producing Decision Procedure for Mixed-Integer Linear Arithmetic
      Sergey Berezin, Vijay Ganesh, David L. Dill
      Pages 521-536
      PDF
    3. Strategies for Combining Decision Procedures
      Sylvain Conchon, Sava Krstić
      Pages 537-552
      PDF

  14. Testing and Verification

    1. Generalized Symbolic Execution for Model Checking and Testing
      Sarfraz Khurshid, Corina S. PĂsĂreanu, Willem Visser
      Pages 553-568
      PDF
    2. Code-Based Test Generation for Validation of Functional Processor Descriptions
      Fabrice Baray, Philippe Codognet, Daniel Diaz, Henri Michel
      Pages 569-584
      PDF
    3. Large State Space Visualization
      Jan Friso Groote, Frank van Ham
      Pages 585-590
      PDF
    4. Automatic Test Generation with AGATHA
      Céline Bigot, Alain Faivre, Jean-Pierre Gallois, Arnault Lapitre, David Lugato, Jean-Yves Pierron et al.
      Pages 591-596
      PDF
    5. LTSA-MSC: Tool Support for Behaviour Model Elaboration Using Implied Scenarios
      Sebastian Uchitel, Robert Chatley, Jeff Kramer, Jeff Magee
      Pages 597-601
      PDF
  15. Back Matter
    Pages 603-604
    PDF

About these proceedings

Keywords

development tools formal methods formal specification model checking program semantics programming theory software testing structured analysis systems analysis systems design systems development systems verification testing verification verification tools

Editors and affiliations

  • Hubert Garavel
    • 1
  • John Hatcliff
    • 2
  1. 1.INRIA Rhône-AlpesMontbonnot Saint MartinFrance
  2. 2.Department of Computing and Information SciencesKansas State UniversityManhattanUSA

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-36577-X
  • Copyright Information Springer-Verlag Berlin Heidelberg 2003
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-00898-9
  • Online ISBN 978-3-540-36577-8
  • Series Print ISSN 0302-9743
  • Buy this book on publisher's site