A Portable Debugger for Algorithmic Modelica Code
2005 (English)Conference paper (Refereed)
In this paper we present the first comprehensive debugger for the algorithmic subset of the Modelica language, which augments previous work in our group on declarative static and dynamic debugging of equations in Modelica. This replaces debugging of algorithmic code using primitive means such as print statements or asserts which is complex, time-consuming and errorprone. The debugger is portable since it is based on transparent source code instrumentation techniques that are independent of the implementation platform. The usual debugging functionality found in debuggers for procedural or traditional object-oriented languages is supported: setting and removing breakpoints, singlestepping, inspecting variables, back-trace of stack contents, tracing, etc.
Place, publisher, year, edition, pages
Modelica Association , 2005. 435-443 p.
IdentifiersURN: urn:nbn:se:liu:diva-30336Local ID: 15873OAI: oai:DiVA.org:liu-30336DiVA: diva2:251158
The 4th International Modelica Conference, Modelica2005.