Alberto Griggio

Alberto Griggio

Auto-generated profile, based on publicly available information

Alberto Griggio

Fondazione Bruno Kessler

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
31 July 2018 in ACM Transactions on Computational Logic
Verified
Journal Article
Open access
ACAlessandro Cimatti
Alessandro Cimatti
AGAlberto Griggio
Alberto Griggio
AIAhmed Irfan
Ahmed Irfan
Marco RoveriMarco Roveri
Marco Roveri
RSRoberto Sebastiani
Roberto Sebastiani
Satisfiability Modulo Theories (SMT) is the problem of deciding the satisfiability of a first-order formula with respect to some theory or combination of theories; Verification Modulo Theories (VMT) is the problem of analyzing the reachability for transition systems represented in terms of SMT formulae. In this article, we tackle the problems of SMT and VMT over the theories of nonlinear arithmetic over the reals (NRA) and of NRA augmented with transcendental (exponential and trigonometric) functions (NTA). We propose a new abstraction-refinement approach for SMT and VMT on NRA or NTA, called Incremental Linearization . The idea is to abstract nonlinear multiplication and transcendental functions as uninterpreted functions in an abstract space limited to linear arithmetic on the rationals with uninterpreted functions. The uninterpreted functions are incrementally axiomatized by means of upper- and lower-bounding piecewise-linear constraints. In the case of transcendental functions, particular care is required to ensure the soundness of the abstraction. The method has been implemented in the M ath SAT SMT solver and in the nu X mv model checker. An extensive experimental evaluation on a wide set of benchmarks from verification and mathematics demonstrates the generality and the effectiveness of our approach.

23 September 2016 in Formal Methods in System Design
Verified
Journal Article
Closed access
PDF file
ACAlessandro Cimatti
Alessandro Cimatti
AGAlberto Griggio
Alberto Griggio
SMSergio Mover
Sergio Mover
STStefano Tonetta
Stefano Tonetta

20 December 2013 in Formal Methods in System Design
Verified
Journal Article
Open access
MBMartin Brain
Martin Brain
VDVijay D’silva
Vijay D’silva
AGAlberto Griggio
Alberto Griggio
LHLeopold Haller
Leopold Haller
DKDaniel Kroening
Daniel Kroening

1 January 2012 in Journal on Satisfiability, Boolean Modeling and Computation
Verified
Journal Article
Open access
PDF file
AGAlberto Griggio
Alberto Griggio
We present a detailed description of a theory solver for Linear Integer Arithmetic ( LA ( Z ) ) in a lazy SMT context. Rather than focusing on a single technique that guarantees theoretical completeness, the solver makes extensive use of layering and

17 July 2023
Verified
Book Chapter
Open access
PDF file
AGAlberto Griggio
Alberto Griggio
MJMartin Jonáš
Martin Jonáš
This paper describes , a tool for the verification of imperative programs. operates on an intermediate verification language called , with a formally-specified semantics based on smt, allowing the specification of both reachability and liveness properties. It integrates several state-of-the-art verification engines based on sat and smt. Moreover, it provides additional functionalities such as a flexible Python api, a customizable C front-end, generation of counterexamples, support for simulation and symbolic execution, and translation into multiple low-level verification formalisms. Our experimental analysis shows that is competitive with state-of-the-art software verifiers on a large range of programs. Thanks to its flexibility, has already been used in various industrial projects and academic publications, both as a verification back-end and as a benchmark generator.

1 June 2020 in Information and Computation
Verified
Journal Article
Open access
ACAlessandro Cimatti
Alessandro Cimatti
AGAlberto Griggio
Alberto Griggio
EMEnrico Magnago
Enrico Magnago
Marco RoveriMarco Roveri
Marco Roveri
STStefano Tonetta
Stefano Tonetta