Semantics guided filtering of combinatorial graph transformations in declarative equation-based languages
2002 (English)In: Source Code Analysis and Manipulation, 2002, 2002, 163-172 p.Conference paper (Refereed)
This paper concerns the use of static analysis for debugging purposes of declarative object-oriented equation-based modeling languages. We propose a framework where over- and under-constraining situations present in simulation models specified in such languages are detected by combinatorial graph transformations performed on the flattened intermediate code and filtered by the semantic transformation rules derived from the original language. This is powerful enough to statically detect a broad range of errors without having to execute the simulation model. Debuggers associated with simulation environments for such languages can provide efficient error-fixing strategies based on the graph-based representation of the intermediate code. The emphasis, in this paper, is on detecting and debugging over-constraining equations, which are present in some simulation model specifications. We discuss various ways in which we have extended our approach to allow static global analysis of the original modeling source code.
Place, publisher, year, edition, pages
2002. 163-172 p.
Electrical Engineering, Electronic Engineering, Information Engineering
IdentifiersURN: urn:nbn:se:liu:diva-110194DOI: 10.1109/SCAM.2002.1134116ISBN: 0-7695-1793-5OAI: oai:DiVA.org:liu-110194DiVA: diva2:743459
2nd International Workshop on Source Code Analysis and Manipulation (SCAM’2002), Montreal, Canada, 1 October 2002