| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6871045 | Computer Languages, Systems & Structures | 2015 | 28 Pages |
Abstract
The Trapezoid Step Functions (TSF) domain is introduced in order to approximate continuous functions by a finite sequence of trapezoids, adopting linear functions to abstract the upper and the lower bounds of a continuous variable in each time slot. The lattice structure of TSFÂ is studied, showing how to build and compute a sound abstraction of a given continuous function. Experimental results underline the effectiveness of the approach in terms of both precision and efficiency with respect to the domain of Interval Valued Step Functions (IVSF).
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Agostino Cortesi, Giulia Costantini, Pietro Ferrara,