Skip to main navigation Skip to search Skip to main content

Deadlock and starvation free reentrant readers-writers: A case study combining model checking with theorem proving

  • Bernard van Gastel
  • , Leonard Lensink
  • , Sjaak Smetsers
  • , Marko van Eekelen*
  • *Corresponding author for this work

    Research output: Contribution to journal › Article › Academic › peer-review

    Original languageEnglish
    Pages (from-to)82-99
    Number of pages18
    Journal Science of Computer Programming
    Volume76
    Issue number2
    DOIs
    Publication statusPublished - 1 Feb 2011

    Keywords

    • Model checking
    • Theorem proving
    • Readers-writers algorithm
    • SPIN
    • PVS
    • VERIFICATION
    • JAVA

    Fingerprint

    Dive into the research topics of 'Deadlock and starvation free reentrant readers-writers: A case study combining model checking with theorem proving'. Together they form a unique fingerprint.

    Cite this