PBS - PROVEN BOOLEAN SIMPLIFICATION

Citation
M. Aagaard et M. Leeser, PBS - PROVEN BOOLEAN SIMPLIFICATION, IEEE transactions on computer-aided design of integrated circuits and systems, 13(4), 1994, pp. 459-470
Citations number
25
Categorie Soggetti
Computer Application, Chemistry & Engineering","Computer Science Hardware & Architecture
ISSN journal
02780070
Volume
13
Issue
4
Year of publication
1994
Pages
459 - 470
Database
ISI
SICI code
0278-0070(1994)13:4<459:P-PBS>2.0.ZU;2-3
Abstract
We describe PBS, a formally proven implementation of multi-level logic synthesis based on the weak division algorithm. We have proved that f or all legal input circuits, PBS generates an output circuit that is f unctionally correct and has minimal size. PBS runs on large examples i n reasonable time for a prototype system. PBS, was verified using the Nuprl proof development system. The proof of PBS, which required sever al months, was well worth the effort since the benefits are realized e very time the program is run. When engineers use a verified synthesis tool, they get the increased confidence of applying formal methods to their designs without the cost of verying each design produced.