mdh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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
Fully Bounded Polyhedral Analysis of Integers with Wrapping
Mälardalen University, School of Innovation, Design and Engineering.ORCID iD: 0000-0001-9341-4031
Mälardalen University, School of Innovation, Design and Engineering.ORCID iD: 0000-0001-5297-6548
Tidorum Ltd, Helsinki, Finland.
2011 (English)In: Electronical Notes in Theoretical Computer Science, ISSN 1571-0661, E-ISSN 1571-0661, Vol. 288, p. 3-13Article in journal (Refereed) Published
Abstract [en]

analysis technique to discover linear relationships among variables in a program. However, the classical way of performing polyhedral analysis does not model the fact that values typically are stored as fixed-size binary strings and usually have a wrap-around semantics in the case of overflows. In embedded systems where 16-bit or even 8-bit processors are used, wrapping behaviour may even be used intentionally. Thus, to accurately and correctly analyse such systems, the wrapping has to be modelled. We present an approach to polyhedral analysis which derives polyhedra that are bounded in all dimensions and thus provides polyhedra that contain a finite number of integer points. Our approach uses a previously suggested wrapping technique for polyhedra but combines it in a novel way with limited widening, a suitable placement of widening points and restrictions on unbounded variables. We show how our method has the potential to significantly increase the precision compared to the previously suggested wrapping method.

Place, publisher, year, edition, pages
2011. Vol. 288, p. 3-13
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:mdh:diva-13595DOI: 10.1016/j.entcs.2012.10.003Scopus ID: 2-s2.0-84870403479OAI: oai:DiVA.org:mdh-13595DiVA, id: diva2:466138
Available from: 2011-12-15 Created: 2011-12-15 Last updated: 2017-12-08Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Bygde, StefanLisper, Björn

Search in DiVA

By author/editor
Bygde, StefanLisper, BjörnHolsti, Niklas
By organisation
School of Innovation, Design and Engineering
In the same journal
Electronical Notes in Theoretical Computer Science
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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