An Improved Tight Closure Algorithm for Integer Octagonal Constraints-Reference-Cited by-同舟云学术

An Improved Tight Closure Algorithm for Integer Octagonal Constraints

Published: Issue: Volume: Page:8-21
ISSN:
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Bagnara Roberto,Hill Patricia M.,Zaffanella Enea

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-78163-9_6.pdf

Reference23 articles.

1. Lecture Notes in Computer Science;R. Bagnara,2007

2. Lecture Notes in Computer Science;P.M. Hill,2005

3. Bagnara, R., et al.: Widening operators for weakly-relational numeric abstractions. Quaderno 399, Dipartimento di Matematica, Università di Parma, Italy (2005), http://www.cs.unipr.it/Publications/

4. Bagnara, R., Hill, P.M., Zaffanella, E.: The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems. Quaderno 457, Dipartimento di Matematica, Università di Parma, Italy (2006), http://www.cs.unipr.it/Publications/ , also pulished as arXiv:cs.MS/0612085, http://arxiv.org/

5. ACM SIGPLAN Notices;V. Balasundaram,1989

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Octagons Revisited;Static Analysis;2023

2. Incrementally closing octagons;Formal Methods in System Design;2018-01-24

3. A certifying algorithm for lattice point feasibility in a system of UTVPI constraints;Journal of Combinatorial Optimization;2017-09-27

4. Tutorial on Static Inference of Numeric Invariants by Abstract Interpretation;Foundations and Trends® in Programming Languages;2017

5. A Combinatorial Certifying Algorithm for Linear Feasibility in UTVPI Constraints;Algorithmica;2016-04-28