On the compilation of programs into their equivalent constraint representation

Informatica (Ljubljana)

Volumn 32, Issue 4, 2008, Pages 359-371

  Wotawa, Franz ^a   Nica, Mihai ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Constraint satisfaction problems; Debugging; Hyper graph decomposition

Indexed keywords

PROGRAM DEBUGGING; STEELMAKING; STRUCTURED PROGRAMMING;

CONSTRAINT SATISFACTION PROBLEMS; CONSTRAINT SATISFACTIONS; DEBUGGING; EQUIVALENT CONSTRAINTS; HYPER-GRAPH DECOMPOSITION; STATIC SINGLE ASSIGNMENT FORMS; TREE REPRESENTATIONS; TREE WIDTHS;

PROGRAM DIAGNOSTICS;

EID: 57349116267     PISSN: 03505596     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (31)

1. Andreas Zeller and Ralf Hildebrandt. Simplifying and isolating failure-inducing input. IEEE Transactions on Software Engineering, 28(2), feb 2002.
2. Ehud Shapiro. Algorithmic Program Debugging. MIT Press, 1983.
3. Nahid Shahmehri, Mariam Kamkar, and Peter Fritzson. Usability criteria for automated debugging systems. J. Systems Software, 31:55-70, 1995.
4. Richard A. DeMillo, Hsin Pan, and Eugene H. Spaf-ford. Critical slicing for software fault localization.I n International Symposium on Software Testing and Analysis (ISSTA), pages 121-134, 1996.
5. Neelam Gupta, Haifeng He, Xiangyu Zhang, and Rajiv Gupta. Locating faulty code using failure-inducing chops. In Automated Software Engineering (ASE), pages 263-272, November 2005.
6. Mariam Kamkar. Application of program slicing in algorithmic debugging. Information and Software Technology, 40:637-645, 1998.
7. Marc M. Brandis and H. Mössenböck. Single-pass generation of static assignment form for structured languages. ACM TOP LAS, 16(6): 1684-1698, 1994.
8. H. Collavizza and M. Rueher. Exploration of the capabilities of constraint programming for software verification. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pages 182-196, Vienna, Austria, 2006.
9. Ron Cytron, Jeanne Ferrante, Barry K. Rosen, MarkN. Wegman, andF. Kenneth Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM TOPLAS, 13(4):451-490, 1991.
10. Mark Weiser. Programmers use slices when debugging. Communications of the ACM, 25(7):446-52, July 1982.
11. RinaDechter. Constraint Processing. Morgan Kauf-mann, 2003.
12. thInternational Joint Conf on Artificial Intelligence, pages 1742 - 1748, 1995.
13. Gerhard Friedrich, Markus Stumptner, and Franz Wotawa. Model-based diagnosis of hardware designs. Artificial Intelligence, lll(2):3-39, July 1999.
14. Georg Gottlob, Nicola Leone, and Francesco Scar-cello. On Tractable Queries and Constraints. In Proc. 12th International Conference on Database and Expert Systems Applications DEXA 2001, Florence, Italy, 1999.
15. G. Gottlob, N. Leone, and F. Scarcello. A comparison of structural CSP decomposition methods. Artificial Intelligence, 124(2):243-282, 2000.
16. http://www.dbai.tuwien.ac.at/proj/hypertree/in-dex.html
17. A. Griesmayer, R. Bloem, and B. Cook. Repair of boolean programs with an application to C. In Proc. 18th Conference on Computer Aided Verification (CAV'06), pages 358-371, Seattle, Washington, USA, August 2006.
18. Daniel Jackson. Software abstractions: logic, language, and analysis. MIT Press, 2006.
19. Daniel Köb and Franz Wotawa. Fundamentals of debugging using a resolution calculus. In Luciano Baresi and Reiko Heckel, editors, Fundamental Approaches to Software Engineering (FASE'06), volume 3922 of Lecture Notes in Computer Science, pages 278-292, Vienna, Austria, March 2006. Springer.
20. Cristinel Mateis, Markus Stumptner, and Franz Wotawa. Modeling Java Programs for Diagnosis. In Proceedings of the European Conference on Artificial Intelligence (ECAI), Berlin, Germany, August 2000.
21. Wolfgang Mayer, Markus Stumptner, Dominik Wieland, and Franz Wotawa. Can ai help to improve debugging substantially? debugging experiences with value-based models. In Proceedings of the European Conference on Artificial Intelligence, pages 417-421, Lyon, France, 2002.
22. Raymond Reiter. A theory of diagnosis from first principles. Artificial Intelligence, 32(l):57-95, 1987.
23. S. Staber, B. Jobstmann, and R. Bloem. Finding and fixing faults. In Proc. 13th Conference on Correct Hardware Design and Verification Methods, pages 35-49. Springer-Verlag, 2005. LNCS 3725.
24. thInternational Joint Conf. on Artificial Intelligence, pages 1074-1079, Stockholm, Sweden, August 1999.
25. Markus Stumptner and Franz Wotawa. Diagnosing tree-structured systems. Artificial Intelligence, 127(1): 1-29, 2001.
26. thInternational Joint Conf. on Artificial Intelligence, pages 388-393, Aca-pulco, Mexico, 2003.
27. M.N. Wegman and F.K. Zadek. Constant propagation with conditional branches. ACM Transactions on Programming Languages and Systems, 13(2), April 1991.
28. Mikkel Thorup.All Structured Programs have Small Tree-Width and Good Register Alloca-tionjnformation and Computation Journal, Volume 142,Number 2,Pages 159-181,1998.
29. Artan Dermaku, Tobias Ganzow, Georg Gottlob, Ben McMahan, Nysret Musliu, Marko Samer. Heuristic Methods for hypertree Decompositions, DBAI-TR-2005-53, Technische Universitat Wien, 2005.
30. M. Yannakakis. Algorithms for acyclic database schemes. In C. Zaniolo and C. Delobel, editors, Proceedings of the International Conference on Very Large Data Bases (VLDB-81), pages 82-94, Cannes, France, 1981.
31. R. Ceballos and R. M. Gasca and C. Del Valle and D. Borrego Diagnosing Errors in DbC Programs Using Constraint Programming Lecture Notes in Computer Science, Vol. 4177, Pages 200-210, 2006.