Incrementally closing octagons
Formal Methods in System Design · 2019-11 · 54 (2) · 232-277
DOI: 10.1007/s10703-017-0314-7 ↗Kurz gefasst
Fachartikel in der Zeitschrift Formal Methods in System Design, online erschienen am 24.01.2018. Verfasst von Aziem Chawdhary und 2 weiteren Autor:innen. Die Arbeit wurde bisher 8-mal zitiert (Crossref) und nennt 36 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Engineering and Physical Sciences Research Council.
Abstract (Originalsprache)
The octagon abstract domain is a widely used numeric abstract domain expressing relational information between variables whilst being both computationally efficient and simple to implement. Each element of the domain is a system of constraints where each constraint takes the restricted form ±xi±xj≤c\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\pm \, x_i \pm x_j \le c$$\end{document}. A key family of operations for the octagon domain are closure algorithms, which check satisfiability and provide a normal form for octagonal constraint systems. We present new quadratic incremental algorithms for closure, strong closure and integer closure and proofs of their correctness. We highlight the benefits and measure the performance of these new algorithms.
Förderung
- Engineering and Physical Sciences Research Council
Zitieren
APA
Chawdhary, A., Robbins, E., & King, A. (2019). Incrementally closing octagons. Formal Methods in System Design, 54(2), 232-277. https://doi.org/10.1007/s10703-017-0314-7
Vancouver
Chawdhary A, Robbins E, King A. Incrementally closing octagons. Formal Methods in System Design. 2019;54(2):232-277. doi:10.1007/s10703-017-0314-7
BibTeX
@article{Chawdhary2019,
author = {Chawdhary, Aziem and Robbins, Ed and King, Andy},
title = {Incrementally closing octagons},
journal = {Formal Methods in System Design},
year = {2019},
volume = {54},
number = {2},
pages = {232--277},
doi = {10.1007/s10703-017-0314-7}
}
EUVIMED