Abstract
Accurate evaluation of delays of combinatorial circuits is crucial in circuit verification and design. In this paper we present a logical approach to timing analysis which allows us to compute exact stabilization bounds while proving the correctness of the boolean behavior.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
D.A. Basin and N. Klarlund. Automata based symbolic reasoning in hardware verification. Formal Methods in Systems Design, 13(3):255–288, 1998.
J. Brzozowski and M. Yoeli. Ternary simulation of binary gate networks. In J. M. Dunn and G. Epstein, editors, Modern Uses of Multiple-Valued Logic, pages 41–50. D. Reidel, 1977.
A. Chagrov and M. Zakharyaschev. Modal Logic. Oxford University Press, 1997.
C.T. Gray, W. Liu, R.K. CavinIII, and H.-Y. Hsieh. Circuit delay calculation considering data dependent delays. INTEGRATION, The VLSI Journal, 17:1–23, 1994.
S. Malik. Analysis of Cyclic Combinational Circuits. In IEEE /ACM International Conference on CAD, pages 618–627. ACM/IEEE, IEEE Computer Society Press, 1993.
Ju.T. Medvedev. Interpretation of logical formulas by means of finite problems and its relation to the realizability theory. Soviet Mathematics Doklady, 4:180–183, 1963.
M. Mendler. A timing refinement of intuitionistic proofs and its application to the timing analysis of combinational circuits. In P. Miglioli, U. Moscato, D. Mundici, and M. Ornaghi, editors, Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods, pages 261–277. Springer, LNAI 1071, 1996.
M. Mendler. Characterising combinational timing analyses in intuitionistic modal logic. Logic Journal of the IGPL, 8(6):821–852, 2000.
M. Mendler. Timing analysis of combinational circuits in intuitionistic propositional logic. Formal Methods in System Design, 17(1):5–37, 2000.
P. Miglioli, U. Moscato, M. Ornaghi, S. Quazza, and G. Usberti. Some results on intermediate constructive logics. Notre Dame Journal of Formal Logic, 30(4):543–562, 1989.
P. Miglioli, U. Moscato, M. Ornaghi, and G. Usberti. A constructivism based on classical truth. Notre Dame Journal of Formal Logic, 30(1):67–90, 1989.
D. Prawitz. Natural Deduction. Almquist and Winksell, 1965.
R.H. Thomason. A semantical study of constructible falsity. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 15:247–257, 1969.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ferrari, M., Fiorentini, C., Ornaghi, M. (2002). Extracting Exact Time Bounds from Logical Proofs. In: Pettorossi, A. (eds) Logic Based Program Synthesis and Transformation. LOPSTR 2001. Lecture Notes in Computer Science, vol 2372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45607-4_14
Download citation
DOI: https://doi.org/10.1007/3-540-45607-4_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43915-8
Online ISBN: 978-3-540-45607-0
eBook Packages: Springer Book Archive