On Deducing Timing Constraints in the Verification of Interfaces

  • Authors:
  • F. Mavaddat;T. Gahlinger

  • Affiliations:
  • Department of Computer Science, University of Waterloo, Waterloo, Ontario;Tony Gahlinger & Associates Inc. Waterloo, Ontario, Canada

  • Venue:
  • Formal Methods in System Design
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

We formulate several device timing characteristics, andintroduce the concept of separation bounds to modeldevices‘ waveform timing specifications. Separation bounds areused to verify that the produced timings of one device‘s signalssatisfy the required timings of another device to which it is tobe connected. We show that even if we know the bounds on twopairs of signal events, say (u, v) and (v, w), we cannotalways deduce the correct bounds on (u, w). However, we showthat the shortest path method proposed in [4]—to deducetight constraints from a partial specification—is safe, in thesense that an affirmative answer to satisfiability istrustworthy while a negative answer may be pessimistic.