- Combining software and hardware verification techniques Robert P. Kurshan (k@research.belllabs.com)
- From Model Checking to a Temporal Proof Doron Peled 1 and and Lenore Zuck 2
- Model Checking Using Automata Theory Doron Peled
- Formal Methods for Message Sequence Charts Doron Peled
- Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces
- Electronic Notes in Theoretical Computer Science 65 No. 7 (2002) URL: http://www.elsevier.nl/locate/entcs/volume65.html LastPage pages
- Using Functional Languages in Formal Methods: The Pet System
- [27] D. Peled, A. Pnueli, Proving Partial Order Properties, Theoretical Computer Science, 126(1994), 143--182.
- Proving Partial Order Properties \Lambda Doron Peled y
- [20] S. Katz, D. Peled, Defining conditional independence using collapses, Theoretical Com puter Science101 (1992), 337359, a preliminary version appeared in BCS--FACSWorkshop
- Parametric Temporal Logic for ``Model Measuring''
- We considered three alternative semantics and showed that the matching problem under both the orsemantics and the andsemantics is NPcomplete. Under a semantics which
- Verifying Hardware in its Software Context R. Kurshan V. Levin M. Minea D. Peled H. Yenigun
- 1. R. Alur, K. McMillan, D. Peled, Deciding Global PartialOrder Properties, sub mitted for publication.
- A Compositional Framework for Fault-Tolerance by Speci cation Transformation
- Undecidability of Partial Order Logics Rajeev Alur
- PET: an Interactive Software Testing Tool Elsa Gunter, Robert Kurshan, Doron Peled
- Parametric Temporal Logic for ``Model Measuring''
- Specifying and Proving Serializability in Temporal Logic \Lambda
- Software Tools for Technology Transfer ManuscriptNr. (will be inserted by hand later)
- Software Tools for Technology Transfer manuscript No. (will be inserted by the editor)
- Adaptive Model Checking Alex Groce 1 and Doron Peled 2 and Mihalis Yannakakis 3
- [14] D. Peled, Combining Partial Order Reductions with Onthefly ModelChecking, Proc. of 6th international conference on Computer Aided Verification, Stanford, CA, 1994, LNCS
- Black Box Checking Doron Peled
- From Falsi cation to Veri cation Doron Peled 1 , Amir Pnueli 2 , and Lenore Zuck 3
- the symbolic search is not only faster, but completes on models which are com putationally infeasible with reduction based on an explicit state search.
- Sometimes `Some' is as Good as `All' \Lambda Doron Peled
- Comparing Symbolic and Explicit Model Checking of a Software System
- RV'04 Preliminary Version Enforcing Concurrent Temporal Behaviors
- Path Exploration Tool Elsa L. Gunter and Doron Peled
- Automatic Veri cation of Annotated Code ? Doron Peled and Hongyang Qu
- Calculating Probabilities of Real-time Marcin Jurdzi nski, Doron Peled, and Hongyang Qu
- A Combined Testing and Verification Approach for Software Reliability
- An Improvement in Formal Verification Gerard J. Holzmann
- Book Editors IOS Press, 2003
- The State of Spin Gerard J. Holzmann and Doron Peled
- Combining Partial Order Reductions with Onthefly ModelChecking
- SPECIFICATION AND VERIFICATION OF MESSAGE SEQUENCE CHARTS
- [20] A. Mazurkiewicz, Trace Theory, Advances in Petri Nets 1986, Bad Honnef, Germany, Lecture Notes in Computer Science 255, Springer, 1987, 279--324.
- Modelchecking of correctness conditions for concurrent objects \Lambda
- RV'02 Preliminary Version Tracing the executions of concurrent programs
- From Finite State Communication Protocols to HighLevel Message Sequence Charts
- Adding Partial Orders to Linear Temporal Logic Girish Bhat
- Formal Verification of a PartialOrder Reduction Technique for Model Checking 1
- P 1 P 2 P 3 P 1 MSC scenario
- 33. D. Peled, Partial order reduction: linear and branching temporal logics and process algebras, POMIV'96, Partial Orders Methods in Verification, American Mathemat
- Automatic Generation of Path Conditions for Concurrent Timed Systems
- [19] Safra, S.: On the complexity of !automata. In Proc. 29th Annual Symposium on Foundations of Computer Science, White Plains, New York (1988) 319--327.
- A General Approach to Partial Order Reductions in Symbolic Verification
- StutterInvariant Temporal Properties are Expressible Without the Nexttime Operator
- Deciding Global Partial-Order Properties Rajeev Alur
- Correctness Consider a linear structure M = (s; A' [ \Pi; w) such
- Deciding Properties of Message Sequence Charts Anca Muscholl
- Temporal Debugging for Concurrent Systems Elsa Gunter 1 and Doron Peled 2
- [30] D. Peled, A. Pnueli, Proving partial order liveness properties, in M.S. Paterson (ed.), Pro ceedings of the 17 th ICALP, LNCS 443, SpringerVerlag, 1990, 553571.
- All from One, One for All: on Model Checking Using Representatives
- IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, VOL. 22, NO. 7, JULY 1996 1 Using PartialOrder Methods in the
- observationslead us to the discovery of the incompatibilityof the nested depth first search algorithms with partial order reduction.
- An Improved Search Strategy for Lossy Channel Systems
- [17] R. de Simone, D. Vergamini, Aboard AUTO, Technical report 111, INRIA, Centre Sophia Antipolis, Valbonne Cedex, 1989.
- Simple Onthefly Automatic Verification of Linear Temporal Logic
