We study the learnability of symbolic finite state automata (SFA), a model shown useful in
many applications in software verification. The state-of-the-art literature on this topic follows …

Abstract We present Assume-Guarantee-Repair (AGR)—a novel framework which verifies
that a program satisfies a set of properties and also repairs the program in case the …