ConSUS: a light-weight program conditioner

De Montfort University Open Research Archive

Show simple item record

dc.contributor.author Ward, Martin en
dc.contributor.author Danicic, S. en
dc.contributor.author Daoudi, M. en
dc.contributor.author Fox, C. en
dc.date.accessioned 2008-11-24T13:57:17Z
dc.date.available 2008-11-24T13:57:17Z
dc.date.issued 2005-09-01 en
dc.identifier.citation Ward, M. et al.(2005) ConSUS: a light-weight program conditioner. Journal of Systems and Software, 77(3), pp. 241-262.
dc.identifier.issn 0164-1212 en
dc.identifier.uri http://hdl.handle.net/2086/253
dc.description Conditioned slicing can be applied to reverse engineering problems which involve the extraction of executable fragments of code in the context of some criteria of interest. This paper introduces ConSUS, a conditioner for the Wide Spectrum Language, WSL. The symbolic executor of ConSUS prunes the symbolic execution paths, and its predicate reasoning system uses the FermaT simplify transformation in place of a more conventional theorem prover. We show that this combination of pruning and amplification-as-reasoner leads to a more scalable approach to conditioning. en
dc.language.iso en en
dc.publisher Elsevier en
dc.subject RAE 2008
dc.subject UoA 23 Computer Science and Informatics
dc.title ConSUS: a light-weight program conditioner en
dc.type Article en
dc.researchgroup Software Technology Research Laboratory (STRL)


Files in this item

This item appears in the following Collection(s)

Show simple item record