The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
On Discrete Modeling and Model Checking for Nonlinear Analog Systems
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Towards formal verification of analog designs
Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
PHAVer: algorithmic verification of hybrid systems past hytech
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Verification of analog/mixed-signal circuits using labeled hybrid petri nets
Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
A verification system for transient response of analog circuits
ACM Transactions on Design Automation of Electronic Systems (TODAES)
A symbolic methodology for the verification of analog and mixed signal designs
Proceedings of the conference on Design, automation and test in Europe
Verifying start-up conditions for a ring oscillator
Proceedings of the 18th ACM Great Lakes symposium on VLSI
Model checking of analog systems using an analog specification language
Proceedings of the conference on Design, automation and test in Europe
Review: Formal verification of analog and mixed signal designs: A survey
Microelectronics Journal
Instrumenting AMS assertion verification on commercial platforms
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
Theoretical Computer Science
First steps towards SAT-based formal analog verification
Proceedings of the 2009 International Conference on Computer-Aided Design
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Exact join detection for convex polyhedra and other numerical abstractions
Computational Geometry: Theory and Applications
Systematic simulation using sensitivity analysis
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Bounded model checking of analog and mixed-signal circuits using an SMT solver
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Analog/mixed-signal circuit verification using models generated from simulation traces
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Region stability proofs for hybrid systems
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Advanced methods for equivalence checking of analog circuits with strong nonlinearities
Formal Methods in System Design
Incremental computation of succinct abstractions for hybrid systems
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Formal verification of phase-locked loops using reachability analysis and continuization
Proceedings of the International Conference on Computer-Aided Design
Verifying dynamic properties of nonlinear mixed-signal circuits via efficient SMT-based techniques
Proceedings of the International Conference on Computer-Aided Design
Proceedings of the 2013 ACM international symposium on International symposium on physical design
Towards sensitivity analysis of hybrid systems using simulink
Proceedings of the 16th international conference on Hybrid systems: computation and control
Proceedings of the International Conference on Computer-Aided Design
| Hi-index | 0.00 |
Properties of analog circuits can be verified formally by partitioning the continuous state space and applying hybrid system verification techniques to the resulting abstraction. To verify properties of oscillator circuits, cyclic invariants need to be computed. Methods based on forward reachability have proven to be inefficient and in some cases inadequate in constructing these invariant sets. In this paper we propose a novel approach combining forward- and backward-reachability while iteratively refining partitions at each step. The technique can yield dramatic memory and runtime reductions. We illustrate the effectiveness by verifying, for the first time, the limit cycle oscillation behavior of a third-order model of a differential VCO circuit.