Misao Nagayama and Carolyn Talcott. An nqthm mechanization of "an exercise in the verification of multi-process programs". Technical Report to appear, Computer Science Department, Stanford University, 1991. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
The Boyer-Moore Theorem Prover and Its Interactive Enhancement - Boyer, Kaufmann, Moore (1995) (19 citations) (Correct)
.... a proof of Godel s incompleteness theorem for Shoenfield s first order logic extended with Cohen s axioms for hereditarily finite set theory, Z2 (Shankar, Sha85] shankar tautology.events ) a proof that every tautology has a proof in Shoenfield s propositional logic (Nagayama and Talcott, [NT91], talcott mutex atomic.events ) a proof of the local correctness of a mutual exclusion algorithm under a certain atomicity assumption (Nagayama and Talcott, NT91] talcott mutex molecular.events ) a proof of the local correctness of a mutual exclusion algorithm without the atomicity ....
.... shankar tautology.events ) a proof that every tautology has a proof in Shoenfield s propositional logic (Nagayama and Talcott, NT91] talcott mutex atomic.events ) a proof of the local correctness of a mutual exclusion algorithm under a certain atomicity assumption (Nagayama and Talcott, [NT91], talcott mutex molecular.events ) a proof of the local correctness of a mutual exclusion algorithm without the atomicity assumption mentioned above (Yu, yu amax.events ) the correctness proof for the MC68020 machine code produced by the Gnu C compiler for a C program that finds the maximum ....
M. Nagayama and C. Talcott. An Nqthm mechanization of "An exercise in the verification of multi-process programs". Technical Report STAN-CS-91-1370, Computer Science Department, Stanford University, 1991.
STeP: the Stanford Temporal Prover - Manna, Anuchitanukul.. (1994) (90 citations) (Correct)
....which is a symmetric parameterized program that provides mutual exclusion for an arbitrary number of processes. In [MP90] and [MP91c] several temporal proof techniques were applied to prove some properties of this program. The safety property, mutual exclusion, was also formally verified in [NT91] using the Boyer Moore prover [BM88a] We discuss here a more recent version [SV94] of Szymanski s algorithm. We actually verified a slightly modified program from the one in the prepublished version of [SV94] Our version is written in spl and corrected to avoid deadlock. Szymanski s mutual ....
M. Nagayama and C.L. Talcott. An NQTHM mechanization of "An exercise in the verification of multi-process programs". Technical Report STAN-CS-91-1370, Computer Science Department, Stanford University, Stanford, California, June 1991.
Open Mechanized Reasoning Systems - McCarthy, Giunchiglia, Talcott (1992) Self-citation (Talcott) (Correct)
....formal and informal systems where the system (possibly a person or ad hoc program) can reduce the problem to suitable form. Examples include Fortran and Pascal Verification Condition checking [7, 52] hardware verification [11] checking application of rules in verification of concurrent programs [51]. In [11] a general theory was developed (informally) using function parameters. A Lisp front end was used to map circuit descriptions to a sequence of definition and prove lemma events for NQTHM, which were then checked by NQTHM, even though they should have been proved once and for all in a ....
....theory was developed (informally) using function parameters. A Lisp front end was used to map circuit descriptions to a sequence of definition and prove lemma events for NQTHM, which were then checked by NQTHM, even though they should have been proved once and for all in a higherorder language. In [51], the translation of a program to a transition relation, and the reduction to quantifier free invariants, were done by hand. The HOL system is an example of a system with a highly expressive logic but weak proving capability. A number of experiments are in progress aimed at increasing the ....
Misao Nagayama and Carolyn Talcott. An nqthm mechanization of "an exercise in the verification of multi-process programs". Technical Report to appear, Computer Science Department, Stanford University, 1991.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC