An axiomatic proof technique for parallel programs I

Owicki, Susan; Gries, David

doi:10.1007/bf00268134

Cited by 845 publications

(244 citation statements)

References 5 publications

Supporting

Mentioning

232

Contrasting

Order By: Relevance

“…Such methods were initially designed by Edward Ashcroft [Ash75] using a global invariant, then independently made compositional by Leslie Lamport [Lam77], and by Susan Owicki and David Gries [OG76]. These methods are also described or discussed in [Lam93,SA86,AdBO09].…”

Section: Verification Of Pointer and Concurrent Programs 17mentioning

confidence: 99%

“…This implies that a rule program cannot be verified by a mere translation into a parallel one, on which the existing verification methods for parallel programs [OG76,Hoa76] would then be applied.…”

Section: Correctness Of Programs: a Comparisonmentioning

confidence: 99%

“…Proving a correctness property of a business rules program cannot simply follow the decomposition of the program into its syntactic constituents, i.e., the rules. Borrowing the intuition of the Owicki-Gries method for parallel programs (see [OG76], but also the presentation of proof systems for sequential and concurrent programs in [AO97] by Krzysztof Apt and Ernst-Rüdiger Olderog, and the revised version [AdBO09] by Apt, Olderog, and Frank de Boer), we present a proof system that features an extended notion of compositionality, suitable for business rules programs. By our proof system, a global correctness formula for a program can be derived from local correctness formulas for its individual rules.…”

Section: Chapter 1 Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Verification of Business Rules Programs

Silva

2014

View full text Add to dashboard Cite

Section: Verification Of Pointer and Concurrent Programs 17mentioning

confidence: 99%

Section: Correctness Of Programs: a Comparisonmentioning

confidence: 99%

Section: Chapter 1 Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Verification of Business Rules Programs

Silva

2014

View full text Add to dashboard Cite

“…For the (partial) correctness of an annotation we use the Owicki/Gries theory [OG76] in the terminology of [FvG99]. It states that an assertion P in a process is correct whenever the following two conditions hold:…”

Section: Hoare Triples and The Theory Of Owicki/griesmentioning

confidence: 99%

“…For example, programs can be verified by annotating them with suitable assertions and using these assertions to prove the programs' correctness (e.g. using the Owicki/Gries theory [OG76]). Although human input is required to develop the annotation and to perform the proof, in this way also infinite-state systems can be verified.…”

Section: Introductionmentioning

confidence: 99%

Incremental Verification of Owicki/Gries Proof Outlines Using PVS

Mooij

Wesselink

2005

Formal Methods and Software Engineering

View full text Add to dashboard Cite

Abstract. Verifications of parallel programs are frequently based on automated state-space exploration techniques known as model checking. To avoid state-space explosion problems, theorem proving techniques can be used, for example by manually annotating programs with suitable assertions and using these assertions to prove their correctness (e.g. using the Owicki/Gries theory). We propose a method to support assertionbased methods with theorem provers like PVS. Emphasis is on the typical incremental character of assertion-based methods, and on automated strategies for proving correctness of the proof outlines.

show abstract

Concurrency in Software Engineering

Axford

2002

Encyclopedia of Software Engineering

View full text Add to dashboard Cite

Concurrency in software engineering means the collection of techniques and mechanisms that enable a computer program to perform several different tasks simultaneously, or apparently simultaneously. The need for concurrency in software first arose in the very early days of computing. Although early computers were very much slower than modern machines, their peripheral devices (such as paper tape or punched‐card readers for input, and teletypewriters for output) were much slower still, and it was soon recognized that many programs could be made to run very much faster if they did not spend so much time waiting for input/output (I/O). The solution is easy in principle—simply allow I/O transfers to be performed concurrently with each other and with normal computation (i.e., computation involving only the central processor). To achieve this, new features needed to be added to both hardware and software. Today, such features—concurrency mechanisms, the most important of which are discussed in this article—are commonplace and form a vital part of all modern computer systems. The operating system of any computer (e.g., Windows, UNIX, Linux) makes use of concurrency to enable the user to do several different things simultaneously or to allow many different users to access the computer at the same time. Many operating systems allow a large number of tasks to be run concurrently and the simultaneous use of peripheral devices. The earliest applications of concurrency were in real‐time systems such as operating systems, in which the software must perform actions at times determined by external events.

show abstract

An axiomatic proof technique for parallel programs I

Cited by 845 publications

References 5 publications

Verification of Business Rules Programs

Verification of Business Rules Programs

Incremental Verification of Owicki/Gries Proof Outlines Using PVS

Concurrency in Software Engineering

Contact Info

Product

Resources

About