Implicit dynamic frames: Combining dynamic frames and separation logic (soundness proof

Implicit dynamic frames: Combining dynamic frames and separation logic (soundness proof (2009)

by Jan Smans , Bart Jacobs , Frank Piessens

Citations:

22 - 1 self

Datum	Value	Source
TITLE	Implicit dynamic frames: Combining dynamic frames and separation logic (soundness proof	INFERENCE
AUTHOR NAME	Jan Smans	SVM HeaderParse 0.2
AUTHOR ADDR	Belgium	SVM HeaderParse 0.2
AUTHOR NAME	Bart Jacobs	SVM HeaderParse 0.2
AUTHOR ADDR	Belgium	SVM HeaderParse 0.2
AUTHOR NAME	Frank Piessens	SVM HeaderParse 0.2
AUTHOR ADDR	Belgium	SVM HeaderParse 0.2
ABSTRACT	Abstract. The dynamic frames approach has proven to be a powerful formalism for specifying and verifying object-oriented programs. However, it requires writing and checking many frame annotations. In this paper, we propose a variant of the dynamic frames approach that eliminates the need to explicitly write and check frame annotations. Reminiscent of separation logic’s frame rule, programmers write access assertions inside pre- and postconditions instead of writing frame annotations. From the precondition, one can then infer an upper bound on the set of locations writable or readable by the corresponding method. We implemented our approach in a tool, and used it to automatically verify several challenging programs, including subject-observer, iterator and linked list. 1	SVM HeaderParse 0.2
YEAR	2009	INFERENCE
VENUE TYPE	TECHREPORT	INFERENCE
TECH	Technical Report CW542	INFERENCE
CITATIONS	33 found	ParsCit 1.0