TestEra: Specification-based testing of Java programs using SAT

S Khurshid, D Marinov - Automated Software Engineering, 2004 - Springer
TestEra is a framework for automated specification-based testing of Java programs. TestEra
requires as input a Java method (in sourcecode or bytecode), a formal specification of the …

Diversification and determinism in local search for satisfiability

CM Li, WQ Huang - Theory and Applications of Satisfiability Testing: 8th …, 2005 - Springer
The choice of the variable to flip in the Walksat family procedures is always random in that it
is selected from a randomly chosen unsatisfied clause c. This choice in Novelty or R-Novelty …

Analysis of invariants for efficient bounded verification

JP Galeotti, N Rosner, CG López Pombo… - Proceedings of the 19th …, 2010 - dl.acm.org
SAT-based bounded verification of annotated code consists of translating the code together
with the annotations to a propositional formula, and analyzing the formula for specification …

Automatic test case and test oracle generation based on functional scenarios in formal specifications for conformance testing

S Liu, S Nakajima - IEEE Transactions on Software …, 2020 - ieeexplore.ieee.org
Testing a program to confirm whether it consistently implements its requirements
specification is a necessary but time-consuming activity in software development. Automatic …

Parallel test generation and execution with Korat

S Misailovic, A Milicevic, N Petrovic… - Proceedings of the the …, 2007 - dl.acm.org
We present novel algorithms for parallel testing of code that takes structurally complex test
inputs. The algorithms build on the Korat algorithm for constraint-based generation of …

TACO: Efficient SAT-based bounded verification using symmetry breaking and tight bounds

JP Galeotti, N Rosner, CGL Pombo… - IEEE Transactions on …, 2013 - ieeexplore.ieee.org
SAT-based bounded verification of annotated code consists of translating the code together
with the annotations to a propositional formula, and analyzing the formula for specification …

Automated model repair for Alloy

K Wang, A Sullivan, S Khurshid - Proceedings of the 33rd ACM/IEEE …, 2018 - dl.acm.org
Automated program repair is an active research area. However, existing research focuses
mostly on imperative code, eg in Java. In this paper, we study the problem of repairing …

Automated test generation and mutation testing for Alloy

A Sullivan, K Wang, RN Zaeem… - 2017 IEEE International …, 2017 - ieeexplore.ieee.org
We present two novel approaches for automated testing of models written in Alloy–a well-
known declarative, first-order language that is supported by a fully automatic SAT-based …

Software assurance by bounded exhaustive testing

K Sullivan, J Yang, D Coppit, S Khurshid… - Proceedings of the 2004 …, 2004 - dl.acm.org
The contribution of this paper is an experiment that shows the potential value of a
combination of selective reverse engineering to formal specifications and bounded …

Fault localization for declarative models in alloy

K Wang, A Sullivan, D Marinov… - 2020 IEEE 31st …, 2020 - ieeexplore.ieee.org
Fault localization is a popular research topic and many techniques have been proposed to
locate faults in imperative code, eg C and Java. In this paper, we focus on the problem of …