Skip to main content
SpringerLink
Log in

System Description Using OBDD’s for the Validationof Skolem Verification Conditions

  • Conference paper
  • First Online:
Automated Deduction — CADE-16 (CADE 1999)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1632))

Included in the following conference series:

Abstract

The verification conditions associated with concurrent systems and their invariants are usually instances of the VC-scheme, i.e.,

$$ \left( {\mathop \wedge \limits_{\iota = 1}^n h_i } \right) \Rightarrow c. $$

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H.R. Andersen, An Introduction to Binary Decision Diagrams, Available at http://andrea.it.dtu.dk/~hra/notes-index.html (1997, 1998.

  2. A. Borälv, The Industrial Success of Verification Tools Based on Stalmårck’s method, Lect. Notes in Comput. Sci. 1254 (1997) 7–10.

    Google Scholar 

  3. R.E. Bryant, Graph-based algorithms for Boolean function manipulation, IEEE Trans. on Computers C-35 (1986) 677–691.

    Article  Google Scholar 

  4. K.M. Chandy and J. Misra, Parallel Program Design: A Foundation (Addison-Wesley, Reading, MA, 1988).

    MATH  Google Scholar 

  5. E.P. Gribomont and D. Rossetto, CAVEAT: technique and tool for Computer Aided VErification And Transformation, Lect. Notes in Comput. Sci. 939 (1995) 70–83.

    Google Scholar 

  6. E.P. Gribomont and G. Zenner, Automated verification of Szymanski’s algorithm, Lect. Notes in Comput. Sci. 1384 (1998) 424–438.

    Article  Google Scholar 

  7. B. Szymanski and J. Vidal, Automatic Verification of a Class of Symmetric Parallel Programs, 13th IFIP World Computer Congress, IFIP-Elsevier (1994) 571–576.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut Montefiore, ULg, Sart-Tilman, B28, B - 4000, Liège, Belgium

    E. Pascal Gribomont & Nachaat Salloum

Authors
  1. E. Pascal Gribomont
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nachaat Salloum
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pascal Gribomont, E., Salloum, N. (1999). System Description Using OBDD’s for the Validationof Skolem Verification Conditions. In: Automated Deduction — CADE-16. CADE 1999. Lecture Notes in Computer Science(), vol 1632. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48660-7_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-48660-7_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66222-8

  • Online ISBN: 978-3-540-48660-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation