liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Semantics guided filtering of combinatorial graph transformations in declarative equation-based languages
Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
Linköping University, Department of Computer and Information Science, PELAB - Programming Environment Laboratory. Linköping University, The Institute of Technology.ORCID iD: 0000-0002-3435-4996
2002 (English)In: Source Code Analysis and Manipulation, 2002, 2002, 163-172 p.Conference paper, Published paper (Refereed)
Abstract [en]

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.
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
URN: urn:nbn:se:liu:diva-110194DOI: 10.1109/SCAM.2002.1134116ISBN: 0-7695-1793-5 (print)OAI: oai:DiVA.org:liu-110194DiVA: diva2:743459
Conference
2nd International Workshop on Source Code Analysis and Manipulation (SCAM’2002), Montreal, Canada, 1 October 2002
Available from: 2014-09-04 Created: 2014-09-04 Last updated: 2014-10-20Bibliographically approved

Open Access in DiVA

fulltext(275 kB)72 downloads
File information
File name FULLTEXT01.pdfFile size 275 kBChecksum SHA-512
04a460da64eca1df220342cda0b6c03bc722c2913394f2575ca58483c0fe312df79bc76319c9ecb0df7ccdb4e26691c38fe970c54a2717ac45c5a1d7353637ca
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Authority records BETA

Bunus, PeterFritzson, Peter

Search in DiVA

By author/editor
Bunus, PeterFritzson, Peter
By organisation
Department of Computer and Information ScienceThe Institute of TechnologyPELAB - Programming Environment Laboratory
Electrical Engineering, Electronic Engineering, Information Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 72 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 65 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf