Return to search

Finding termination and time improvement in predicate abstraction with under-approximation and abstract matching /

Thesis (M.S.)--Brigham Young University. Dept. of Computer Science, 2007. / Includes bibliographical references (p. 30-31).

Identiferoai:union.ndltd.org:OCLC/oai:xtcat.oclc.org:OCLCNo/367761931
Date January 2007
CreatorsKudra, Dritan,
Source SetsOCLC
LanguageEnglish
Detected LanguageEnglish
TypeElectronic dissertations.
SourceCLICK HERE for online access

Page generated in 0.0024 seconds