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.
[1]
Andrew Tolmach,et al.
Debugging standard ML
,
1992
.
[2]
Adrian Pop,et al.
Towards Comprehensive Meta-Modeling and Meta-Programming Capabilities in Modelica
,
2005
.
[3]
Peter Bunus,et al.
Debugging techniques for equation-based languages
,
2004
.
[4]
Peter Bunus,et al.
Debugging and Structural Analysis of Declarative Equation-Based Languages
,
2002
.
[5]
Mikael Pettersson.
Portable Debugging and Profiling
,
1998,
CC.
[6]
Peter Fritzson,et al.
The Open Source Modelica Project
,
2002
.
[7]
Peter A. Fritzson,et al.
Principles of object-oriented modeling and simulation with Modelica 2.1
,
2004
.