Advertisement

Table of contents

  1. Front Matter
  2. G. Berthelot, C. Johnen, L. Petrucci
    Pages 13-22
  3. Olivier Coudert, Jean Christophe Madre, Christian Berthet
    Pages 23-32
  4. Randal E. Bryant, Carl-Johan H. Seger
    Pages 33-43
  5. Hiromi Hiraishi, Shintaro Meki, Kiyoharu Hamaguchi
    Pages 44-53
  6. Valérie Roy, Robert de Simone
    Pages 65-75
  7. Hiroshi Nakamura, Yuji Kukimoto, Masahiro Fujita, Hidehiko Tanaka
    Pages 76-85
  8. P. Camurati, M. Gilli, P. Prinetto, M. Sonza Reorda
    Pages 86-95
  9. Jean Christopeh Lloret, Pierre Azéma, François Vernadat
    Pages 96-105
  10. Linda Ness
    Pages 106-115
  11. R. Lai, K. R. Parker, T. S. Dillon
    Pages 126-135
  12. E. Allen Emerson, A. K. Mok, A. P. Sistla, Jai Srinivasan
    Pages 136-145
  13. Antti Valmari
    Pages 156-165
  14. Ryszard Janicki, Maciej Koutny
    Pages 166-175
  15. Susanne Graf, Bernhard Steffen
    Pages 186-196
  16. A. Bouajjani, J-C. Fernandez, N. Halbwachs
    Pages 197-203
  17. Gil Shurek, Orna Grumberg
    Pages 214-223
  18. C. Courcoubetis, M. Vardi, P. Wolper, M. Yannakakis
    Pages 233-242
  19. Kiyoharu Hamaguchi, Hiromi Hiraishi, Shuzo Yajima
    Pages 253-262
  20. Victor Yodaiken
    Pages 263-271
  21. Howard Wong-Toi, David L. Dill
    Pages 272-281
  22. C. H. Golaszewski, R. P. Kurshan
    Pages 282-291
  23. D. A. Carrington, K. A. Robinson
    Pages 312-321
  24. Michel Barbeau, Gregor V. Bochmann
    Pages 333-342
  25. Mark B. Josephs, Jan Tijmen Udding
    Pages 343-352
  26. Back Matter

About these proceedings

Introduction

This volume contains the proceedings of the second workshop on Computer Aided Verification, held at DIMACS, Rutgers University, June 18-21, 1990. Itfeatures theoretical results that lead to new or more powerful verification methods. Among these are advances in the use of binary decision diagrams, dense time, reductions based upon partial order representations and proof-checking in controller verification. The motivation for holding a workshop on computer aided verification was to bring together work on effective algorithms or methodologies for formal verification - as distinguished, say,from attributes of logics or formal languages. The considerable interest generated by the first workshop, held in Grenoble, June 1989 (see LNCS 407), prompted this second meeting. The general focus of this volume is on the problem of making formal verification feasible for various models of computation. Specific emphasis is on models associated with distributed programs, protocols, and digital circuits. The general test of algorithm feasibility is to embed it into a verification tool, and exercise that tool on realistic examples: the workshop included sessionsfor the demonstration of new verification tools.

Keywords

Algorithms Attribut Session algorithm computer formal language formal languages formal verification tools verification

Bibliographic information

  • DOI https://doi.org/10.1007/BFb0023712
  • Copyright Information Springer-Verlag Berlin Heidelberg 1991
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-54477-7
  • Online ISBN 978-3-540-38394-9
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Telecommunications
Oil, Gas & Geosciences