liu.seSearch for publications in DiVA
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Semantics guided filtering of combinatorial graph transformations in declarative equation-based languages
Linköpings universitet, Institutionen för datavetenskap. Linköpings universitet, Tekniska högskolan.
Linköpings universitet, Institutionen för datavetenskap, PELAB - Laboratoriet för programmeringsomgivningar. Linköpings universitet, Tekniska högskolan.ORCID-id: 0000-0002-3435-4996
2002 (engelsk)Inngår i: Source Code Analysis and Manipulation, 2002, 2002, s. 163-172Konferansepaper, Publicerat paper (Fagfellevurdert)
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.

sted, utgiver, år, opplag, sider
2002. s. 163-172
HSV kategori
Identifikatorer
URN: urn:nbn:se:liu:diva-110194DOI: 10.1109/SCAM.2002.1134116ISBN: 0-7695-1793-5 (tryckt)OAI: oai:DiVA.org:liu-110194DiVA, id: diva2:743459
Konferanse
2nd International Workshop on Source Code Analysis and Manipulation (SCAM’2002), Montreal, Canada, 1 October 2002
Tilgjengelig fra: 2014-09-04 Laget: 2014-09-04 Sist oppdatert: 2014-10-20bibliografisk kontrollert

Open Access i DiVA

fulltext(275 kB)120 nedlastinger
Filinformasjon
Fil FULLTEXT01.pdfFilstørrelse 275 kBChecksum SHA-512
04a460da64eca1df220342cda0b6c03bc722c2913394f2575ca58483c0fe312df79bc76319c9ecb0df7ccdb4e26691c38fe970c54a2717ac45c5a1d7353637ca
Type fulltextMimetype application/pdf

Andre lenker

Forlagets fulltekst

Personposter BETA

Bunus, PeterFritzson, Peter

Søk i DiVA

Av forfatter/redaktør
Bunus, PeterFritzson, Peter
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar
Totalt: 120 nedlastinger
Antall nedlastinger er summen av alle nedlastinger av alle fulltekster. Det kan for eksempel være tidligere versjoner som er ikke lenger tilgjengelige

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 96 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf