#### Filter Results:

- Full text PDF available (65)

#### Publication Year

1992

2017

- This year (1)
- Last 5 years (10)
- Last 10 years (21)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
- Sci. Comput. Program.
- 2008

ions for the Analysis and Verification of Hardware and Software Systems â‹† Roberto Bagnara , Patricia M. Hill , Enea Zaffanella a Department of Mathematics, University of Parma, Italy School ofâ€¦ (More)

Convex polyhedra constitute the most used abstract domain among those capturing numerical relational information. Since the domain of convex polyhedra admits infinite ascending chains, it has to beâ€¦ (More)

The domain of convex polyhedra is employed in several systems for the analysis and verification of hardware and software components. Current applications span imperative, functional and logicâ€¦ (More)

- Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
- International Journal on Software Tools forâ€¦
- 2004

The finite powerset construction upgrades an abstract domain by allowing for the representation of finite disjunctions of its elements. While most of the operations on the finite powerset abstractâ€¦ (More)

Although the usual goal of sharing analysis is to detect which pairs of variables share, the standard choice for sharing analysis is a domain that characterizes set-sharing. In this paper, weâ€¦ (More)

This paper explores the abstract domain of grids, a domain that is able to represent sets of equally spaced points and hyperplanes over an n-dimensional vector space. Such a domain is useful for theâ€¦ (More)

- Roberto Bagnara, Peter Schachte
- APPIA-GULP-PRODE
- 1998

The subject of groundness analysis for (constraint) logic programs has been widely studied, and interesting domains have been proposed. Pos has been recognized as the most suitable domain forâ€¦ (More)

- Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
- VMCAI
- 2008

Integer octagonal constraints (a.k.a. Unit Two Variables Per Inequality or UTVPI integer constraints) constitute an interesting class of constraints for the representation and solution of integerâ€¦ (More)

- Roberto Bagnara, FrÃ©dÃ©ric Mesnard, Andrea Pescetti, Enea Zaffanella
- Inf. Comput.
- 2012

The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking functions areâ€¦ (More)

- Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
- Formal Methods in System Design
- 2009

Weakly-relational numeric constraints provide a compromise between complexity and expressivity that is adequate for several applications in the field of formal analysis and verification of softwareâ€¦ (More)