|
Search the dblp DataBase
Hana Chockler:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Hana Chockler, Orna Kupferman, Robert P. Kurshan, Moshe Y. Vardi
A Practical Approach to Coverage in Model Checking. [Citation Graph (0, 0)][DBLP] CAV, 2001, pp:66-78 [Conf]
- Paul C. Attie, David H. Lorenz, Aleksandra Portnova, Hana Chockler
Behavioral Compatibility Without State Explosion: Design and Verification of a Component-Based Elevator Control System. [Citation Graph (0, 0)][DBLP] CBSE, 2006, pp:33-49 [Conf]
- Hana Chockler, Kathi Fisler
Temporal Modalities for Concisely Capturing Timing Diagrams. [Citation Graph (0, 0)][DBLP] CHARME, 2005, pp:176-190 [Conf]
- Hana Chockler, Orna Kupferman, Moshe Y. Vardi
Coverage Metrics for Formal Verification. [Citation Graph (0, 0)][DBLP] CHARME, 2003, pp:111-125 [Conf]
- Hana Chockler, Orna Kupferman
Coverage of Implementations by Simulating Specifications. [Citation Graph (0, 0)][DBLP] IFIP TCS, 2002, pp:409-421 [Conf]
- Hana Chockler, Joseph Y. Halpern
Responsibility and Blame: A Structural-Model Approach. [Citation Graph (0, 0)][DBLP] IJCAI, 2003, pp:147-153 [Conf]
- Hana Chockler, Orna Kupferman
omega-Regular Languages Are Testable with a Constant Number of Queries. [Citation Graph (0, 0)][DBLP] RANDOM, 2002, pp:26-28 [Conf]
- Hana Chockler, Uri Zwick
Which formulae shrink under random restrictions? [Citation Graph (0, 0)][DBLP] SODA, 2001, pp:702-708 [Conf]
- Hana Chockler, Orna Kupferman, Moshe Y. Vardi
Coverage Metrics for Temporal Logic Model Checking. [Citation Graph (0, 0)][DBLP] TACAS, 2001, pp:528-542 [Conf]
- Paul C. Attie, Hana Chockler
Efficiently Verifiable Conditions for Deadlock-Freedom of Large Concurrent Programs. [Citation Graph (0, 0)][DBLP] VMCAI, 2005, pp:465-481 [Conf]
- Hana Chockler, Uri Zwick
Which bases admit non-trivial shrinkage of formulae? [Citation Graph (0, 0)][DBLP] Computational Complexity, 2001, v:10, n:1, pp:28-40 [Journal]
- Hana Chockler, Joseph Y. Halpern
Responsibility and blame: a structural-model approach [Citation Graph (0, 0)][DBLP] CoRR, 2003, v:0, n:, pp:- [Journal]
- Hana Chockler, Joseph Y. Halpern, Orna Kupferman
What Causes a System to Satisfy a Specification? [Citation Graph (0, 0)][DBLP] CoRR, 2003, v:0, n:, pp:- [Journal]
- Paul C. Attie, Hana Chockler
Automatic Verification of Fault-Tolerant Register Emulations. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2006, v:149, n:1, pp:49-60 [Journal]
- Hana Chockler, Orna Kupferman, Moshe Y. Vardi
Coverage metrics for temporal logic model checking*. [Citation Graph (0, 0)][DBLP] Formal Methods in System Design, 2006, v:28, n:3, pp:189-212 [Journal]
- Hana Chockler, Dan Gutfreund
A lower bound for testing juntas. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2004, v:90, n:6, pp:301-305 [Journal]
- Hana Chockler, Joseph Y. Halpern
Responsibility and Blame: A Structural-Model Approach. [Citation Graph (0, 0)][DBLP] J. Artif. Intell. Res. (JAIR), 2004, v:22, n:, pp:93-115 [Journal]
- Hana Chockler, Orna Kupferman, Moshe Y. Vardi
Coverage metrics for formal verification. [Citation Graph (0, 0)][DBLP] STTT, 2006, v:8, n:4-5, pp:373-386 [Journal]
- Hana Chockler, Orna Kupferman
w-Regular languages are testable with a constant number of queries. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2004, v:329, n:1-3, pp:71-92 [Journal]
- Hana Chockler, Ofer Strichman
Easier and More Informative Vacuity Checks. [Citation Graph (0, 0)][DBLP] MEMOCODE, 2007, pp:189-198 [Conf]
Explaining Counterexamples Using Causality. [Citation Graph (, )][DBLP]
Coverage in interpolation-based model checking. [Citation Graph (, )][DBLP]
Cross-Entropy-Based Replay of Concurrent Programs. [Citation Graph (, )][DBLP]
Beyond Vacuity: Towards the Strongest Passing Formula. [Citation Graph (, )][DBLP]
Cross-Entropy Based Testing. [Citation Graph (, )][DBLP]
Formal verification of concurrent software: two case studies. [Citation Graph (, )][DBLP]
Efficient Automatic STE Refinement Using Responsibility. [Citation Graph (, )][DBLP]
Search in 0.049secs, Finished in 0.050secs
|