Towards formal verification of analog designs

Gupta, Sarthak; Krogh, Bruce H.; Rutenbar, Rob A.

doi:10.1109/iccad.2004.1382573

Cited by 72 publications

(64 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Consider a tunnel-diode oscillator circuit [8]. It models the current I and the voltage drop V of a tunnel diode in parallel to the capacitor of a serial RLC circuit, which are in stable oscillation for the given parameters.…”

Section: Example: Tunnel-diode Oscillator Circuitmentioning

confidence: 99%

“…We propose methods to simplify polyhedra by limiting both the number of bits and contraints. The applicability of PHAVer and the effectiveness of the proposed methods are demonstrated with a navigation benchmark [7], and a tunnel diode circuit [8]. In addition to the reachability algorithm, PHAVer includes a separate engine for computing simulation relations between hybrid automata.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

PHAVer: Algorithmic Verification of Hybrid Systems Past HyTech

Frehse

2005

Lecture Notes in Computer Science

416

339

View full text Add to dashboard Cite

Abstract. In 1995, HyTech broke new ground as a potentially powerful tool for verifying hybrid systems -yet it has remained severely limited in its applicability to more complex systems. We address the main problems of HyTech with PHAVer, a new tool for the exact verification of safety properties of hybrid systems with piecewise constant bounds on the derivatives. Affine dynamics are handled by on-the-fly overapproximation and by partitioning the state space based on user-definable constraints and the dynamics of the system. PHAVer's exact arithmetic is robust due to the use of the Parma Polyhedra Library, which supports arbitrarily large numbers. To manage the complexity of the polyhedral computations, we propose methods to conservatively limit the number of bits and constraints of polyhedra. Experimental results for a navigation benchmark and a tunnel diode circuit show the effectiveness of the approach.

show abstract

Section: Example: Tunnel-diode Oscillator Circuitmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

PHAVer: Algorithmic Verification of Hybrid Systems Past HyTech

Frehse

2005

Lecture Notes in Computer Science

416

339

View full text Add to dashboard Cite

show abstract

“…5a, which has been used by many researchers (e.g., [19,21]) as a benchmark, will be used as an example throughout the paper to demonstrate each step of our methodology. The tunnel diodes exploit a phenomenon called resonant tunneling due to its negative resistance characteristic at very low forward bias voltages.…”

Section: Examplementioning

confidence: 99%

“…Variant approaches of the latter analysis were proposed. For instance, the model checking tools d/dt [18], Checkmate [19], and PHaver [20] were adapted and used in the verification of a biquad low-pass filter [18], a tunnel diode oscillator and a modulator [19], and voltage controlled oscillators [20]. In [21], the authors used intervals to construct the abstract state space, while using heuristics to identify possible transition between adjacent regions.…”

Section: B Analog Design Verificationmentioning

confidence: 99%

Integrating Abstraction Techniques for Formal Verification of Analog Designs

Zaki

Denman

Tahar

et al. 2009

Journal of Aerospace Computing, Information, and Communication

View full text Add to dashboard Cite

The verification of analog designs is a challenging and exhaustive task that requires deep understanding of physical behaviors. In this paper, we propose a qualitative-based predicate abstraction method for the verification of a class of nonlinear analog circuits. In the proposed method, system equations are automatically extracted from a circuit diagram by means of a bond graph. Verification is applied based on combining techniques from constraint solving and computer algebra along with symbolic model checking. Our methodology has the advantage of avoiding exhaustive simulation normally encountered in the verification of analog designs. To this end, we have used Dymola, Hsolver, SMV, and Mathematica to implement the verification flow. We illustrate the methodology on several analog examples including Colpitts and tunnel diode oscillators.

show abstract

“…This approach has been extended to verify timing properties of analog circuits in [8]. In [9], analog circuits were verified using the tool CheckMate, which computes an abstract transition relation between user-defined regions of the state space using polyhedral enclosures of the continuous trajectories. The tool named d/dt computes reachability by discrete-time integration over polyhedral sets of states, applied to analog circuits in [3].…”

Section: Introductionmentioning

confidence: 99%