RT Journal Article
JF 2011 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011)
YR 2006
VO 00
SP 157
TI Bogor/Kiasan: A k-bounded Symbolic Execution for Checking Strong Heap Properties of Open Systems
A1 Jooyong Lee,
A1 Robby ,
A1 Xianghua Deng,
K1 null
AB This paper presents Kiasan, a bounded technique to reason about open systems based on a path sensitive, relatively sound and complete symbolic execution instead of the usual compositional reasoning through weakest precondition calculation that summarizes all execution paths. Kiasan is able to check strong heap properties, and it is fully automatic and flexible in terms of its cost and the guarantees it provides. It allows a user-adjustable mixed compositional/non-compositional reasoning and naturally produces error traces as fault evidence. We implemented Kiasan using the Bogor model checking framework and observed that its performance is comparable to ESC/Java on similar scales of problems and behavioral coverage, while providing the ability to check much stronger specifications.
PB IEEE Computer Society, [URL:http://www.computer.org]
SN 1527-1366
LA English
DO 10.1109/ASE.2006.26
LK http://doi.ieeecomputersociety.org/10.1109/ASE.2006.26