Journal papers

Journals

Journal papers

  • The computational complexity of structure-based causality. / Aleksandrowicz, Gadi; Chockler, Hana; Halpern, Joseph Y.; Ivrii, Alexander. Journal Artificial Intelligence Research, Vol. 58, 01.02.2017, p. 431-451.
  • Beyond Vacuity: Towards the Strongest Passing Formula. / Chockler, Hana; Gurfinkel, Arie; Strichman, Ofer. Formal Methods in System Design (FMSD) Vol. 43, No. 3, 29.08.2013, p. 552-571.
  • Verifying cloud services: present and future. / Bouchenak, Sara; Chockler, Gregory; Chockler, Hana; Gheorghe, Gabriela; Santos, Nuno; Shraer, Alexander. Operating systems review, Vol. 47, No. 2, 01.01.2013, p. 6-19.
  • Computing Mutation Coverage in Interpolation-Based Model Checking. / Chockler, Hana; Kroening, Daniel; Purandare, Mitra. IEEE transactions on computer-Aided design of integrated circuits and systems, Vol. 31, No. 5, 05.2012, p. 765-778.
  • Explaining counterexamples using causality. / Beer, Ilan; Ben-David, Shoham; Chockler, Hana; Orni, Avigail; Trefler, Richard. Formal Methods in System Design (FMSD), Vol. 40, No. 1, 02.2012, p. 20-40.
  • Before and after vacuity. / Chockler, Hana; Strichman, Ofer. Formal Methods in System Design (FMSD), Vol. 34, No. 1, 02.2009, p. 37-58.
  • What causes a system to satisfy a specification? / Chockler, Hana; Halpern, Joseph Y.; Kupferman, Orna. ACM Transactions on Computational Logic, Vol. 9, No. 3, 20, 06.2008.
  • Coverage metrics for formal verification. / Chockler, Hana; Kupferman, Orna; Vardi, Moshe Y. International Journal on Software Tools for Technology Transfer (STTT), Vol. 8, No. 1, 01.02.2006, p. 373-386.
  • Coverage metrics for temporal logic model checking. / Chockler, Hana; Kupferman, Orna; Vardi, Moshe Y. Formal Methods in System Design (FMSD), Vol. 28, No. 1, 01.01.2006, p. 189-212.
  • A lower bound for testing juntas. / Chockler, Hana; Gutfreund, Dan. Information Processing Letters, Vol. 90, No. 6, 2004, p. 301-305.
  • Responsibility and Blame: A Structural-Model Approach. / Chockler, Hana; Halpern, Joseph Y. Journal Artificial Intelligence Research, Vol. 22, 2004, p. 93-115.
  • w-Regular languages are testable with a constant number of queries. / Chockler, Hana; Kupferman, Orna. Theoretical Computer Science, Vol. 329, No. 1-3, 2004, p. 71-92.
  • Which bases admit non-trivial shrinkage of formulae? / Chockler, Hana; Zwick, Uri. Computational Complexity Journal, Vol. 10, No. 1, 2001, p. 28-40.

In Archive