论文信息 - Verification of timed circuits with symbolic delays

Verification of timed circuits with symbolic delays

Verifying timed circuits is a complex problem even when the delays of the system are fixed. This paper deals with a more challenging problem, the formal verification of timed circuits with unspecified delays represented as symbols. The approach discovers a set of sufficient linear constraints on the symbols that guarantee the correctness of the circuit. Experimental results from the area of asynchronous circuits show the applicability of the approach.

Jordi Cortadella | Robert Clarisó | R. Clarisó | J. Cortadella

[1] Supratik Chakraborty,et al. Min-max timing analysis and an application to asynchronous circuits , 1999, Proc. IEEE.

[2] Gaetano Borriello,et al. Symbolic timing verification of timing diagrams using Presburger formulas , 1997, DAC.

[3] Ahmed Bouajjani,et al. Symbolic Techniques for Parametric Reasoning about Counter and Clock Systems , 2000, CAV.

[4] Nicolas Halbwachs,et al. Automatic discovery of linear restraints among variables of a program , 1978, POPL.

[5] Patrick Cousot,et al. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[6] H. Peter Hofstee,et al. Timed circuit verification using TEL structures , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7] Ivan E. Sutherland,et al. GasP: a minimal FIFO control , 2001, Proceedings Seventh International Symposium on Asynchronous Circuits and Systems. ASYNC 2001.

[8] A.L. Sangiovanni-Vincentelli,et al. Synthesis of hazard-free asynchronous circuits with bounded wire delays , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[9] Nagisa Ishiura,et al. Coded time-symbolic simulation using shared binary decision diagram , 1991, DAC '90.