Peled, D.: On projective and separable properties. In Proc. Colloquium on Trees in Algebra and Programming, Edinburgh, Scotland. Lect. Notes in Comput. Sci., vol. 787, Springer (1994) 291--307.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... be combined into a single formula, formalizing the undesirable execution sequences that are claimed to be impossible: sr rr) rr U rb) In general, it is more efficient to separate orthogonal requirements, and to prove each property separately with smaller verification runs [58]. Each of the first two formulae above separately translates into a two state B chi automaton. The combination of the two formulae, however, translates into a six state automaton, which is more expensive to verify. As a rough estimate of the additional expense of the verification of these ....

D. Peled, "On Projective and Separable Properties," Colloquium on Trees in Algebra and Programming, pp. 291-307, Edinburgh, Scotland, Lecture Notes In Computer Science 787. Springer-Verlag, 1994.

....repeat [9] Although next time operator free linear time temporal logic formulas are naturally stutter closed, i.e. cannot distinguish between stutter equivalent sequences, the use of a nexttime operator does not preclude stutter closure and can be convenient. Finally, projective equivalence [12] is an extension of stutter equivalence that requires stutter equivalence of various projections of a sequence. One context in which knowing that a property is closed is valuable is that of partial order verification algorithms [22, 4, 26, 13, 14] These algorithms proceed by checking a property ....

....that a smaller reduction is obtained. Thus, being able to check whether a property is closed for a given equivalence relation is important for achieving good partial order reductions. Recognizing projective closedness can also be used for improving the throughput of partial order reduction [13, 12]. Projective properties are also preserved by sequential consistent [8] implementations of cache protocols [12] In this paper, we study the problem of determining whether a property is closed under various equivalence relations, including what we will call concurrency relations, namely, trace ....

[Article contains additional citation context not shown here]

Peled, D.: On projective and separable properties. In Proc. Colloquium on Trees in Algebra and Programming, Edinburgh, Scotland. Lect. Notes in Comput. Sci., vol. 787, Springer (1994) 291--307.

....repeat [9] Although next time operator free linear time temporal logic formulas are naturally stutter closed, i.e. cannot distinguish between stutter equivalent sequences, the use of a nexttime operator does not preclude stutter closure and can be convenient. Finally, projective equivalence [12] is an extension of stutter equivalence that requires stutter equivalence of various projections of a sequence. One context in which knowing that a property is closed is valuable is that of partial order verification algorithms [22,4,26,13,14] These algorithms proceed by checking a property on a ....

....that a smaller reduction is obtained. Thus, being able to check whether a property is closed for a given equivalence relation is important for achieving good partial order reductions. Recognizing projective closedness can also be used for improving the throughput of partial order reduction [13,12]. Projective properties are also preserved by sequential consistent [8] implementations of cache protocols [12] In this paper, we study the problem of determining whether a property is closed under various equivalence relations, including what we will call concurrency relations, namely, trace ....

[Article contains additional citation context not shown here]

Peled, D.: On projective and separable properties. In Proc. Colloquium on Trees in Algebra and Programming, Edinburgh, Scotland. Lect. Notes in Comput. Sci., vol. 787, Springer (1994) 291--307.

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