Stefano Quer

发表

A BMC-based formulation for the scheduling problem of hardware systems

Luciano Lavagno, Gianpiero Cabodi, Alex Kondratyev, 2004, International Journal on Software Tools for Technology Transfer.

Boosting interpolation with dynamic localized abstraction and redundancy removal

Gianpiero Cabodi, Sergio Nocco, Stefano Quer, 2008, TODE.

On-Going Research on Address Bus Encoding for Low Power: A Status Report

Cristina Silvano, Enrico Macii, Massimo Poncino, 1997 .

Tightening BDD-based approximate reachability with SAT-based clause generalization∗

Gianpiero Cabodi, Stefano Quer, Paolo Pasini, 2014, 2014 Design, Automation & Test in Europe Conference & Exhibition (DATE).

Graph Reachability on Parallel Many-Core Architectures

Stefano Quer, Andrea Calabrese, 2020 .

Improving the Efficiency of BDD--based operators through Partitioning

Gianpiero Cabodi, Stefano Quer, Paolo Camurati, 1999 .

Strengthening Model Checking Techniques With Inductive Invariants

Gianpiero Cabodi, Sergio Nocco, Stefano Quer, 2009, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

Improved reachability analysis of large finite state machines

Gianpiero Cabodi, Stefano Quer, Paolo Camurati, 1996, Proceedings of International Conference on Computer Aided Design.

Incremental re-encoding for symbolic traversal of product machines

Robert K. Brayton, Luciano Lavagno, Gianpiero Cabodi, 1996, Proceedings EURO-DAC '96. European Design Automation Conference with EURO-VHDL '96 and Exhibition.

Symbolic forward/backward traversals of large finite state machines

Gianpiero Cabodi, Stefano Quer, Paolo Camurati, 2000, J. Syst. Archit..

A graph‐labeling approach for efficient cone‐of‐influence computation in model‐checking problems with multiple properties

Gianpiero Cabodi, Stefano Quer, Paolo Camurati, 2016, Softw. Pract. Exp..

Cost-Aware Design and Simulation of Electrical Energy Systems

Enrico Macii, Sara Vinco, Stefano Quer, 2020, Energies.

Stressing Symbolic Scheduling Techniques within Aircraft Maintenance Optimization

Sergio Nocco, Stefano Quer, Viviana Bruno, 2008, J. Satisf. Boolean Model. Comput..

Detecting hard faults with combined approximate forward/backward symbolic techniques

Gianpiero Cabodi, Stefano Quer, Paolo Camurati, 1994, Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94.

Auxiliary Variables for Extending Symbolic Traversal Techniques to Data Paths

Gianpiero Cabodi, Stefano Quer, Paolo Camurati, 1994, 31st Design Automation Conference.

Detecting, Opening and Navigating through Doors: A Unified Framework for Human Service Robots

Tatsuya Harada, Stefano Quer, Francesco Savarese, 2019, ICSOFT.

Fast Cone-Of-Influence computation and estimation in problems with multiple properties

Stefano Quer, Denis Patti, Paolo Pasini, 2013, 2013 Design, Automation & Test in Europe Conference & Exhibition (DATE).

Improving symbolic reachability analysis by means of activityprofiles

Gianpiero Cabodi, Stefano Quer, Paolo Camurati, 2000, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

Cycle-based symbolic simulation of gate-level synchronous circuits

Valeria Bertacco, Stefano Quer, Maurizio Damiani, 1999, DAC '99.

Symbolic traversals of data paths with auxiliary variables

Gianpiero Cabodi, Stefano Quer, Paolo Camurati, 1994, Proceedings of 4th Great Lakes Symposium on VLSI.

Partitioning Interpolant-Based Verification for Effective Unbounded Model Checking

Gianpiero Cabodi, Sergio Nocco, Stefano Quer, 2010, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

A BMC-formulation for the scheduling problem in highly constrained hardware Systems

Luciano Lavagno, Gianpiero Cabodi, Alex Kondratyev, 2003, Electron. Notes Theor. Comput. Sci..

A parallel approach to symbolic traversal based on set partitioning

Massimo Poncino, Antonio Lioy, Gianpiero Cabodi, 1997, CHARME.

Enhancing FSM traversal by temporary re-encoding

Luciano Lavagno, Enrico Macii, Gianpiero Cabodi, 1996, Proceedings International Conference on Computer Design. VLSI in Computers and Processors.

Verification of Similar FSMs by Mixing Incremental Re-encoding, Reachability Analysis, and Combinational Checks

Robert K. Brayton, Luciano Lavagno, Gianpiero Cabodi, 2000, Formal Methods Syst. Des..

Service Robots: A Unified Framework for Detecting, Opening and Navigating Through Doors

Tatsuya Harada, Stefano Quer, Francesco Savarese, 2019, ICSOFT.

Computing subsets of equivalence classes for large FSMs

Gianpiero Cabodi, Stefano Quer, Paolo Camurati, 1995, Proceedings of EURO-DAC. European Design Automation Conference.

Circuit Based Quantification: A Probabilistic/Approximated Approach

Gianpiero Cabodi, Sergio Nocco, Stefano Quer, 2005 .

Memory Optimization in Function and Set Manipulation with BDDs

Gianpiero Cabodi, Stefano Quer, Paolo Camurati, 1998, Softw. Pract. Exp..

Computing timed transition relations for sequential cycle-based simulation

Gianpiero Cabodi, Stefano Quer, Claudio Passerone, 1999, DATE '99.

Reducing operation complexity in symbolic techniques through partitioning

Gianpiero Cabodi, Stefano Quer, Paolo Camurati, 1998, ISCAS '98. Proceedings of the 1998 IEEE International Symposium on Circuits and Systems (Cat. No.98CH36187).

Binary Decision Diagrams and the Multiple Variable Order Problem

Christoph Meinel, Anna Slobodová, Christian Stangier, 1998, Universität Trier, Mathematik/Informatik, Forschungsbericht.

A Greedy Approach to Answer Reachability Queries on DAGs pdf

Gianpiero Cabodi, Stefano Quer, Nicolas Boria, 2016, ArXiv.

Hardware Model Checking Competition 2014: An Analysis and Comparison of Solvers and Benchmarks

Armin Biere, Gianpiero Cabodi, Stefano Quer, 2014, J. Satisf. Boolean Model. Comput..

Circuit based quantification: back to state set manipulation within unbounded model checking

Gianpiero Cabodi, Sergio Nocco, Stefano Quer, 2005, Design, Automation and Test in Europe.

Advanced Programming and Problem-Solving Strategies in C. Part IV: Exam-Based Problems

Stefano Quer, 2017 .

Boosting the Role of Inductive Invariants in Model Checking

Gianpiero Cabodi, Sergio Nocco, Stefano Quer, 2007, 2007 Design, Automation & Test in Europe Conference & Exhibition.

The Maximum Common Subgraph Problem: A Parallel and Multi-Engine Approach

Giovanni Squillero, Stefano Quer, Andrea Marcelli, 2020, Comput..

Boosting the role of inductive invariants in model checking

Gianpiero Cabodi, Sergio Nocco, Stefano Quer, 2007 .

Cycle-based Symbolic Simulation of Synchronous Circuits

Valeria Bertacco, Stefano Quer, Maurizio Damiani, 1999, DAC 1999.

Speeding up model checking by exploiting explicit and hidden verification constraints

Gianpiero Cabodi, Sergio Nocco, Stefano Quer, 2009, 2009 Design, Automation & Test in Europe Conference & Exhibition.

Improving symbolic traversals by means of activity profiles

Gianpiero Cabodi, Stefano Quer, Paolo Camurati, 1999, DAC '99.

Decomposed symbolic forward traversals of large finite state machines

Gianpiero Cabodi, Stefano Quer, Paolo Camurati, 1996, Proceedings EURO-DAC '96. European Design Automation Conference with EURO-VHDL '96 and Exhibition.

System-level power optimization of special purpose applications: the Beach Solution

Luca Benini, Giovanni De Micheli, Enrico Macii, 1997, Proceedings of 1997 International Symposium on Low Power Electronics and Design.

A Smart Many-Core Implementation of a Motion Planning Framework along a Reference Path for Autonomous Cars

Gianpiero Cabodi, Stefano Quer, Paolo Camurati, 2019 .

Back to Basics: Solving Games with SAT

Stefano Quer, S. Quer, 2016 .

Model checking evaluation of airplane landing trajectories

Stefano Quer, 2013, International Journal on Software Tools for Technology Transfer.

To split or to group: from divide-and-conquer to sub-task sharing for verifying multiple properties in model checking

Gianpiero Cabodi, Stefano Quer, Denis Patti, 2017, International Journal on Software Tools for Technology Transfer.

BMC-based scheduling of hardware systems

Luciano Lavagno, Gianpiero Cabodi, Alex Kondratyev, 2005 .

Improving the efficiency of BDD-based operators by means of partitioning

Gianpiero Cabodi, Stefano Quer, Paolo Camurati, 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

Efficient state space pruning in symbolic backward traversal

Gianpiero Cabodi, Stefano Quer, Paolo Camurati, 1994, Proceedings 1994 IEEE International Conference on Computer Design: VLSI in Computers and Processors.

Extending equivalence class computation to large FSMs

Gianpiero Cabodi, Stefano Quer, Paolo Camurati, 1995, Proceedings of ICCD '95 International Conference on Computer Design. VLSI in Computers and Processors.

A Probabilistic and Approximated Approach to Circuit-Based Formal Verification

Sergio Nocco, Stefano Quer, S. Quer, 2008, J. Satisf. Boolean Model. Comput..

Dynamic scheduling and clustering in symbolic image computation

Gianpiero Cabodi, Stefano Quer, Paolo Camurati, 2002, Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition.

Advancements in Mixed BDD and SAT Techniques

Gianpiero Cabodi, Stefano Quer, G. Cabodi, 2004 .

Heuristic and exact techniques for aircraft maintenance scheduling

Sabrina Corpino, Stefano Quer, Sergio Chiesa, 2009 .

Symbolic exploration of large circuits with enhanced forward/backward traversals

Gianpiero Cabodi, Stefano Quer, Paolo Camurati, 1994, EURO-DAC '94.

Power optimization of core-based systems by address bus encoding

Luca Benini, Giovanni De Micheli, Enrico Macii, 1998, IEEE Trans. Very Large Scale Integr. Syst..

A 7/2-Approximation Algorithm for the Maximum Duo-Preservation String Mapping Problem

Gianpiero Cabodi, Stefano Quer, Nicolas Boria, 2016, CPM.

Interpolation sequences revisited

Gianpiero Cabodi, Sergio Nocco, Stefano Quer, 2011, 2011 Design, Automation & Test in Europe.

Transforming boolean relations by symbolic encoding

Gianpiero Cabodi, Stefano Quer, Paolo Camurati, 1995, CHARME.

Exploiting timed transition relations in sequential cycle-based simulation of embedded systems

Gianpiero Cabodi, Stefano Quer, Claudio Passerone, 2000 .

Efficient Complex High-Precision Computations on GPUs without Precision Loss

Gianluca Francini, Gianpiero Cabodi, Stefano Quer, 2017, J. Circuits Syst. Comput..

Mixing BDD and SAT techniques in Formal Verification

Gianpiero Cabodi, Sergio Nocco, Stefano Quer, 2005 .

Boolean Function Decomposition in Symbolic FSM Traversal

Gianpiero Cabodi, Stefano Quer, Paolo Camurati, 1993 .

PdTRAV Package Politecnico di Torino Reachability Analysis for Verification (Release 1.2)

Gianpiero Cabodi, Stefano Quer, 1999 .

Trading-Off SAT Search and Variable Quantifications for Effective Unbounded Model Checking

Gianpiero Cabodi, Sergio Nocco, Stefano Quer, 2008, 2008 Formal Methods in Computer-Aided Design.

Memory optimization in function and set manipulation with BDDs

Stefano Quer, Paolo Camurati, Giapiero Cabodi, 1998 .

Street Viewer: An Autonomous Vision Based Traffic Tracking System

Andrea Bottino, Stefano Quer, Carmelo Loiacono, 2016, Sensors.

Biasing symbolic search by means of dynamic activity profiles

Gianpiero Cabodi, Stefano Quer, Paolo Camurati, 2001, Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001.

Efficient Computation of Timed Transition Relations

Luciano Lavagno, Gianpiero Cabodi, Stefano Quer, 1998 .

Auxiliary variables for BDD-based representation and manipulation of Boolean functions

Gianpiero Cabodi, Stefano Quer, Paolo Camurati, 1998, TODE.

A Fast MPEG’s CDVS Implementation for GPU Featured in Mobile Devices

Stefano Quer, Alessandro Garbo, 2018, IEEE Access.

A Novel SAT-Based Approach to the Task Graph Cost-Optimal Scheduling Problem

Sergio Nocco, Stefano Quer, 2010, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

Exploiting Target Enlargement and Dynamic Abstraction within Mixed BDD and SAT Invariant Checking

Gianpiero Cabodi, Sergio Nocco, Stefano Quer, 2005, BMC@CAV.

Improving SAT-based bounded model checking by means of BDD-based approximate traversals

Gianpiero Cabodi, Sergio Nocco, Stefano Quer, 2003, 2003 Design, Automation and Test in Europe Conference and Exhibition.

Stepping forward with interpolants in unbounded model checking

Gianpiero Cabodi, Sergio Nocco, Stefano Quer, 2006, ICCAD.

A Parallel Many-core CUDA-based Graph Labeling Computation

Stefano Quer, 2020, ICSOFT.

Benchmarking a model checker for algorithmic improvements and tuning for performance

Gianpiero Cabodi, Sergio Nocco, Stefano Quer, 2011, Formal Methods Syst. Des..

Optimizing sequential verification by retiming transformations

Fabio Somenzi, Gianpiero Cabodi, Stefano Quer, 2000, Proceedings 37th Design Automation Conference.

CDVS feature selection on embedded systems

Massimo Balestri, Gianluca Francini, Stefano Quer, 2015, 2015 IEEE International Conference on Multimedia & Expo Workshops (ICMEW).

Accurate and Efficient Visual Search on Embedded Systems

Massimo Balestri, Gianluca Francini, Gianpiero Cabodi, 2015 .

Thread-based multi-engine model checking for multicore platforms

Gianpiero Cabodi, Sergio Nocco, Stefano Quer, 2013, TODE.

Full symbolic ATPG for large circuits

Gianpiero Cabodi, Stefano Quer, Paolo Camurati, 1994, Proceedings., International Test Conference.

Verification and synthesis of counters based on symbolic techniques

Luciano Lavagno, Gianpiero Cabodi, Stefano Quer, 1997, Proceedings European Design and Test Conference. ED & TC 97.

A symbolic approach for the combined solution of scheduling and allocation

Luciano Lavagno, Mihai T. Lazarescu, Gianpiero Cabodi, 2002, 15th International Symposium on System Synthesis, 2002..

Mixing Forward and Backward Traversals in Guided-Prioritized BDD-Based Verification

Gianpiero Cabodi, Sergio Nocco, Stefano Quer, 2002, CAV.

The Maximum Common Subgraph Problem: A Portfolio Approach pdf

Giovanni Squillero, Stefano Quer, Andrea Marcelli, 2019, ArXiv.

Disjunctive partitioning and partial iterative squaring: an effective approach for symbolic traversal of large circuits

Luciano Lavagno, Gianpiero Cabodi, Stefano Quer, 1997, DAC.

Advanced Programming and Problem-Solving Strategies in C. Part II: Algorithms and Data Structures

Stefano Quer, 2017 .

Can BDDs compete with SAT solvers on bounded model checking?

Gianpiero Cabodi, Stefano Quer, Paolo Camurati, 2002, DAC '02.

Moving Object Detection in Heterogeneous Conditions in Embedded Systems

Stefano Quer, Alessandro Garbo, S. Quer, 2017, Sensors.

Reachability analysis of large circuits using disjunctive partitioning and partial iterative squaring

Gianpiero Cabodi, Stefano Quer, Paolo Camurati, 2001, J. Syst. Archit..

Are BDDs still alive within sequential verification?

Gianpiero Cabodi, Sergio Nocco, Stefano Quer, 2004, International Journal on Software Tools for Technology Transfer.

Modules and Techniques for Motion Planning: An Industrial Perspective

Stefano Quer, Luz Garcia, S. Quer, 2021, Sensors.

Smart Techniques for Flying-probe Testing

Giovanni Squillero, Stefano Quer, Andrea Calabrese, 2021, ICSOFT.

Improving Symboli Traversals by means of A tivity Pro

Gianpiero Cabodi, Stefano Quer, Paolo Camurati, 1999 .

To split or to group: from divide-and-conquer to sub-task sharing in verifying multiple properties

Stefano Quer, Denis Patti, Paolo Camurati, 2014 .

Incremental FSM Re-encoding for Simplifying Verification by Symbolic Traversal

Robert K. Brayton, Luciano Lavagno, Gianpiero Cabodi, 1995 .