Computer Science – Logic in Computer Science
Scientific paper
2010-04-29
Computer Science
Logic in Computer Science
Scientific paper
Verification of software systems is a very hard problem due to the large size of program state-space. The traditional techniques (like model checking) do not scale; since they include the whole state-space by inlining the library function codes. Current research avoids these problem by creating a lightweight representation of the library in form of an "interface graph" (call sequence graph). In this paper we introduce a new algorithm to compute a safe, permissive interface graph for C-type functions. In this modular analysis, each function transition is summarized following three-valued abstraction semantics. There are two kinds of abstraction used here. The global abstraction contains predicates over global variables only; however the local abstraction inside each function may also contain the local variables. The abstract summary needs refinement to guarantee safety and permissiveness. We have implemented the algorithms in TICC tool and compared this algorithm with some related interface generation algorithms. We also discuss the application of interface as an offline test-suite. We create an interface from the model program (specification) and the interface will act as a test-suite for the new implementation-under-test (IUT).
No associations
LandOfFree
Interface Building for Software by Modular Three-Valued Abstraction Refinement does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Interface Building for Software by Modular Three-Valued Abstraction Refinement, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Interface Building for Software by Modular Three-Valued Abstraction Refinement will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-386696