◾ Program Correctness

Program testing determines whether its behavior matches the specification, and also how it behaves in different exploitation conditions. Proving of program correctness is reduced to finding a proof for assertion that given sequence of formulas represents derivation within a formal theory of special predicted calculus. A well-known variant of this conception is described: correctness based on programming logic rules. It is shown that programming logic rules may be used in automatic resolution procedure. Illustrative examples are given, realized in prolog-like LP-language (with no restrictions to Horn's clauses and without the final failure). Basic information on LP-language are also given. It has been shown how a Pascal-program is being executed in LP-system proffer.

Download Full-text

Conversion Method of Description Files in Structural Testing of Digital Circuit

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.427-429.1285 ◽

2013 ◽

Vol 427-429 ◽

pp. 1285-1288

Author(s):

Kang Yi Wang

Keyword(s):

Integrated Circuit ◽

Large Scale ◽

Digital Circuit ◽

Logic Circuit ◽

Structural Testing ◽

Digital Logic ◽

Continuous Development ◽

Program Correctness ◽

Testing Program ◽

Circuit Technology

With the continuous development of large-scale integrated circuit technology, the importance of structural testing and testability design for digital logic circuit has become increasingly evident. In the testing domain, Bench is the most commonly used formats to describe a measured circuit. In order to test the measured circuit using computer, files with various formats must be converted to a netlist file which can be identified by computer. Lev format is a common netlist file. This paper mainly discusses how to convert the Bench file into Lev file, and it is proved by testing program correctness and robustness.

Download Full-text