@inproceedings{62f6ccb9d1a14a709e8d963ffc3f88d4,

title = "Design for verifiability",

abstract = "The concept of Design for Verifiability is introduced as a means of attacking the complexity problem encountered when verifying the correctness of hardware designs using mathematical proof techniques. The inherent complexity of systems implemented as integrated circuits results in a comparable descriptive complexity when modelling them in any framework which supports formal verification. Performing formal verification then rapidly becomes intractable as a consequence of this descriptive complexity. In this paper we propose a strategy for dealing, at least in part, with this problem. We advocate the use of a particular design strategy involving the use of structural design rules which constrain the behaviour of a design resulting in a less complex design verification. The term Design for Verifiability is used to capture this concept in an analogous way to the term Design for Testability.",

author = "Milne, {George J.}",

year = "1990",

month = jan,

day = "1",

doi = "10.1007/0-387-97226-9_20",

language = "English",

isbn = "9780387972268",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer-Verlag Berlin",

pages = "1--13",

editor = "Miriam Leeser and Geoffrey Brown",

booktitle = "Hardware Specification, Verification and Synthesis",

address = "Germany",

note = "Mathematical Sciences Institute Workshop on Hardware Specification, Verification and Synthesis, 1989 ; Conference date: 05-07-1989 Through 07-07-1989",

}