Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"bounded reachability"”.

  1. Compositional bounded reachability using time partitioning and abstraction

    Automatic verification of cyber-physical systems (CPS) typically involves computing the reachable set of states of such systems. This computation is known to be exponential in the number of continuous variables. For systems that can be decomposed into separate components with lower dimensionality, …

    uiuc Repository record for Compositional bounded reachability using time partitioning and abstraction (opens in a new tab)

  2. Strategies for SAT-Based Formal Verification

    … that they can be proven faster and interleave bounded reachability analysis with bounded model checking. We provide the necessary algorithms and implementation details in order to automate the proposed techniques. Experiments conducted on a variety of benchmark circuits show that orders of …

    vt Repository record for Strategies for SAT-Based Formal Verification (opens in a new tab)