Results 1 
6 of
6
Verification and Specification of Concurrent Programs
 A Decade of Concurrency  Reflexions and Perspectives, Springer Verlag (1993) 347–374 LNCS 803
, 1993
"... . I explore the history of, and lessons learned from, eighteen years of assertional methods for specifying and verifying concurrent programs. I then propose a Utopian future in which mathematics prevails. Keywords. Assertional methods, fairness, formal methods, mathematics, OwickiGries method, ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
. I explore the history of, and lessons learned from, eighteen years of assertional methods for specifying and verifying concurrent programs. I then propose a Utopian future in which mathematics prevails. Keywords. Assertional methods, fairness, formal methods, mathematics, OwickiGries method, temporal logic, TLA. Table of Contents 1 A Brief and Rather Biased History of StateBased Methods for Verifying Concurrent Systems . . . . . . . . . . . . . . . . . . 2 1.1 From Floyd to Owicki and Gries, and Beyond . . . . . . . . . . . 2 1.2 Temporal Logic . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.3 Unity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2 An Even Briefer and More Biased History of StateBased Specification Methods for Concurrent Systems . . . . . . . . . 6 2.1 Axiomatic Specifications . . . . . . . . . . . . . . . . . . . . . . . 6 2.2 Operational Specifications . . . . . . . . . . . . . . . . . . . . . . 7 2.3 FiniteState Methods ...
On Distributive FixedPoint Expressions
, 1998
"... For every fixedpoint expression e of alternationdepth r, we construct a new fixedpoint expression e 0 of alternationdepth 2 and size O(r \Delta jej). Expression e 0 is equivalent to e whenever operators are distributive and the underlying complete lattice has a cocontinuous least upper b ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
For every fixedpoint expression e of alternationdepth r, we construct a new fixedpoint expression e 0 of alternationdepth 2 and size O(r \Delta jej). Expression e 0 is equivalent to e whenever operators are distributive and the underlying complete lattice has a cocontinuous least upper bound. We show that our transformation is optimal not only w.r.t. alternationdepth but also w.r.t. the increase in size of the resulting expression. Keywords: fixedpoint expressions, distributivity, alternationdepth, lower bounds. Mathematics Subject Classification: 68Q60, 03D70, 06D99, 68Q25 1 Introduction FixedPoint calculus is a logical formalism based on explicit notation for inductive and coinductive definitions. It is recognized as a useful framework especially for reasoning about temporal properties of finite state systems. The role of alternation of least () and greatest () fixedpoint operators as a source of a sharp expressive power for the fixedpoint calculus has been rec...
On Distributive Fixpoint Expressions
, 1998
"... For every fixpoint expression e of alternationdepth r, we construct a new fixpoint expression e 0 of alternationdepth 2 and size O(r \Delta jej). Expression e 0 is equivalent to e whenever operators are distributive and the underlying complete lattice has a cocontinuous least upper bound. We ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
For every fixpoint expression e of alternationdepth r, we construct a new fixpoint expression e 0 of alternationdepth 2 and size O(r \Delta jej). Expression e 0 is equivalent to e whenever operators are distributive and the underlying complete lattice has a cocontinuous least upper bound. We show that our transformation is optimal not only w.r.t. alternationdepth but also w.r.t. the increase in size of the resulting expression.
unknown title
"... Pnueli [15] has recently introduced the idea of using temporal logic [ 18] as the logical basis for proving correctness properties of ’ concurrent programs. This has permitted an elegant unifying ..."
Abstract
 Add to MetaCart
Pnueli [15] has recently introduced the idea of using temporal logic [ 18] as the logical basis for proving correctness properties of ’ concurrent programs. This has permitted an elegant unifying