A Formal Framework for Verification of Embedded Custom Memories of the Motorola MPC7450 Microprocessor

Abstract

In this presentation, we will deal with verification of custom designed embedded memories. Using our paradigm, one can abstract the behavior of a memory block by a couple of artifacts-one representing its contents, and another representing its interface. We make use of the well known behavioral model known as the Efficient Memory Model (EMM) [29,30] to represent contents of memories. We provide a methodology using which the behavior of a switch (or equivalently, transistor) level device can be specified using parameterized regular expressions. These entities can be used to abstractly describe the behavior of a bunch of switches that represent the interface of a memory. An automaton that we construct out of an abstract memory interface definition represents an abstraction of the memory interface itself. We show that such an automaton also forms a transducer that is a simulation model in a symbolic simulation environment. An EMM representing a memory core in conjunction with a transducer representing its interface is used as an abstraction of a complete memory during our automatic verification process.We also present a language formalism using which we show that the outputs from the transducers that are generated from the abstract specifications are weaker than or equal to the outputs defined by the regular expressions, in a partially ordered output space. We show that although the regular expressions are defined over exact and legal input strings, the transducers computed from them can provide outputs even when provided with weak or illegal input strings. This is an absolute necessity in order to have the capability to produce outputs when treated as a reactive system embedded in a symbolic simulation environment. Thus, we show that the simulation model generated by our technique is an conservative approximation of the corresponding abstract specification.We present a simple theory of composition that can be used to compose different simulation models used in our technique. Memories consisting of several ports result into several user-provided abstract specifications, which in turn result into several transducers that can be composed into a single transducer. That transducer in turn can be composed to a simulation model of an EMM. Our simple theory of composition also enables one to compose the abstract state space a memory core along with its ports with the concrete state space of the circuitry surrounding the memory core. We have shown that the composite simulation model representing the complete circuit has a partially ordered state space that (a) forms a complete lattice, and (b) that has a monotonic state transition function, that makes it suitable for being used in a symbolic simulation environment making use of Symbolic Trajectory Evaluation (STE) [27]. * Compatible with the PowerPC instruction set architecture. † This work was done when Andrew K. Martin was with Motorola Inc. BHADRA, MARTIN AND ABRAHAMThe verification paradigm used is STE. For Motorola high performance microprocessors, switch level models ...

Abstracting and verifying flash memories

“…1). Indeed, the bitcells are architected to operate over a limited sequence of certified stimulus patterns, each of which is validated by extensive analog SPICE simulation [5]. SPICE simulations are extensive and detailed, and cover various process corners and operating conditions.…”

A Mechanized Refinement Framework for Analysis of Custom Memories

“…Our framework has been inspired by recent efforts of Bhadra et al [3] on behaviorally formalizing transistor implementations of custom memories. They show how to abstract SRAM designs using parameterized regular expressions, and compare those abstractions with a high-level memory specification using STE.…”

“…For instance, the strength assignment procedure in ANAMOS produces a significant mismatch with detailed analog simulations for netlists containing transistors of closely matching but different strengths [3]. While these discrepancies can be ameliorated by designing more and more accurate analyzers [4], such an approach does not solve the fundamental problem of effectively representing inherently analog behaviors with equations in a discrete…”

“…The viability of the method is based on the observation that in an industrial design flow, custom memories are designed not as an ad-hoc transistor network but by interconnecting small, cohesive units such as bitcells, sense amplifiers, etc., with well-understood electrical properties in their range of operation. For instance, in Motorola's design flow, the units are carefully architected to operate over a limited sequence of certified stimulus patterns, each of which is validated by extensive analog SPICE simulation across various process corners and operating conditions [3]. Thus, it is natural to formalize the behavior of each unit as a state machine using guarded transitions that encode its operating constraints.…”

Authentication of forensic DNA samples

“…Parameterized regular expressions appeared in other applications as well, e.g., in phase-sequence prediction for dynamic memory allocation [13], or as a compact way to express a family of legal behaviors in hardware verification [14], or as a tool to state regular constraints in constraint satisfaction problems [15].…”