Efficient Computation of Recurrence Diameters od Kroening, D, Strichman, O

Decision Procedures – an Algorithmic Point of View od Kroening, D, Strichman, O

A framework for Satisfiability Modulo Theories. od Kroening, D, Strichman, O

Abstraction−based Satisfiability Solving of Presburger Arithmetic od Kroening, D, Ouaknine, J, Seshia, S, Strichman, O

Error Explanation with Distance Metrics od Groce, A, Chaki, S, Kroening, D, Strichman, O

Computational challenges in bounded model checking. od Clarke, E, Kroening, D, Ouaknine, J, Strichman, O

Computational challenges in bounded model checking od Clarke, E, Kroening, D, Ouaknine, J, Strichman, O

Completeness and Complexity of Bounded Model Checking od Clarke, E, Kroening, D, Strichman, O, Ouaknine, J

Computational Challenges in Bounded Model Checking od Clarke, E, Kroening, D, Ouaknine, J, Strichman, O

Learning the language of software errors od Chockler, H, Kesseli, P, Kroenig, D, Strichman, O

Linear Completeness Thresholds for Bounded Model Checking. od Kroening, D, Ouaknine, J, Strichman, O, Wahl, T, Worrell, J

Deciding Bit−Vector Arithmetic with Abstraction od Bryant, R, Kroening, D, Ouaknine, J, Seshia, S, Strichman, O, Brady, B

Cyclic-routing of Unmanned Aerial Vehicles od Drucker, N, Ho, H-M, Ouaknine, J, Penn, M, Strichman, O