Add to ORKGThis is a presentation of the application of the theorem prover NQTHM of Boyer and Moore to correctness proofs of imperative programs in the style of programming methodology. Predicates and programs are represented syntactically. The interpretation is based on NQTHM's interpreter eval$. A library is constructed for the interpretation and proofs on while-programs, possibly with array modification. Linear search and a regrouping algorithm for arrays are provided as examples.
Abstract. We present a Coq library about Kleene algebra with tests, including a proof of their compl...
AbstractThe so-called Boyer-Moore Theorem Prover (otherwise known as Nqthm) has been used to perform...
We are interested in identifying and enforcing the isolation requirements ofa concurrent program, i....
This is a presentation of the application of the theorem prover NQTHM of Boyer and Moore to correctn...
For convenient application of a first-order theorem prover to verification of imperative programs, i...
Computer programs are an indispensable part of many of the systems we rely upon in our daily lives, ...
The process of program extraction is primarily associated with functional programs with less focus o...
We present a technique for the mechanical proof of correctness properties of programs. We define a l...
The jump instruction is considered essential for an adequate theoretical understanding of imperative...
. We have formally specified a substantial subset of the MC68020, a widely used microprocessor built...
AbstractIn this paper, the relation between WHILE-programs and formal proofs of their quantified spe...
Computability theory is at the heart of theoretical computer science. Yet, ironically, many of its b...
Programs are like constructive proofs of their specifications. This analogy is a precise equivalenc...
We present a method for verifying properties of imperative programs that manipulate integer arrays. ...
We argue that the naive use of the imperative style of working witharrays in a declarative setting l...
Abstract. We present a Coq library about Kleene algebra with tests, including a proof of their compl...
AbstractThe so-called Boyer-Moore Theorem Prover (otherwise known as Nqthm) has been used to perform...
We are interested in identifying and enforcing the isolation requirements ofa concurrent program, i....
This is a presentation of the application of the theorem prover NQTHM of Boyer and Moore to correctn...
For convenient application of a first-order theorem prover to verification of imperative programs, i...
Computer programs are an indispensable part of many of the systems we rely upon in our daily lives, ...
The process of program extraction is primarily associated with functional programs with less focus o...
We present a technique for the mechanical proof of correctness properties of programs. We define a l...
The jump instruction is considered essential for an adequate theoretical understanding of imperative...
. We have formally specified a substantial subset of the MC68020, a widely used microprocessor built...
AbstractIn this paper, the relation between WHILE-programs and formal proofs of their quantified spe...
Computability theory is at the heart of theoretical computer science. Yet, ironically, many of its b...
Programs are like constructive proofs of their specifications. This analogy is a precise equivalenc...
We present a method for verifying properties of imperative programs that manipulate integer arrays. ...
We argue that the naive use of the imperative style of working witharrays in a declarative setting l...
Abstract. We present a Coq library about Kleene algebra with tests, including a proof of their compl...
AbstractThe so-called Boyer-Moore Theorem Prover (otherwise known as Nqthm) has been used to perform...
We are interested in identifying and enforcing the isolation requirements ofa concurrent program, i....