Abstract
This paper proposes and applies novel techniques for formal verification of peephole optimizations in asynchronous circuits. We verify whether locally optimized modules can replace parts of an existing circuit under assumptions regarding the operation of the optimized modules in context. A verification rule related to assume-guarantee and hierarchical verification is presented, using relative timing constraints as optimization assumptions. We present the verification of speed-optimizations in an asynchronous arbiter as a case study.
Chapter PDF
Similar content being viewed by others
References
V. Akella and G. Gopalakrishnan. “SHILPA: A high-level synthesis system for self-timed circuits.” In Int. Conf: Computer-Aided Design (ICCAD), pp. 587–591, 1992.
R. Alur, T. Henzinger, F. Mang, S. Qadeer, S. Rajamani, and S. Tasiran. “MOCHA: modularity in model checking.” In Computer-Aided Verification (CAV), pp. 521–525, 1998.
E. Brunvand and R. F. Sproull. “Translating concurrent programs into delay-insensitive circuits.” In Int. Conf. Comput. Design, pp. 262–265, 1989.
E. M. Clarke, O. Grumberg, and D. E. Long. “Model checking and abstraction.” In Proc. Symp. on Principles of Programming Languages, pp. 343–354, 1992.
E. M. Clarke, D. E. Long, and K. L. McMillan. “Compositional Model Checking.” In Proc. Annual Symp. on Logic in Computer Science (LICS), pp. 353–362, 1989.
D. L. Dill. Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits. MIT press, 1989. (An ACM Distinguished Dissertation).
G. Gopalakrishnan. “Peephole Optimization of Asynchronous Macromodule networks.” IEEE Transitions on Very Large Scale Integration Systems, (7) 1: 1999.
M.R. Greenstreet and T. Ono-Tesfaye. “A fast, asP* RGD arbiter.” In Proc. Int. Symp. on Advanced Research on Asynchronous Circuits and Systems, pp. 173–85, 1999.
C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
Henzinger, S. Qadeer, and S. Rajamani. “You assume, We Guarantee: Methodology and Case Studies.” In Computer-aided Verification (CAV), pp. 440–451, 1998.
T. Henzinger, S. Qadeer, S. Rajamani, and S. Tasiran. “An Assume-Guarantee Rule for Checking Simulation.” In Proc. Int. Conf. on Formal Methods in Computer-aided Design (FMCAD), pp. 421–432, 1998.
S. Hauck. “Asynchronous design methodologies: an overview.” Proceedings of the IEEE, Vol. 83, pp: 69–93, 1995.
X. Kong, R. Negulescu. “Formal Verification of Pulse-Mode Asynchronous Circuits.” In Proc. Asia and South Pacific Design Automation Conference (ASP-DAC), Special Session on Asynchronous Circuits, pp. 347–352, 2001.
C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, and S. Bensalem. “Property preserving abstractions for the verification of concurrent systems.” Formal Methods in System Design, (6): 1–35, 1995.
K.L. McMillan. “A compositional rule for hardware design refinement.” In Computer-Aided Verification (CAV), pp 24–35, 1997.
C. E. Molnar, I. W. Jones, B. Coates, and J. Lexau. “A FIFO ring oscillator performance experiment.” In Proc. International Symposium on Advanced Research in Asynchronous Circuits and Systems, 1997.
R. Negulescu. Process Spaces and Formal Verification of Asynchronous Circuits. Ph.D. thesis, University of Waterloo, Canada, 1998.
R. Negulescu. “Process spaces.” In Proc. Int. Conf. on Concurrency Theory (CONCUR), pp. 196–210, 2000.
R. Negulescu and A. Peeters. “Verification of speed-dependences in single-rail handshake circuits.” In Proc. Int. Symp. on Advanced Research in Asynchronous Circuits and Systems, pp. 159–170, 1998.
J. Sifakis. “Property preserving homomorphisms of transition systems.” In Proc. 4th Workshop on Logics of Programs, June 1983.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 IFIP International Federation for Information Processing
About this paper
Cite this paper
Kong, X., Negulescu, R. (2001). Formal Verification of Peephole Optimizations in Asynchronous Circuits. In: Kim, M., Chin, B., Kang, S., Lee, D. (eds) Formal Techniques for Networked and Distributed Systems. FORTE 2001. IFIP International Federation for Information Processing, vol 69. Springer, Boston, MA. https://doi.org/10.1007/0-306-47003-9_14
Download citation
DOI: https://doi.org/10.1007/0-306-47003-9_14
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-7923-7470-1
Online ISBN: 978-0-306-47003-5
eBook Packages: Springer Book Archive