BDD encoding for partial order constraints and its application to expert systems in software verification domains

Author

Kurihara, Masahito ; Kondo, Hisashi

Author_Institution

Hokkaido Inst. of Technol., Sapporo, Japan

Volume

3

fYear

2000

fDate

2000

Firstpage

2062

Abstract

We introduce a class of computational problems called partial-order constraint satisfaction problems (POCSPs) for formulating the general problem of determining partial orders that satisfy the given constraints. Then we present some heuristic methods for encoding and solving these problems efficiently by using the binary decision diagram (BDD) data structure. Finally, we show that these methods can be successfully applied to expert systems in the subdomain of software verification

Keywords

binary decision diagrams; computer aided software engineering; constraint theory; data structures; encoding; expert systems; heuristic programming; operations research; program verification; BDD data structure; BDD encoding; binary decision diagram; computational problems; expert systems; heuristic methods; partial-order constraint satisfaction problems; software verification; Application software; Artificial intelligence; Binary decision diagrams; Boolean functions; Data structures; Encoding; Expert systems; Processor scheduling; Software systems; Systems engineering and theory;

fLanguage

English

Publisher

ieee

Conference_Titel

Systems, Man, and Cybernetics, 2000 IEEE International Conference on

Conference_Location

Nashville, TN

ISSN

1062-922X

Print_ISBN

0-7803-6583-6

Type

conf

DOI

10.1109/ICSMC.2000.886419

Filename

886419