Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
Abstract. We present a correctness proof for a basic file system implementation. This implementation contains key elements of standard Unix file systems such as inodes and fixed...
Konstantine Arkoudas, Karen Zee, Viktor Kuncak, Ma...
The verification of safety critical systems has become an area of increasing importance in computer science. The notion of reactive system has emerged to concentrate on problems r...
straction to Verify Arbitrary Temporal Properties Amir Pnueli New York University and Weizmann Institute of Sciences (Emeritus) Perspectives in Concurrency Theory, Chennai, 15 Dece...
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...