Logic in Computer Science, Symposium on (2009)
Los Angeles, California
Aug. 11, 2009 to Aug. 14, 2009
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/LICS.2009.25
In this paper we introduce ``clipping,'' a new method of syntactic approximation which is motivated by and works in conjunction with a sound and decidable denotational model for a given programming language. Like slicing, clipping reduces the size of the source code in preparation for automatic verification; but unlike slicing it is an imprecise but computationally inexpensive algorithm which does not require a whole-program analysis. The technique of clipping can be framed into an iterated refinement cycle to arbitrarily improve its precision. We first present this rather simple idea intuitively with some examples, then work out the technical details in the case of an Algol-like programming language and a decidable approximation of its game-semantic model inspired by Hankin and Malacaria's ``lax functor'' approach. We conclude by presenting an experimental model checking tool based on these ideas and some toy programs.
Game semantics, program verification, model checking
Adam Bakewell, Dan R. Ghica, "Clipping: A Semantics-Directed Syntactic Approximation", Logic in Computer Science, Symposium on, vol. 00, no. , pp. 189-198, 2009, doi:10.1109/LICS.2009.25