Skip navigation
Skip navigation

Counterexample-guided refinement of template polyhedra

Bogomolov, Sergiy; Frehse, Goran; Giacobbe, Mirco; Henzinger, Thomas A

Description

Template polyhedra generalize intervals and octagons to polyhedra whose facets are orthogonal to a given set of arbitrary directions. They have been employed in the abstract interpretation of programs and, with particular success, in the reachability analysis of hybrid automata. While previously, the choice of directions has been left to the user or a heuristic, we present a method for the automatic discovery of directions that generalize and eliminate spurious counterexamples. We show that for...[Show more]

CollectionsANU Research Publications
Date published: 2017
Type: Conference paper
URI: http://hdl.handle.net/1885/217937
Source: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
DOI: 10.1007/978-3-662-54577-5_34

Download

There are no files associated with this item.


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator