Regular Repair of Specifications

Michael Benedikt (1) , Gabriele Puppis (2) , Cristian Riveros (3)

1 OUCL - Computing Laboratory
2 LaBRI - Laboratoire Bordelais de Recherche en Informatique
3 Department of Computer Science [Oxford]

What do you do if a computational object (e.g. program trace) fails a specification? An obvious approach is to perform repair: modify the object minimally to get something that satisfies the constraints. In this paper we study repair of temporal constraints, given as automata or temporal logic formulas. We focus on determining the number of repairs that must be applied to a word satisfying a given input constraint in order to ensure that it satisfies a given target constraint. This number may well be unbounded; one of our main contributions is to isolate the complexity of the "bounded repair problem", based on a characterization of the pairs of regular languages that admit such a repair. We consider this in the setting where the repair strategy is unconstrained and also when the strategy is restricted to use finite memory. Although the streaming setting is quite different from the general setting, we find that there are surprising connections between streaming and non-streaming, as well as within variants of the streaming problem.

Domaines: Théorie et langage formel [cs.FL]

Michael Benedikt, Gabriele Puppis, Cristian Riveros. Regular Repair of Specifications. Proceedings of LICS 2011, 2011, Toronto, Canada. pp.335-344, ⟨10.1109/LICS.2011.43⟩. ⟨hal-00717758⟩