Reasoning about digital systems using temporal logic

Authors:
S. Bapat;G. Venkatesh
Affiliations:
Dept. of Computer SC. & Engg., Indian Institute of Technology, Bombay;Solid State Electronics Group, Tata Institute of Fundamental Research, Bombay
Venue:
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Year:
1986

Citing 3
Cited 1

Graph algorithms and NP-completeness

Graph algorithms and NP-completeness
Introduction to VLSI Systems

Introduction to VLSI Systems
A Decision Method for Temporal Logic Based on Resolution

Proceedings of the Fifth Conference on Foundations of Software Technology and Theoretical Computer Science

Dynamic Functional Testing for VLSI Circuits

IEEE Design & Test

Quantified Score

Hi-index	0.01

Visualization

Abstract

Temporal logic is proposed as a medium to describe the timing behaviour of digital systems. Queries on the timing properties of the digital systems can then be answered by testing the satisfiability of appropriately constructed temporal formulae. We suggest ways of improving the standard tableau method of testing the satisfiability of these formulae, and discuss results obtained from an implementation of this method. We claim that this can serve as a designers assistant to debug designs.