A Generalized Model for Algorithmic Debugging

Algorithmic debugging is a semi-automatic debugging technique that is present in practically all mature programming languages. In this paper we claim that the state of the practice in algorithmic debugging is a step forward compared to the state of the theory. In particular, we argue that novel tech...

Descripción completa

Detalles Bibliográficos
Autores: Insa Cabrera, David, Silva, Josep|||0000-0001-5096-0008
Tipo de recurso: capítulo de libro
Fecha de publicación:2015
País:España
Institución:Universitat Politècnica de València (UPV)
Repositorio:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Idioma:inglés
OAI Identifier:oai:riunet.upv.es:10251/66519
Acceso en línea:https://riunet.upv.es/handle/10251/66519
Access Level:acceso abierto
Palabra clave:LENGUAJES Y SISTEMAS INFORMATICOS
Descripción
Sumario:Algorithmic debugging is a semi-automatic debugging technique that is present in practically all mature programming languages. In this paper we claim that the state of the practice in algorithmic debugging is a step forward compared to the state of the theory. In particular, we argue that novel techniques for algorithmic debugging cannot be supported by the standard internal data structures used in this technique, and a generalization of the standard definitions and algorithms is needed. We identify two specific problems of the standard formulation and implementations of algorithmic debugging, and we propose a reformulation to solve both problems. The reformulation has been done in a paradigm-independent manner to make it useful and reusable in different programming languages.

Similares en LA Referencia