abstraction

We present an approach for classifying and retrieving reusable software based on exemplary descriptions of its functionality. The functionality of reusable components is described by a set of tuples with each tuple representing a characteristic input-outpu

Classfyinig ompConetnsby ehaviBraolA strabciotInsnttitufur nfIomatrki-ySteme,s nUviesrtit aKlagnfure tKalgefurtn,A utsia erami:l fmttermeir, iehpo@ig u.n-kil.auca.tRolndaT .M itetreim,r HinzePozewau ngi

Astbrat

Wc eresenpt naapp orac horfc lasisfingya dn erritvingere usbae l

Abstract. We propose a new framework, based on predicate abstraction and model checking, for shape analysis of programs. Shape analysis is used to statically collect information — such as possible reachability and sharing — about program stores. Rather t

ShapeAnalysisthroughPredicateAbstraction

andModelChecking

DennisDamsandKedarS.Namjoshi

BellLabs,LucentTechnologies,600MountainAve.,MurrayHill,NJ07974.

{dennis,kedar}@

Abstract.Weproposeanewframework,basedonpredicateabstrac-tionandmodelchecking,forshapeanalysisofprograms.Shapeanal