A
Armando Tacchella
Researcher at University of Genoa
Publications - 135
Citations - 6356
Armando Tacchella is an academic researcher from University of Genoa. The author has contributed to research in topics: Solver & True quantified Boolean formula. The author has an hindex of 32, co-authored 128 publications receiving 6051 citations. Previous affiliations of Armando Tacchella include University of Freiburg & University of Geneva.
Papers
More filters
Book ChapterDOI
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
Alessandro Cimatti,Edmund M. Clarke,Enrico Giunchiglia,Fausto Giunchiglia,Marco Pistore,Marco Roveri,Roberto Sebastiani,Armando Tacchella +7 more
TL;DR: This paper describes version 2 of the NuSMV tool, a state-of-the-art symbolic model checker designed to be applicable in technology transfer projects and is robust and close to industrial systems standards.
Journal Article
NuSMV 2: An opensource tool for symbolic model checking
Alessandro Cimatti,Edmund M. Clarke,Enrico Giunchiglia,Fausto Giunchiglia,Marco Pistore,Marco Roveri,Roberto Sebastiani,Armando Tacchella +7 more
TL;DR: The NuSMV tool as mentioned in this paper is a symbolic model checker developed at CMU and designed to be applicable in technology transfer projects, it is a well structured, open, flexible and documented platform for model checking, and is robust and close to industrial systems standards.
Proceedings Article
Nusmv version 2: an opensource tool for symbolic model checking
Alessandro Cimatti,Edmund M. Clarke,Enrico Giunchiglia,Fausto Giunchiglia,Marco Pistore,Marco Roveri,Roberto Sebastiani,Armando Tacchella +7 more
Book ChapterDOI
An abstraction-refinement approach to verification of artificial neural networks
Luca Pulina,Armando Tacchella +1 more
TL;DR: A solution to verify their safety using abstractions to Boolean combinations of linear arithmetic constraints, and it is shown that whenever the abstract MLP is declared to be safe, the same holds for the concrete one.
Book ChapterDOI
Benefits of Bounded Model Checking at an Industrial Setting
Fady Copty,Limor Fix,Ranan Fraer,Enrico Giunchiglia,Gila Kamhi,Armando Tacchella,Moshe Y. Vardi +6 more
TL;DR: The usefulness of Bounded Model Checking based on propositional satisfiability (SAT) methods for bug hunting has already been proven in several recent work, but two industrial strength systems performing BMC for both verification and falsification are presented.