Manipulating logical organization with system factorizations

Johnson, Steven D.

doi:10.1007/0-387-97226-9_33

Cited by 14 publications

(4 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…3. Adequate rules for DDD transformations on stream networks [7]. The ∆ in the replacement rule stands for the underlying type theory.…”

Section: Foundational Issues In Logicmentioning

confidence: 99%

View from the Fringe of the Fringe

Johnson

2001

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Formal analysis remains outside the mainstream of system design practice. Interactive methods and tools are regarded by some to be on the margin of useful research in this area. Although it may seem relatively academic to some, it is vital that this the so-called "theorem proving approach" continue to be as vigorously explored as approaches favoring highly automated reasoning. Design derivation, a term for design formalisms based on transformations and equivalence, represents just a small twig on the theorem-proving branch of formal system analysis. A perspective on current trends is presented from this remote outpost, including a review of the author's work since the early 1980s.

show abstract

“…3. Adequate rules for DDD transformations on stream networks [7]. The ∆ in the replacement rule stands for the underlying type theory.…”

Section: Foundational Issues In Logicmentioning

confidence: 99%

View from the Fringe of the Fringe

Johnson

2001

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…Operations were encapsulated in modules and complex components such as the memory, register file, ALU, incrementor, and decrementor were factored from the description [13]. The isolation of components into abstract modules provides a mechanism by which individual components can be verified.…”

Section: Structure To Architecturementioning

confidence: 99%

DDD-FM9001: Derivation of a verified microprocessor

Bose

Johnson

1993

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. The DDD-FMgO01 is a 32-bit general purpose microprocessor formally derived directly from Hunt's mechanically verified Nqthm FM9001 microprocessor specification. The exercise was part of a project to construct an implementation of the FM9001 by applying the DDD design derivation system to the Nqthm FM9001 specification. The main thesis of this work maintains that derivation and verification represent interdependent facets of design and must be integrated if formal methods are to support the natural analytical and generative reasoning that takes place in engineering practice. In this paper we describe the continuation of previous work in which the DDD system was applied to Hunt's FM8501 specification. This paper describes the derivation of the DDD-FM9001 and compares the derived architecture and hardware realization with that of the FM9001 in an effort to better understand the interplay between derivation and verification.

show abstract

“…Our tools constitute a set of transformations that are used to engineer an implementation from a specification, with each transformation accumulating information about the implementation. In a functional framework, a transformation called system factorization [2] was used earlier to extract functional components having naive interactions with the surrounding system. As a generalization of system factorization, we have developed sequential decomposition which uses a finite state machine model to decompose system descriptions into interacting sequential machines [3,4].…”

Section: Introductionmentioning

confidence: 99%

Decomposition of Sequential Behavior UsingInterface Specification and Complementation

1995

Self Cite

View full text Add to dashboard Cite

Decomposition of system behavior along functional boundaries into interacting sequential components is a key step in top-down system design. In this paper, we present sequential decomposition, a method for factoring sequential components from a system specification based on interface specifications of the components. The resulting components can be independently synthesized, or realized using off-the-shelf components. We introduce interface specification language (ISL), based on finite-state machine semantics, to specify the input/output behavior of synchronous sub-systems. A component is factored from a system by embedding an implementation of the complement of its interface into the system description. The composition of a machine with its complement is shown to be isomorphic to the machine, and the composition of a machine with an implementation of its component is shown to be a safe interaction. We apply sequential decomposition to a non-trivial example, a special-purpose computer with Scheme programming language primitives as its instructions.

show abstract

Manipulating logical organization with system factorizations

Cited by 14 publications

References 8 publications

View from the Fringe of the Fringe

View from the Fringe of the Fringe

DDD-FM9001: Derivation of a verified microprocessor

Decomposition of Sequential Behavior UsingInterface Specification and Complementation

Contact Info

Product

Resources

About