Stepwise refinement and concurrency: the finite-state case

Gribomont, E. Pascal

doi:10.1016/0167-6423(90)90020-e

Cited by 8 publications

(9 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Comment. The formal notation used here and in CAVEAT to write programs has been introduced in [14]. It is similar in spirit to many other notations based on states and transitions, e.g.…”

Section: The Connection Methodsmentioning

confidence: 99%

See 1 more Smart Citation

CAVEAT: technique and tool for computer aided verification and transformation

Gribomont

Rossetto

1995

Computer Aided Verification

View full text Add to dashboard Cite

We describe CAVEAT, a technique and a tool (under development) for the stepwise design and verification of nearly finite-state concurrent systems (NFCS). A concurrent system is nearly finite-state when most of its variables have a finite range (Booleans, bounded integers). The heart of CAVEAT is a tool for verifying invariants, i.e., inductive safety properties. The underlying method is classical : formula I is an invariant for system ,S if and only if some formula ~r =def {I}S{I} is valid. If ,S is an NFCS, the formula ~5i contains only a small set of non-boolean variables. CAVEAT uses the connection method to extract from ~I a (small) set ~ of paths (some kind of assertions) about the non-boolean variables; ~5i is valid if and only if all paths contain connections, i.e., are inconsistent. For typical NFCS given with a correct invariant, the formula ~I is rather large (more than 100 lines) but k~ is quite small (a dozen one-line formulas). The second part of CAVEAT (not implemented yet) supports an incremental development method that is fairly systematic, but has proved to be flexible enough in practice.

show abstract

“…Comment. The formal notation used here and in CAVEAT to write programs has been introduced in [14]. It is similar in spirit to many other notations based on states and transitions, e.g.…”

Section: The Connection Methodsmentioning

confidence: 99%

“…This is often the case for concurrent, distributed, reactive systems, and the problem of invariant construction seems especially important for such systems. CAVEAT is an attempt to automate an invariant-based stepwise design/verification method introduced in [13,14,16].…”

Section: Introductionmentioning

confidence: 99%

CAVEAT: technique and tool for computer aided verification and transformation

Gribomont

Rossetto

1995

Computer Aided Verification

View full text Add to dashboard Cite

show abstract

“…Manna and Pnueli [1995, Chapter 1] shows how an invariant for the low-atomicity program can be derived as a refinement itself of an invariant for the high-level program. Other methods for refining a high-atomicity program together with its invariant are given in Gribomont [1990], Gribomont [1993]. Here, each time the program is refined, the invariant that holds · 235 for the refined program is derived systematically from the original program, the refined program, and the invariant that holds for the original program.…”

Section: Related Workmentioning

confidence: 99%

Synthesis of concurrent programs for an atomic read/write model of computation

Attie¹

2001

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

Methods for mechanically synthesizing concurrent programs from temporal logic specifications have been proposed by Emerson and Clarke and by Manna and Wolper. An important advantage of these synthesis methods is that they obviate the need to manually compose a program and manually construct a proof of its correctness. A serious drawback of these methods in practice, however, is that they produce concurrent programs for models of computation that are often unrealistic, involving highly centralized system architecture (Manna and Wolper), processes with global information about the system state (Emerson and Clarke), or reactive modules that can read all of their inputs in one atomic step (Anuchitanukul and Manna, and Pnueli and Rosner). Even simple synchronization protocols based on atomic read/write primitives such as Peterson's solution to the mutual exclusion problem have remained outside the scope of practical mechanical synthesis methods. In this paper, we show how to mechanically synthesize in more realistic computational models solutions to synchronization problems. We illustrate the method by synthesizing Peterson's solution to the mutual exclusion problem.An extended abstract containing some of these results was presented at the ACM Symposium on

show abstract

“…A generalized version of algorithm (2) exists, which involves n processes and allows the distributed solution of n-equation systems. However, the validation of atomicity refinements becomes more complicated, and involves several instances of case 3 (see [14] for details).…”

Section: [(H= Ve=) a (H~ V Ey)] V (At X1 A H=) V (At Y1 A H~)mentioning

confidence: 99%

“…Incremental construction of invariants, using approximation sequences like (U,~), originates from [8,7,29]. Systematic approaches are [21] and [14].…”

mentioning

confidence: 99%

Atomicity refinement and trace reduction theorems

Gribomont

1996

Computer Aided Verification

View full text Add to dashboard Cite

Assertional methods tend to be useable for abstract, coarse~grained versions of concurrent algorithms~ but quickly become intractable for more realistic, finer-grained implementations. Various trace-reduction methods have been proposed to transfer properties of coarse-grained versions to finer-grained versions. We show that a more direct approach, involving the explicit construction of an (inductive) invariant for the finer-grained version, is theoretically more powerful, and also more appropriate for computer-aided verification.

show abstract

Stepwise refinement and concurrency: the finite-state case

Cited by 8 publications

References 27 publications

CAVEAT: technique and tool for computer aided verification and transformation

CAVEAT: technique and tool for computer aided verification and transformation

Synthesis of concurrent programs for an atomic read/write model of computation

Atomicity refinement and trace reduction theorems

Contact Info

Product

Resources

About