Interpolation for data structures

Interpolation based automatic abstraction is a powerful and robust technique for the automated analysis of hardware and software systems. Its use has however been limited to controldominated applications because of a lack of algorithms for computing interpolants for data structures used in software programs. We present efficient procedures to construct interpolants for the theories of arrays, sets, and multisets using the reduction approach for obtaining decision procedures for complex data structures. The approach taken is that of reducing the theories of such data structures to the theories of equality and linear arithmetic for which efficient interpolating decision procedures exist. This enables interpolation based techniques to be applied to proving properties of programs that manipulate these data structures. Categories and Subject Descriptors: D.2.4 [Software Engineering]: Software/Program Verification. General Terms: Languages, Verification, Reliability.

• Type: Conference
• Year: 2006
• Where: SIGSOFT
• Authors: Deepak Kapur, Rupak Majumdar, Calogero G. Zarba
• Keywords: Complex Data Structures, Data Structures, Decision Procedures, SIGSOFT 2006, Software Engineering