![]() | 2009 | |
---|---|---|
125 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled, Michael Wooldridge: Model Checking and Artificial Intelligence, 5th International Workshop, MoChArt 2008, Patras, Greece, July 21, 2008. Revised Selected and Invited Papers Springer 2009 |
124 | ![]() ![]() ![]() ![]() ![]() ![]() | Saddek Bensalem, Doron Peled: Runtime Verification, 9th International Workshop, RV 2009, Grenoble, France, June 26-28, 2009. Selected Papers Springer 2009 |
123 | ![]() ![]() ![]() ![]() ![]() ![]() | Ananda Basu, Saddek Bensalem, Doron Peled, Joseph Sifakis: Priority Scheduling of Distributed Systems Based on Model Checking. CAV 2009: 79-93 |
122 | ![]() ![]() ![]() ![]() ![]() ![]() | Dragan Bosnacki, Edith Elkind, Blaise Genest, Doron Peled: On commutativity based Edge Lean search. Ann. Math. Artif. Intell. 56(2): 187-210 (2009) |
121 | ![]() ![]() ![]() ![]() ![]() ![]() | Peter Niebert, Doron Peled: Efficient model checking for LTL with partial order snapshots. Theor. Comput. Sci. 410(42): 4180-4189 (2009) |
2008 | ||
120 | ![]() ![]() ![]() ![]() ![]() ![]() | Michaela Huhn, Hardi Hungar, Doron Peled: Tools for the Model-based Development of Certifiable, Dependable Systems, 10.06. - 15.06.2007 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 |
119 | ![]() ![]() ![]() ![]() ![]() ![]() | Francesco Logozzo, Doron Peled, Lenore D. Zuck: Verification, Model Checking, and Abstract Interpretation, 9th International Conference, VMCAI 2008, San Francisco, USA, January 7-9, 2008, Proceedings Springer 2008 |
118 | ![]() ![]() ![]() ![]() ![]() ![]() | Gal Katz, Doron Peled: Genetic Programming and Model Checking: Synthesizing New Mutual Exclusion Algorithms. ATVA 2008: 33-47 |
117 | ![]() ![]() ![]() ![]() ![]() ![]() | Peter Niebert, Doron Peled, Amir Pnueli: Discriminative Model Checking. CAV 2008: 504-516 |
116 | ![]() ![]() ![]() ![]() ![]() ![]() | Gal Katz, Doron Peled: Model Checking Driven Heuristic Search for Correct Programs. MoChArt 2008: 122-131 |
115 | ![]() ![]() ![]() ![]() ![]() ![]() | Gal Katz, Doron Peled: Model Checking-Based Genetic Programming with an Application to Mutual Exclusion. TACAS 2008: 141-156 |
114 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled, Patrizio Pelliccione, Paola Spoletini: Model Checking. Wiley Encyclopedia of Computer Science and Engineering 2008 |
113 | ![]() ![]() ![]() ![]() ![]() ![]() | Saddek Bensalem, Doron Peled, Hongyang Qu, Stavros Tripakis: Automatic generation of path conditions for concurrent timed systems. Theor. Comput. Sci. 404(3): 275-292 (2008) |
2007 | ||
112 | ![]() ![]() ![]() ![]() ![]() ![]() | Edith Elkind, Blaise Genest, Doron Peled, Paola Spoletini: Quantifying the Discord: Order Discrepancies in Message Sequence Charts. ATVA 2007: 378-393 |
111 | ![]() ![]() ![]() ![]() ![]() ![]() | Saddek Bensalem, Doron Peled, Hongyang Qu, Stavros Tripakis, Lenore D. Zuck: Test Case Generation for Ultimately Periodic Paths. Haifa Verification Conference 2007: 120-135 |
110 | ![]() ![]() ![]() ![]() ![]() ![]() | Dragan Bosnacki, Edith Elkind, Blaise Genest, Doron Peled: On Commutativity Based Edge Lean Search. ICALP 2007: 158-170 |
109 | ![]() ![]() ![]() ![]() ![]() ![]() | Edith Elkind, Blaise Genest, Doron Peled: Detecting Races in Ensembles of Message Sequence Charts. TACAS 2007: 420-434 |
108 | ![]() ![]() ![]() ![]() ![]() ![]() | Michaela Huhn, Hardi Hungar, Doron Peled: 07241 Abstracts Collection - Tools for the Model-based Development of Certifiable, Dependable Systems. Tools for the Model-based Development of Certifiable, Dependable Systems 2007 |
107 | ![]() ![]() ![]() ![]() ![]() ![]() | Michaela Huhn, Hardi Hungar, Doron Peled: 07241 Summary - Tools for the Model-based Development of Certifiable, Dependable Systems. Tools for the Model-based Development of Certifiable, Dependable Systems 2007 |
106 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled, Yih-Kuen Tsay: Preface. Int. J. Found. Comput. Sci. 18(1): 1-4 (2007) |
2006 | ||
105 | ![]() ![]() ![]() ![]() ![]() ![]() | Edith Elkind, Blaise Genest, Doron Peled, Hongyang Qu: Grey-Box Checking. FORTE 2006: 420-435 |
104 | ![]() ![]() ![]() ![]() ![]() ![]() | Peter Niebert, Doron Peled: Efficient Model Checking for LTL with Partial Order Snapshots. TACAS 2006: 272-286 |
103 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled, Hongyang Qu: Enforcing Concurrent Temporal Behaviors. Int. J. Found. Comput. Sci. 17(4): 743-762 (2006) |
102 | ![]() ![]() ![]() ![]() ![]() ![]() | Alex Groce, Doron Peled, Mihalis Yannakakis: Adaptive Model Checking. Logic Journal of the IGPL 14(5): 729-744 (2006) |
2005 | ||
101 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled, Yih-Kuen Tsay: Automated Technology for Verification and Analysis, Third International Symposium, ATVA 2005, Taipei, Taiwan, October 4-7, 2005, Proceedings Springer 2005 |
100 | ![]() ![]() ![]() ![]() ![]() ![]() | Marcin Jurdzinski, Doron Peled, Hongyang Qu: Calculating Probabilities of Real-Time Test Cases. FATES 2005: 134-151 |
99 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled, Hongyang Qu: Time Unbalanced Partial Order. FATES 2005: 152-169 |
98 | ![]() ![]() ![]() ![]() ![]() ![]() | Saddek Bensalem, Doron Peled, Hongyang Qu, Stavros Tripakis: Generating Path Conditions for Timed Systems. IFM 2005: 5-19 |
97 | ![]() ![]() ![]() ![]() ![]() ![]() | Blaise Genest, Dietrich Kuske, Anca Muscholl, Doron Peled: Snapshot Verification. TACAS 2005: 510-525 |
96 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled: Automatic Test Generation and Monitoring of Infinite States Systems. VISSAS 2005: 127-142 |
95 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled, Hongyang Qu: Enforcing Concurrent Temporal Behaviors. Electr. Notes Theor. Comput. Sci. 113: 65-83 (2005) |
94 | ![]() ![]() ![]() ![]() ![]() ![]() | Elsa L. Gunter, Doron Peled: Model checking, testing and verification working together. Formal Asp. Comput. 17(2): 201-221 (2005) |
93 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled: Introduction: Special Issue on Partial Order in Formal Methods. Formal Methods in System Design 26(1): 5-6 (2005) |
92 | ![]() ![]() ![]() ![]() ![]() ![]() | Rajeev Alur, Kenneth L. McMillan, Doron Peled: Deciding Global Partial-Order Properties. Formal Methods in System Design 26(1): 7-25 (2005) |
2004 | ||
91 | ![]() ![]() ![]() ![]() ![]() ![]() | Rajeev Alur, Doron Peled: Computer Aided Verification, 16th International Conference, CAV 2004, Boston, MA, USA, July 13-17, 2004, Proceedings Springer 2004 |
90 | ![]() ![]() ![]() ![]() ![]() ![]() | Blaise Genest, Marius Minea, Anca Muscholl, Doron Peled: Specifying and Verifying Partial Order Properties Using Template MSCs. FoSSaCS 2004: 195-210 |
89 | ![]() ![]() ![]() ![]() ![]() ![]() | Saddek Bensalem, Doron Peled, Hongyang Qu, Stavros Tripakis: Automatic Generation of Path Conditions for Timed Systems. ISoLA (Preliminary proceedings) 2004: 243-249 |
2003 | ||
88 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled, Hongyang Qu: Automatic Verification of Annotated Code. FORTE 2003: 127-143 |
87 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled: Model Checking and Testing Combined. ICALP 2003: 47-63 |
86 | ![]() ![]() ![]() ![]() ![]() ![]() | Blaise Genest, Anca Muscholl, Doron Peled: Message Sequence Charts. Lectures on Concurrency and Petri Nets 2003: 537-558 |
85 | ![]() ![]() ![]() ![]() ![]() ![]() | Anca Muscholl, Doron Peled: Deciding Properties of Message Sequence Charts. Scenarios: Models, Transformations and Tools 2003: 43-65 |
84 | ![]() ![]() ![]() ![]() ![]() ![]() | Elsa L. Gunter, Doron Peled: Unit Checking: Symbolic Model Checking for a Unit of Code. Verification: Theory and Practice 2003: 548-567 |
83 | ![]() ![]() ![]() ![]() ![]() ![]() | Elsa L. Gunter, Anca Muscholl, Doron Peled: Compositional message sequence charts. STTT 5(1): 78-89 (2003) |
2002 | ||
82 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled, Moshe Y. Vardi: Formal Techniques for Networked and Distributed Systems - FORTE 2002, 22nd IFIP WG 6.1 International Conference Houston, Texas, USA, November 11-14, 2002, Proceedings Springer 2002 |
81 | ![]() ![]() ![]() ![]() ![]() ![]() | Alex Groce, Doron Peled, Mihalis Yannakakis: AMC: An Adaptive Model Checker. CAV 2002: 521-525 |
80 | ![]() ![]() ![]() ![]() ![]() ![]() | Cindy Eisner, Doron Peled: Comparing Symbolic and Explicit Model Checking of a Software System. SPIN 2002: 230-239 |
79 | ![]() ![]() ![]() ![]() ![]() ![]() | Alex Groce, Doron Peled, Mihalis Yannakakis: Adaptive Model Checking. TACAS 2002: 357-370 |
78 | ![]() ![]() ![]() ![]() ![]() ![]() | Elsa L. Gunter, Doron Peled: Temporal Debugging for Concurrent Systems. TACAS 2002: 431-444 |
77 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled: Specification and Verification using Message Sequence Charts. Electr. Notes Theor. Comput. Sci. 65(7): (2002) |
76 | ![]() ![]() ![]() ![]() ![]() ![]() | Elsa L. Gunter, Doron Peled: Tracing the executions of concurrent programs. Electr. Notes Theor. Comput. Sci. 70(4): (2002) |
75 | ![]() ![]() ![]() ![]() ![]() ![]() | Robert P. Kurshan, Vladimir Levin, Marius Minea, Doron Peled, Hüsnü Yenigün: Combining Software and Hardware Verification Techniques. Formal Methods in System Design 21(3): 251-280 (2002) |
74 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled, Moshe Y. Vardi, Mihalis Yannakakis: Black Box Checking. Journal of Automata, Languages and Combinatorics 7(2): 225-246 (2002) |
2001 | ||
73 | ![]() ![]() ![]() ![]() ![]() ![]() | Natasha Sharygina, Doron Peled: A Combined Testing and Verification Approach for Software Reliability. FME 2001: 611-628 |
72 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled, Amir Pnueli, Lenore D. Zuck: From Falsification to Verification. FSTTCS 2001: 292-304 |
71 | ![]() ![]() ![]() ![]() ![]() ![]() | Anca Muscholl, Doron Peled: From Finite State Communication Protocols to High-Level Message Sequence Charts. ICALP 2001: 720-731 |
70 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled, Lenore D. Zuck: From Model Checking to a Temporal Proof. SPIN 2001: 1-14 |
69 | ![]() ![]() ![]() ![]() ![]() ![]() | Elsa L. Gunter, Anca Muscholl, Doron Peled: Compositional Message Sequence Charts. TACAS 2001: 496-511 |
68 | ![]() ![]() ![]() ![]() ![]() ![]() | Rajeev Alur, Kousha Etessami, Salvatore La Torre, Doron Peled: Parametric temporal logic for "model measuring". ACM Trans. Comput. Log. 2(3): 388-407 (2001) |
67 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled, Antti Valmari, Ilkka Kokkarinen: Relaxed Visibility Enhances Partial Order Reduction. Formal Methods in System Design 19(3): 275-289 (2001) |
2000 | ||
66 | ![]() ![]() ![]() ![]() ![]() ![]() | Elsa L. Gunter, Robert P. Kurshan, Doron Peled: PET: An Interactive Software Testing Tool. CAV 2000: 552-556 |
65 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled: Specification and Verification of Message Sequence Charts. FORTE 2000: 139-154 |
64 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled: Formal Methods for Message Sequence Charts. ICDCS Workshop on Distributed System Validation and Verification 2000: E7-E13 |
63 | ![]() ![]() ![]() ![]() ![]() ![]() | Elsa L. Gunter, Doron Peled: Using a Mix of Languages in Formal Methods: The PET System. PDPTA 2000 |
62 | ![]() ![]() ![]() ![]() ![]() ![]() | Anca Muscholl, Doron Peled: Analyzing Message Sequence Charts. SAM 2000: 3-17 |
61 | ![]() ![]() ![]() ![]() ![]() ![]() | Rajeev Alur, Kenneth L. McMillan, Doron Peled: Model-Checking of Correctness Conditions for Concurrent Objects. Inf. Comput. 160(1-2): 167-188 (2000) |
1999 | ||
60 | ![]() ![]() ![]() ![]() ![]() ![]() | Nicolas Halbwachs, Doron Peled: Computer Aided Verification, 11th International Conference, CAV '99, Trento, Italy, July 6-10, 1999, Proceedings Springer 1999 |
59 | ![]() ![]() ![]() ![]() ![]() ![]() | Hüsnü Yenigün, Vladimir Levin, Doron Peled, Peter A. Beerel: Hazard-Freedom Checking in Speed-Independent Systems. CHARME 1999: 317-320 |
58 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled, Moshe Y. Vardi, Mihalis Yannakakis: Black Box Checking. FORTE 1999: 225-240 |
57 | ![]() ![]() ![]() ![]() ![]() ![]() | Rajeev Alur, Kousha Etessami, Salvatore La Torre, Doron Peled: Parametric Temporal Logic for "Model Measuring". ICALP 1999: 159-168 |
56 | ![]() ![]() ![]() ![]() ![]() ![]() | Anca Muscholl, Doron Peled: Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces. MFCS 1999: 81-91 |
55 | ![]() ![]() ![]() ![]() ![]() ![]() | Somesh Jha, Doron Peled: Generalized Stuttering Equivalence. PDPTA 1999: 1054-1060 |
54 | ![]() ![]() ![]() ![]() ![]() ![]() | Elsa L. Gunter, Doron Peled: Path Exploration Tool. TACAS 1999: 405-419 |
53 | ![]() ![]() ![]() ![]() ![]() ![]() | Rob Gerth, Ruurd Kuiper, Doron Peled, Wojciech Penczek: A Partial Order Approach to Branching Time Logic Model Checking. Inf. Comput. 150(2): 132-152 (1999) |
52 | ![]() ![]() ![]() ![]() ![]() ![]() | Rajeev Alur, Doron Peled: Undecidability of Partial Order Logics. Inf. Process. Lett. 69(3): 137-143 (1999) |
51 | ![]() ![]() ![]() ![]() ![]() ![]() | Ching-Tsun Chou, Doron Peled: Formal Verification of a Partial-Order Reduction Technique for Model Checking. J. Autom. Reasoning 23(3-4): 265-298 (1999) |
50 | ![]() ![]() ![]() ![]() ![]() ![]() | Edmund M. Clarke, Orna Grumberg, Marius Minea, Doron Peled: State Space Reduction Using Partial Order Techniques. STTT 2(3): 279-287 (1999) |
1998 | ||
49 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled: Ten Years of Partial Order Reduction. CAV 1998: 17-28 |
48 | ![]() ![]() ![]() ![]() ![]() ![]() | Parosh Aziz Abdulla, Bengt Jonsson, Mats Kindahl, Doron Peled: A General Approach to Partial Order Reductions in Symbolic Verification (Extended Abstract). CAV 1998: 379-390 |
47 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled: A Toolset for Message Sequence Charts. CAV 1998: 532-536 |
46 | ![]() ![]() ![]() ![]() ![]() ![]() | Anca Muscholl, Doron Peled, Zhendong Su: Deciding Properties for Message Sequence Charts. FoSSaCS 1998: 226-242 |
45 | ![]() ![]() ![]() ![]() ![]() ![]() | Rajeev Alur, Kenneth L. McMillan, Doron Peled: Deciding Global Partial-Order Properties. ICALP 1998: 41-52 |
44 | ![]() ![]() ![]() ![]() ![]() ![]() | Robert P. Kurshan, Vladimir Levin, Marius Minea, Doron Peled, Hüsnü Yenigün: Static Partial Order Reduction. TACAS 1998: 345-357 |
43 | ![]() ![]() ![]() ![]() ![]() ![]() | Girish Bhat, Doron Peled: Adding Partial Orders to Linear Temporal Logic. Fundam. Inform. 36(1): 1-21 (1998) |
42 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled, Thomas Wilke, Pierre Wolper: An Algorithmic Approach for Checking Closure Properties of Temporal Logic Specifications and Omega-Regular Languages. Theor. Comput. Sci. 195(2): 183-203 (1998) |
1997 | ||
41 | ![]() ![]() ![]() ![]() ![]() ![]() | Ilkka Kokkarinen, Doron Peled, Antti Valmari: Relaxed Visibility Enhances Partial Order Reduction. CAV 1997: 328-339 |
40 | ![]() ![]() ![]() ![]() ![]() ![]() | Girish Bhat, Doron Peled: Adding Partial Orders to Linear Temporal Logic. CONCUR 1997: 119-134 |
39 | ![]() ![]() ![]() ![]() ![]() ![]() | Parosh Aziz Abdulla, Mats Kindahl, Doron Peled: An Improved Search Strategy for Lossy Channel Systems. FORTE 1997: 251-264 |
38 | ![]() ![]() ![]() ![]() ![]() ![]() | Robert P. Kurshan, Vladimir Levin, Marius Minea, Doron Peled, Hüsnü Yenigün: Verifying hardware in its software context. ICCAD 1997: 742-749 |
37 | ![]() ![]() ![]() ![]() ![]() ![]() | E. Allen Emerson, Somesh Jha, Doron Peled: Combining Partial Order and Symmetry Reductions. TACAS 1997: 19-34 |
36 | ![]() ![]() ![]() ![]() ![]() ![]() | Vladimir Levin, Doron Peled: Verification of Message Sequence Charts via Template Matching. TAPSOFT 1997: 652-666 |
35 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled: Verification for Robust Specification. TPHOLs 1997: 231-241 |
34 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled, Thomas Wilke: Stutter-Invariant Temporal Properties are Expressible Without the Next-Time Operator. Inf. Process. Lett. 63(5): 243-246 (1997) |
33 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled: On Projective and Separable Properties. Theor. Comput. Sci. 186(1-2): 135-156 (1997) |
1996 | ||
32 | ![]() ![]() ![]() ![]() ![]() ![]() | Gerard J. Holzmann, Doron Peled: The State of SPIN. CAV 1996: 385-389 |
31 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled, Thomas Wilke, Pierre Wolper: An Algorithmic Approach for Checking Closure Properties of omega-Regular Languages. CONCUR 1996: 596-610 |
30 | ![]() ![]() ![]() ![]() ![]() ![]() | Patrice Godefroid, Doron Peled, Mark G. Staskauskas: Using Partial-Order Methods in the Formal Validation of Industrial Concurrent Programs. ISSTA 1996: 261-269 |
29 | ![]() ![]() ![]() ![]() ![]() ![]() | Rajeev Alur, Kenneth L. McMillan, Doron Peled: Model-Checking of Correctness Conditions for Concurrent Objects. LICS 1996: 219-228 |
28 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled: Partial Order Reduction: Model-Checking Using Representatives. MFCS 1996: 93-112 |
27 | ![]() ![]() ![]() ![]() ![]() ![]() | Ching-Tsun Chou, Doron Peled: Formal Verification of a Partial-Order Reduction Technique for Model Checking. TACAS 1996: 241-257 |
26 | ![]() ![]() ![]() ![]() ![]() ![]() | Rajeev Alur, Gerard J. Holzmann, Doron Peled: An Analyser for Mesage Sequence Charts. TACAS 1996: 35-48 |
25 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled: User Interfaces for Formal Methods. ACM Comput. Surv. 28(4es): 122 (1996) |
24 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled: Combining Partial Order Reductions with On-the-Fly Model-Checking. Formal Methods in System Design 8(1): 39-64 (1996) |
23 | ![]() ![]() ![]() ![]() ![]() ![]() | Patrice Godefroid, Doron Peled, Mark G. Staskauskas: Using Partial-Order Methods in the Formal Validation of Industrial Concurrent Programs. IEEE Trans. Software Eng. 22(7): 496-507 (1996) |
22 | ![]() ![]() ![]() ![]() ![]() ![]() | Rajeev Alur, Gerard J. Holzmann, Doron Peled: An Analyzer for Message Sequence Charts. Software - Concepts and Tools 17(2): 70-77 (1996) |
1995 | ||
21 | ![]() ![]() ![]() ![]() ![]() ![]() | Rob Gerth, Ruurd Kuiper, Doron Peled, Wojciech Penczek: A Partial Order Approach to Branching Time Logic Model Checking. ISTCS 1995: 130-139 |
20 | ![]() ![]() ![]() ![]() ![]() ![]() | Rajeev Alur, Doron Peled, Wojciech Penczek: Model-Checking of Causality Properties LICS 1995: 90-100 |
19 | ![]() ![]() ![]() ![]() ![]() ![]() | Rob Gerth, Doron Peled, Moshe Y. Vardi, Pierre Wolper: Simple on-the-fly automatic verification of linear temporal logic. PSTV 1995: 3-18 |
18 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled, Wojciech Penczek: Using asynchronous Büchi automata for efficient automatic verification of concurrent systems. PSTV 1995: 315-330 |
1994 | ||
17 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled: On Projective and Separable Properties. CAAP 1994: 291-308 |
16 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled: Combining Partial Order Reductions with On-the-fly Model-Checking. CAV 1994: 377-390 |
15 | ![]() ![]() ![]() ![]() ![]() ![]() | Gerard J. Holzmann, Doron Peled: An improvement in formal verification. FORTE 1994: 197-211 |
14 | ![]() ![]() ![]() ![]() ![]() ![]() | Marta Z. Kwiatkowska, Doron Peled, Wojciech Penczek: A Hierarchy of Partial Order Temporal Properties. ICTL 1994: 398-414 |
13 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled, Amir Pnueli: Proving Partial Order Properties. Theor. Comput. Sci. 126(2): 143-182 (1994) |
12 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled, Mathai Joseph: A Compositional Framework for Fault Tolerance by Specification Transformation. Theor. Comput. Sci. 128(1&2): 99-125 (1994) |
1993 | ||
11 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled: All from One, One for All: on Model Checking Using Representatives. CAV 1993: 409-423 |
10 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled, Mathai Joseph: A Compositional Approach for Fault-Tolerance Using Specification Transformation. PARLE 1993: 173-184 |
1992 | ||
9 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled: Sometimes 'Some' is as Good as 'All'. CONCUR 1992: 192-206 |
8 | ![]() ![]() ![]() ![]() ![]() ![]() | Shmuel Katz, Doron Peled: Verification of Distributed Programs Using Representative Interleaving Sequences. Distributed Computing 6(2): 107-120 (1992) |
7 | ![]() ![]() ![]() ![]() ![]() ![]() | Shmuel Katz, Doron Peled: Defining Conditional Independence Using Collapses. Theor. Comput. Sci. 101(2): 337-359 (1992) |
1991 | ||
6 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled, Shmuel Katz, Amir Pnueli: Specifying and Proving Serializability in Temporal Logic LICS 1991: 232-244 |
1990 | ||
5 | ![]() ![]() ![]() ![]() ![]() ![]() | Doron Peled, Amir Pnueli: Proving Partial Order Liveness Properties. ICALP 1990: 553-571 |
4 | ![]() ![]() ![]() ![]() ![]() ![]() | Shmuel Katz, Doron Peled: Interleaving Set Temporal Logic. Theor. Comput. Sci. 75(3): 263-287 (1990) |
1988 | ||
3 | ![]() ![]() ![]() ![]() ![]() ![]() | Shmuel Katz, Doron Peled: An efficient verification method for parallel and distributed programs. REX Workshop 1988: 489-507 |
1987 | ||
2 | ![]() ![]() ![]() ![]() ![]() ![]() | Shmuel Katz, Doron Peled: Interleaving Set Temporal Logic (Preliminary Version). PODC 1987: 178-190 |
1 | ![]() ![]() ![]() ![]() ![]() ![]() | Shmuel Katz, Doron Peled: Interleaving Set Temporal Logic. Temporal Logic in Specification 1987: 21-43 |