The following pages link to Roberto Bagnara (Q714502):
Displaying 30 items.
- A new look at the automatic synthesis of linear ranking functions (Q714505) (← links)
- Finite-tree analysis for constraint logic-based languages (Q817224) (← links)
- Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness (Q845242) (← links)
- Applications of polyhedral computations to the analysis and verification of hardware and software systems (Q1035700) (← links)
- A hierarchy of constraint systems for data-flow analysis of constraint logic-based languages (Q1380123) (← links)
- Set-sharing is redundant for pair-sharing (Q1605223) (← links)
- Correct approximation of IEEE 754 floating-point arithmetic for program verification (Q2152274) (← links)
- Exact join detection for convex polyhedra and other numerical abstractions (Q2269830) (← links)
- Precise widening operators for convex polyhedra (Q2568443) (← links)
- Not necessarily closed convex polyhedra and the double description method (Q2576576) (← links)
- (Q2767017) (← links)
- Exploiting Binary Floating-Point Representations for Constraint Propagation (Q2806863) (← links)
- Boolean Functions for Finite-Tree Dependencies (Q2996195) (← links)
- Grids: A Domain for Analyzing the Distribution of Numerical Values (Q3591087) (← links)
- (Q4411960) (← links)
- Soundness, idempotence and commutativity of set-sharing (Q4452614) (← links)
- Decomposing non-redundant sharing by complementation (Q4452616) (← links)
- (Q4494373) (← links)
- (Q4494374) (← links)
- A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages (Q4669646) (← links)
- Enhanced sharing analysis techniques: a comprehensive evaluation (Q4673538) (← links)
- cTI: a constraint-based termination inference tool for ISO-Prolog (Q4673545) (← links)
- (Q4778701) (← links)
- (Q4813407) (← links)
- A Unified Proof for the Convergence of Jacobi and Gauss–Seidel Methods (Q4835050) (← links)
- Coding guidelines for Prolog (Q4897704) (← links)
- An Improved Tight Closure Algorithm for Integer Octagonal Constraints (Q5452703) (← links)
- Static Analysis (Q5897425) (← links)
- Static Analysis (Q5897426) (← links)
- Verification, Model Checking, and Abstract Interpretation (Q5901909) (← links)
