Stefano Quer
Polytechnic University of Turin
101 Papers
790 Citations
Stefano Quer is an academic researcher from Polytechnic University of Turin. The author has contributed to research in topics: Model checking & Tree traversal. The author has an hindex of 16, co-authored 92 publications.
Chat about Author
Papers
Improved reachability analysis of large finite state machines
Gianpiero Cabodi,Paolo Camurati,Stefano Quer +2 more
- 10 Nov 1996
TL;DR: An optimized traversal technique particularly oriented to the exact exploration of the state space of large machines, and an effective use of secondary memory allows us to store relevant portions of BDDs and to regularize access to memory, resulting in less page faults.
Disjunctive partitioning and partial iterative squaring: an effective approach for symbolic traversal of large circuits
Gianpiero Cabodi,Paolo Camurati,Luciano Lavagno,Stefano Quer +3 more
- 13 Jun 1997
TL;DR: The overall algorithm aims at lowering the intermediate peak BDD size pushing further reachability analysis and on an improved iterativesquaring.
Improving SAT-Based Bounded Model Checking by Means of BDD-Based Approximate Traversals
Gianpiero Cabodi,Sergio Nocco,Stefano Quer +2 more
- 03 Mar 2003
TL;DR: This paper dovetail BDD and SAT based methods to improve the efficiency of BMC by exploiting inexpensive symbolic approximate reachability analysis to gather information on the state space and restricting the overall search space of SAT based BMC.
58
A Densely-Deployed, High Sampling Rate, Open-Source Air Pollution Monitoring WSN
Bartolomeo Montrucchio,Edoardo Giusto,Mohammad Ghazi Vakili,Stefano Quer,Renato Ferrero,Claudio Fornaro +5 more
TL;DR: A low-cost particulate matter monitoring system based on special-purpose acquisition boards deployed for monitoring air quality on both stationary and mobile sensor platforms is developed and proved to be extremely easy to calibrate, to offer a very high sample rate, and to be based on an open-source software architecture.
48
Can BDDs compete with SAT solvers on Bounded Model Checking
Gianpiero Cabodi,Paolo Camurati,Stefano Quer +2 more
- 10 Jun 2002
TL;DR: This work extends BDD-based verification to larger circuit and problem sizes, so that it can indeed compete with SAT based tools, and shows that BDDs are able to accomplish large verification tasks, and they can better cope with increasing sequential depths.