- -

Scaling up algorithmic debugging with virtual execution trees

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

Scaling up algorithmic debugging with virtual execution trees

Show full item record

Insa Cabrera, D.; Silva Galiana, JF. (2011). Scaling up algorithmic debugging with virtual execution trees. En Logic-Based Program Synthesis and Transformation. Springer Verlag (Germany). 6564:149-163. doi:10.1007/978-3-642-20551-4_10

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

Files in this item

Item Metadata

Title: Scaling up algorithmic debugging with virtual 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ó
Issued date:
Abstract:
Declarative debugging is a powerful debugging technique that has been adapted to practically all programming languages. However, the technique suffers from important scalability problems in both time and memory. With ...[+]
Subjects: Computer science
Copyrigths: Reserva de todos los derechos
ISBN: 978-3-642-20550-7
Source:
Logic-Based Program Synthesis and Transformation. (issn: 0302-9743 )
DOI: 10.1007/978-3-642-20551-4_10
Publisher:
Springer Verlag (Germany)
Publisher version: http://link.springer.com/chapter/10.1007/978-3-642-20551-4_10
Conference name: 20th International Symposium, LOPSTR 2010
Conference place: Hagenberg, Austria
Conference date: July 23-25, 2010
Series: Lecture Notes in Computer Science;vo. 6564;
Type: Capítulo de libro

This item appears in the following Collection(s)

Show full item record