A Debugging Scheme for Declarative Equation Based Modeling Languages
2002 (English)In: Practical Aspects of Declarative Languages, Springer Berlin/Heidelberg, 2002Conference paper (Refereed)
This paper concerns the static analysis for debugging purposes of programs written in declarative equation based modeling languages. We first give an introduction to declarative equation based languages and the consequences equation based programming has for debugging. At the same time, we examine the particular debugging problems posed by Modelica, a declarative equation based modeling language. A brief overview of the Modelica language is also given. We also present our view of the issues and solutions based on a proposed framework for debugging declarative equation based languages. Program analysis solutions for program understanding and for static debugging of declarative equation based languages, based on bipartite graph decomposition, are presented in the paper. We also present an efficient way to annotate the underlying equations in order to help the implemented debugger to eliminate the heuristics involved in choosing the right error fixing solution. This also provides means to report the location of an error caught by the static analyzer or by the numeric solver, consistent with the user’s perception of the source code and simulation model.
Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2002.
Lecture Notes in Computer Science, ISSN 0302-9743 (print), 1611-3349 (online) ; 2257
Declarative equation based language, modeling languages, bipartite graphs, graph decomposition techniques, static analysis, debugging, Modelica
Electrical Engineering, Electronic Engineering, Information Engineering
IdentifiersURN: urn:nbn:se:liu:diva-110188DOI: 10.1007/3-540-45587-6_18ISBN: 978-3-540-43092-6 (print)ISBN: 978-3-540-45587-5 (online)OAI: oai:DiVA.org:liu-110188DiVA: diva2:743412
4th International Symposium, PADL 2002, Portland, OR, USA, January 19–20, 2002