P. Godefroid. On the Costs and Benefits of using Partial-Order Methods for the Verification of Concurrent Systems. Proceedings of DIMACS Workshop on Partial-Order Methods in Verification, July 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Categorical Models for Concurrency: Independence, Fairness and.. - Hildebrandt (2000) (Correct)
....may be desirable. One example of this is in connection with action refinement [131] Another use of independence information is to identify unfair computations [102, 26] Independence semantics have also been applied to tackle the state space explosion problem in automatic verification [129, 46, 48, 47], referring to the fact that there is exponentially many interleavings of a set of concurrent actions, which might not all be necessary to investigate, if the paths are known to represent concurrency. The models of event structures, Petri nets and Mazurkiewicz trace languages mentioned above are ....
Patrice Godefroid. On the costs and benefits of using partial-order methods for the verification of concurrent systems. In POMIV'96, pages 289--304, 1996.
Mechanizing Proofs of Computation Equivalence - Glusman, Katz (1999) (1 citation) (Correct)
.... have been used both for model checking and for general theorem proving (see [16] for a variety of approaches) In particular, ideas of the independence of operations that lead to partial order reductions have either been used for (usually linear) temporal logic based model checking reductions [14, 18, 7], or for theoretical work on general correctness proofs in unbounded domains. 11, 15, 8] For general correctness (as opposed to model checking) no mechanization has been implemented until now, and sample proofs have been hand simulated. The intuitive idea behind convenient computations is ....
P. Godefroid. On the costs and benefits of using partial-order methods for the verification of concurrent systems. In D. Peled, V. Pratt, and G. Holzmann, editors, Partial Order Methods in Verification, pages 289--303. American Mathematical Society, 1997. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 29. 10
LDTA'05 Preliminary Version - Source Transformation For (Correct)
No context found.
P. Godefroid. On the Costs and Benefits of using Partial-Order Methods for the Verification of Concurrent Systems. Proceedings of DIMACS Workshop on Partial-Order Methods in Verification, July 1996.
Quantitative Analysis of Distributed Randomized Protocols - Baier, Ciesinski, Groesser (2005) (Correct)
No context found.
P. Godefroid. On the costs and benefits of using partial-order methods for the verification of concurrent systems. In [26], pages 289--303, 1996.
A Mechanized Proof Environment for the Convenient Computations .. - Glusman, Katz (2002) (Correct)
No context found.
P. Godefroid. On the costs and benefits of using partial-order methods for the verification of concurrent systems. In D. Peled, V. Pratt, and G. Holzmann, editors, Partial Order Methods in Verification, volume 29 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 289--303. American Mathematical Society, 1997.
Concurrency Analysis of Java RMI Using Source.. - Cassidy, Dean, Cordy, .. (Correct)
No context found.
P. Godefroid. On the Costs and Benefits of using PartialOrder Methods for the Verification of Concurrent Systems. Proceedings of DIMACS Workshop on Partial-Order Methods in Verification, July 1996.
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