Cleanly combining specialised program analysers

File Description SizeFormat 
combined-specialized-analyzers.pdfWorking Paper102.27 kBAdobe PDFDownload
Title: Cleanly combining specialised program analysers
Author(s): Charlton, N
Huth, M
Item Type: Conference Paper
Abstract: Automatically proving that (infinite-state) software programs satisfy a specification is an important task, but has proved very difficult. Thus, in order to obtain techniques that work with reasonable speed and without user guidance, researchers have typically targeted restricted classes of language features, programming idioms and properties. We have designed a system in which several of these specialised techniques can be used together in proving that a program is correct; this is done without breaking modularity by propagating information between the analyses, expressed as formulae of an expressive common logic. In this way, we can verify programs which, because they use diverse language features and idioms, are difficult or impossible to prove using any one individual technique. Our system is implemented in the experimental tool HECTOR.
Publication Date: 30-Apr-2007
URI: http://hdl.handle.net/10044/1/5888
Publisher Link: http://www.doc.ic.ac.uk/crg/events/ARW07/
Presented At: Automated Reasoning Workshop 2007
Copyright Statement: © The Authors
Conference Location: Imperial College, London
Appears in Collections:Computing
Quantitative Analysis and Decision Science



Items in Spiral are protected by copyright, with all rights reserved, unless otherwise indicated.

Creative Commons