Specified Blocks Eric
نویسندگان
چکیده
This paper argues that specified blocks have every advantage over the combination of assertions, preconditions, postconditions, invariants, and variants, both for verifying programs, and for program development. They are simpler, more general, easier to write, and they make proofs easier.
منابع مشابه
Specified Blocks
This paper argues that specified blocks have every advantage over the combination of assertions, preconditions, postconditions, invariants, and variants, both for verifying programs, and for program development. They are simpler, more general, easier to write, and they make proofs easier.
متن کاملLFSR Reseeding Methodology for Low Power and Deterministic Pattern
An efficient low power built-in self-test methodology based on linear feedback shift register reseeding is proposed. This new method divides each test cube into several blocks and encodes that cube into a new test cube. In the new encoded test cube, the nontransitional blocks which no specified bits is included or only one kind of specified bit (1 or 0) is encoded into only one bit (1, 0, or X)...
متن کاملFast heuristic algorithm for three-block decomposition of a system of weakly specified Boolean functions
The paper presents an approach to decomposition of a system of weakly specified Boolean functions represented by a sum-of-products (SOP) into a netlist of logic blocks. The approach is based on a fast heuristic splitting of a weakly specified Boolean function into three interconnected multi-input multioutput logic blocks. The vector-functions of the blocks are found using orthogonality of the o...
متن کاملSAT-based verification of implementations of incompletely specified Boolean functions
The problem under discussion is to check whether a given system of incompletely specified Boolean functions is implemented by a logical description with functional indeterminacy that is represented by a system of connected blocks each of which is specified by a system of completely or incompletely specified Boolean functions. SAT-based verification methods are considered which formulate the ver...
متن کاملOn ternary designs with a specified number of blocks with repeated elements
The blocks of a balanced ternary design, BTD(V,B; ρ1, ρ2, R;K,Λ), can be partitioned into two sets: the b1 blocks that each contain no repeated elements, and the b2 = B − b1 blocks containing repeated elements. In this note, we address, and answer in some particular cases, the following question. For which partitions of the integer B as b1 + b2 does there exist a BTD(V,B; ρ1, ρ2, R;K,Λ)?
متن کامل