DSpace Repository

Using Horn Clauses and Binary Decision Diagrams for Program Analysis

Show simple item record

dc.contributor.advisor Stark, Eugene W.; Grosu, Radu en_US
dc.contributor.author Song, Wenxin en_US
dc.contributor.other Department of Computer Science en_US
dc.date.accessioned 2012-05-15T18:06:54Z
dc.date.available 2012-05-15T18:06:54Z
dc.date.issued 1-Aug-10 en_US
dc.date.submitted Aug-10 en_US
dc.identifier Song_grad.sunysb_0771E_10260.pdf en_US
dc.identifier.uri http://hdl.handle.net/1951/55629
dc.description.abstract Logic programming languages have been widely used to express program analyses. In this dissertation, we present a framework of program analysis using Horn clauses and Binary Decision Diagrams (BDDs). In contrast to previous work of Whaley, et al. that used Datalog and BDDs for program analysis, we use Horn clauses (which can be viewed as an extension of Datalog) to express program analysis problems. Horn clauses are more expressive than Datalog by allowing functions as arguments of predicates. Many type-based program analysis problems involve type information in which the type is usually a recursively defined object consisting of subtypes. The use of function symbols makes it possible to specify a type in a natural way.BDDs are very popular tool in hardware verification and model checking. Recently, BDDs have also been used in program analysis to efficiently analyze large programs. Unlike Datalog, Horn clauses cannot be implemented by using ordinary BDDs due to the presence of functions. In this dissertation, we propose an automata-based approach that treats terms as strings reading from left to right and represents terms by automata. We devise various operations on automata to manipulate terms. Moreover, we show that such automata lend themselves readily to a representation using Multi-Terminal Binary Decision Diagrams (MTBDDs).We present a top-down set-at-a-time depth-first evaluation algorithm for Horn clauses in terms of sets of ground atoms. Such evaluation algorithm computes relevant results starting from the query in a top-down fashion, operates over a set of atoms at a time, and gains efficiency by taking the advantage of symbolic representation of sets of ground atoms in Horn clauses.The combination of the above ideas yields a framework for program analysis such that analysis queries are naturally expressed as Horn clauses and the evaluation of Horn clauses is efficiently implemented by MTBDDs. Such a framework is suitable for type-based program analysis, such as strictness analysis, binding-time analysis, secure information flow analysis, and so on. en_US
dc.description.sponsorship Stony Brook University Libraries. SBU Graduate School in Department of Computer Science. Lawrence Martin (Dean of Graduate School). en_US
dc.format Electronic Resource en_US
dc.language.iso en_US en_US
dc.publisher The Graduate School, Stony Brook University: Stony Brook, NY. en_US
dc.subject.lcsh Computer Science en_US
dc.subject.other automata, Binary Decision Diagrams, Horn clauses, program analysis, set-at-a-time evaluation en_US
dc.title Using Horn Clauses and Binary Decision Diagrams for Program Analysis en_US
dc.type Dissertation en_US
dc.description.advisor Advisor(s): Eugene W. Stark. Radu Grosu. Committee Member(s): Scott D. Stoller; Aarti Gupta. en_US
dc.mimetype Application/PDF en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Browse

My Account