Search Results - "Nocco, Sergio"

  • Showing 1 - 19 results of 19
Refine Results
  1. 1
  2. 2
  3. 3

    A Novel SAT-Based Approach to the Task Graph Cost-Optimal Scheduling Problem by Nocco, Sergio, Quer, Stefano

    “…The task graph cost-optimal scheduling problem consists in scheduling a certain number of interdependent tasks onto a set of heterogeneous processors…”
    Get full text
    Journal Article
  4. 4

    Benchmarking a model checker for algorithmic improvements and tuning for performance by Cabodi, Gianpiero, Nocco, Sergio, Quer, Stefano

    Published in Formal methods in system design (01-10-2011)
    “…This paper describes a portfolio-based approach for model checking, i.e., an approach in which several model checking engines are orchestrated to reach the…”
    Get full text
    Journal Article
  5. 5

    Strengthening Model Checking Techniques With Inductive Invariants by Cabodi, G., Nocco, S., Quer, S.

    “…This paper describes optimized techniques to efficiently compute and reap benefits from inductive invariants within satisfiability (SAT)-based model checking…”
    Get full text
    Journal Article
  6. 6

    Partitioning Interpolant-Based Verification for Effective Unbounded Model Checking by Cabodi, G., Garcia, L.A., Murciano, M., Nocco, S., Quer, S.

    “…Interpolant-based model checking has been shown to be effective on large verification instances, as it efficiently combines automated abstraction and…”
    Get full text
    Journal Article
  7. 7

    Finding Multiple Equivalence-Preserving Transformations in Combinational Circuits through Incremental-SAT by Cabodi, Gianpiero, Dipietro, Leandro, Murciano, Marco, Nocco, Sergio

    Published in Journal of electronic testing (01-04-2010)
    “…This paper introduces an approach to effectively exploit incremental SAT in order to search for multiple equivalence-preserving transformations of…”
    Get full text
    Journal Article
  8. 8

    Are BDDs still alive within sequential verification? by CABODI, Gianpiero, NOCCO, Sergio, QUER, Stefano

    “…This work proposes a fully BDD-based approach based on: mixing forward and backward traversals, dovetailing approximate and exact methods, adopting guided and…”
    Get full text
    Conference Proceeding Journal Article
  9. 9

    Boosting the role of inductive invariants in model checking by Cabodi, Gianpiero, Nocco, Sergio, Quer, Stefano

    “…This paper focuses on inductive invariants in unbounded model checking to improve efficiency and scalability. First of all, it introduces optimized techniques…”
    Get full text
    Conference Proceeding
  10. 10

    Exploiting incrementality in SAT-based search for multiple equivalence-preserving transformations in combinational circuits by Cabodi, G., Dipietro, L., Murciano, M., Nocco, S.

    “…This paper introduces an approach to effectively exploit incremental SAT in order to search for multiple equivalence-preserving transformations of…”
    Get full text
    Conference Proceeding
  11. 11

    A BMC-based formulation for the scheduling problem of hardware systems by CABODI, Gianpiero, KONDRATYEV, Alex, LAVAGNO, Luciano, NOCCO, Sergio, QUER, Stefano, WATANABE, Yosinori

    “…Hardware scheduling is a well-known and well-studied problem. This paper defines a new SAT-based formulation of automata-based scheduling and proposes for the…”
    Get full text
    Conference Proceeding Journal Article
  12. 12

    Boosting the Role of Inductive Invariants in Model Checking by Cabodi, G., Nocco, S., Quer, S.

    “…This paper focuses on inductive invariants in unbounded model checking to improve efficiency and scalability. First of all, it introduces optimized techniques…”
    Get full text
    Conference Proceeding
  13. 13

    Improving SAT-based bounded model checking by means of BDD-based approximate traversals by Cabodi, G., Nocco, S., Quer, S.

    “…Binary Decision Diagrams (BDDs) have been widely used for hardware verification since the beginning of the '90s, whereas Boolean Satisfiability (SAT) has been…”
    Get full text
    Conference Proceeding
  14. 14

    Improving SAT-Based Bounded Model Checking by Means of BDD-Based Approximate Traversals by Cabodi, Gianpiero, Nocco, Sergio, Quer, Stefano

    “…Binary Decision Diagrams (BDDs) have been widely used for hardware verification since the beginning of the ý90s, whereas Boolean Satisfiability (SAT) has been…”
    Get full text
    Conference Proceeding
  15. 15

    Circuit Based Quantification: Back to State Set Manipulation within Unbounded Model Checking by Cabodi, Gianpiero, Crivellari, Marco, Nocco, Sergio, Quer, Stefano

    Published in Design, Automation and Test in Europe (07-03-2005)
    “…In this paper a non-canonical circuit-based state set representation is used to efficiently perform quantifier elimination. The novelty of this approach lies…”
    Get full text
    Conference Proceeding
  16. 16

    Boosting the role of inductive invariants in model checking by Cabodi, Gianpiero, Nocco, Sergio, Quer, Stefano

    “…This paper focuses on inductive invariants in unbounded model checking to improve efficiency and scalability…”
    Get full text
    Conference Proceeding
  17. 17

    Stepping forward with interpolants in unbounded model checking by Cabodi, Gianpiero, Murciano, Marco, Nocco, Sergio, Quer, Stefano

    “…This paper addresses SAT-based Unbounded Model Checking based on Craig Interpolants. This recently introduced methodology is often able to outperform BDDs and…”
    Get full text
    Conference Proceeding
  18. 18

    A BMC-Formulation for the Scheduling Problem in Highly Constrained Hardware Systems by Cabodi, Gianpiero, Nocco, Sergio, Quer, Stefano, Kondratiev, Alex, Lavagno, Luciano, Watanabe, Yosinori

    “…This paper describes a novel application for SAT-based Bounded Model Checking (BMC) within hardware scheduling problems. First of all, it introduces a new…”
    Get full text
    Journal Article
  19. 19

    A symbolic approach for the combined solution of scheduling and allocation by Cabodi, Gianpiero, Lazarescu, Mihai, Lavagno, Luciano, Nocco, Sergio, Passerone, Claudio, Quer, Stefano

    “…Scheduling is widely recognized as a very important step in high-level synthesis. Nevertheless, it is usually done without taking into account the effects on…”
    Get full text
    Conference Proceeding