JAIST Repository >
School of Information Science >
Articles >
Journal Articles >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10119/7886

Title: Automatic Verification Based on Abstract Interpretation
Authors: Ogawa, Mizuhito
Issue Date: 1999
Publisher: Springer
Magazine name: Lecture Notes in Computer Science
Volume: 1722
Start page: 131
End page: 146
DOI: 10.1007/10705424_9
Abstract: This paper reconstructs and extends the automatic verification technique of Le Metayer, Proving properties of programs defined over recursive data structures (ACM PEPM ’95), based on a backward abstract interpretation. To show the effectiveness of extensions, we show two examples of the declarative specifications of sorting and formatting programs, which are directly and concisely expressed in our specification language.
Rights: This is the author-created version of Springer, Mizuhito Ogawa, Lecture Notes in Computer Science, 1722, 1999, 131-146. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/10705424_9
URI: http://hdl.handle.net/10119/7886
Material Type: author
Appears in Collections:b10-1. 雑誌掲載論文 (Journal Articles)

Files in This Item:

File Description SizeFormat
flops99-27.pdf282KbAdobe PDFView/Open

All items in DSpace are protected by copyright, with all rights reserved.

 


Contact : Library Information Section, Japan Advanced Institute of Science and Technology