- -

Speeding Up Algorithmic Debugging Using Balanced Execution Trees

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

Speeding Up Algorithmic Debugging Using Balanced Execution Trees

Show full item record

Silva, J.; Insa Cabrera, D.; Riesco, A. (2013). Speeding Up Algorithmic Debugging Using Balanced Execution Trees. En Tests and Proofs. Springer. 133-151. doi:10.1007/978-3-642-38916-0_8

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/72733

Files in this item

Item Metadata

Title: Speeding Up Algorithmic Debugging Using Balanced Execution Trees
Author:
UPV Unit: Universitat Politècnica de València. Departamento de Sistemas Informáticos y Computación - Departament de Sistemes Informàtics i Computació
Universitat Politècnica de València. Escola Tècnica Superior d'Enginyeria Informàtica
Issued date:
Abstract:
Algorithmic debugging is a debugging technique that uses a data structure representing all computations performed during the execution of a program. This data structure is the so-called Execution Tree and it strongly ...[+]
Copyrigths: Reserva de todos los derechos
ISBN: 978-3-642-38915-3
Source:
Tests and Proofs. (issn: 0302-9743 )
DOI: 10.1007/978-3-642-38916-0_8
Publisher:
Springer
Publisher version: http://link.springer.com/book/10.1007/978-3-642-38916-0
Conference name: 7th International Conference on Tests and Proofs (TAP 2013)
Conference place: Budapest, Hungary
Conference date: June 16-20, 2013
Series: Lecture Notes in Computer Science;7942
Type: Capítulo de libro Comunicación en congreso

This item appears in the following Collection(s)

Show full item record