DocumentCode :
1047991
Title :
PBS: proven Boolean simplification
Author :
Aagaard, Mark ; Leeser, Miriam
Author_Institution :
Sch. of Electr. Eng., Cornell Univ., Ithaca, NY, USA
Volume :
13
Issue :
4
fYear :
1994
fDate :
4/1/1994 12:00:00 AM
Firstpage :
459
Lastpage :
470
Abstract :
We describe PBS, a formally proven implementation of multi-level logic synthesis based on the weak division algorithm. We have proved that for all legal input circuits, PBS generates an output circuit that is functionally correct and has minimal size. PBS runs on large examples in reasonable time for a prototype system. PBS, was verified using the Nuprl proof development system. The proof of PBS, which required several months, was well worth the effort since the benefits are realized every 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 varying each design produced
Keywords :
Boolean functions; logic CAD; theorem proving; Nuprl proof development system; multi-level logic synthesis; weak division algorithm; Circuit synthesis; Costs; Design engineering; Design methodology; Hardware; Law; Legal factors; Logic; Mechanical factors; Prototypes;
fLanguage :
English
Journal_Title :
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
Publisher :
ieee
ISSN :
0278-0070
Type :
jour
DOI :
10.1109/43.275356
Filename :
275356
Link To Document :
بازگشت