File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1080/23799927.2018.1535525
- Scopus: eid_2-s2.0-85057197355
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Article: Polyhedron over-approximation for complexity reduction in static analysis
Title | Polyhedron over-approximation for complexity reduction in static analysis |
---|---|
Authors | |
Keywords | Optimization problem formal verification polyhedral representation static analysis |
Issue Date | 2018 |
Publisher | Taylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/00207160.asp |
Citation | International Journal of Computer Mathematics, 2018, v. 3 n. 4, p. 215-229 How to Cite? |
Abstract | Polyhedra are widely used in the verification of numerical programs. Specially, in the field of static analysis by abstract interpretation to express the program invariants. Polyhedra make the analysis very expressive but also very time consuming. That cost is mostly due to the minimization function, which is used to maintain polyhedra in their minimal representation without redundant constraints or generators. In this article, we propose method to over-approximate a polyhedron by minimizing the loss of accuracy. The idea is to find a good trade off between accuracy and execution time. The proposed method is applied as an alternative to the minimization function for the template polyhedra abstract domain. |
Persistent Identifier | http://hdl.handle.net/10722/275055 |
ISSN | 2023 Impact Factor: 1.7 2023 SCImago Journal Rankings: 0.502 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Seladji, Y | - |
dc.contributor.author | Qu, Z | - |
dc.date.accessioned | 2019-09-10T02:34:30Z | - |
dc.date.available | 2019-09-10T02:34:30Z | - |
dc.date.issued | 2018 | - |
dc.identifier.citation | International Journal of Computer Mathematics, 2018, v. 3 n. 4, p. 215-229 | - |
dc.identifier.issn | 0020-7160 | - |
dc.identifier.uri | http://hdl.handle.net/10722/275055 | - |
dc.description.abstract | Polyhedra are widely used in the verification of numerical programs. Specially, in the field of static analysis by abstract interpretation to express the program invariants. Polyhedra make the analysis very expressive but also very time consuming. That cost is mostly due to the minimization function, which is used to maintain polyhedra in their minimal representation without redundant constraints or generators. In this article, we propose method to over-approximate a polyhedron by minimizing the loss of accuracy. The idea is to find a good trade off between accuracy and execution time. The proposed method is applied as an alternative to the minimization function for the template polyhedra abstract domain. | - |
dc.language | eng | - |
dc.publisher | Taylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/00207160.asp | - |
dc.relation.ispartof | International Journal of Computer Mathematics | - |
dc.rights | AOM/Preprint Before Accepted: his article has been accepted for publication in [JOURNAL TITLE], published by Taylor & Francis. AOM/Preprint After Accepted: This is an [original manuscript / preprint] of an article published by Taylor & Francis in [JOURNAL TITLE] on [date of publication], available online: http://www.tandfonline.com/[Article DOI]. Accepted Manuscript (AM) i.e. Postprint This is an Accepted Manuscript of an article published by Taylor & Francis in [JOURNAL TITLE] on [date of publication], available online: http://www.tandfonline.com/[Article DOI]. | - |
dc.subject | Optimization problem | - |
dc.subject | formal verification | - |
dc.subject | polyhedral representation | - |
dc.subject | static analysis | - |
dc.title | Polyhedron over-approximation for complexity reduction in static analysis | - |
dc.type | Article | - |
dc.identifier.email | Qu, Z: zhengqu@hku.hk | - |
dc.identifier.authority | Qu, Z=rp02096 | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1080/23799927.2018.1535525 | - |
dc.identifier.scopus | eid_2-s2.0-85057197355 | - |
dc.identifier.hkuros | 304640 | - |
dc.identifier.volume | 3 | - |
dc.identifier.issue | 4 | - |
dc.identifier.spage | 215 | - |
dc.identifier.epage | 229 | - |
dc.publisher.place | United Kingdom | - |
dc.identifier.issnl | 0020-7160 | - |