The University of Southampton
University of Southampton Institutional Repository

Expressive and efficient bounded model checking of concurrent software

Expressive and efficient bounded model checking of concurrent software
Expressive and efficient bounded model checking of concurrent software
To improve automated verification techniques for ANSI-C software, I examine temporal logics for describing program properties, and techniques for increasing the speed of program verification,for both single threaded and concurrent programs, based on the model checker ESBMC. A
technique for evaluating LTL formulae over finite program traces is proposed and evaluated over a piece of industrial software and a suite of benchmarks, with favourable results. Efficient formulations of the model checking problem for SMT solvers are evaluated, and the performance
of different solvers compared. Finally a number of optimisations for concurrent program verification not previously applied to symbolic software model checking are evaluated, resulting in an order of magnitude performance improvement over ESBMCs prior and already internationally
competitive performance.
Morse, Jeremy
8ce3f639-6ea2-4b40-be62-5c603e8d6957
Morse, Jeremy
8ce3f639-6ea2-4b40-be62-5c603e8d6957
Nicole, Denis
0aca6dd1-833f-4544-b7a4-58fb91c7395a

(2015) Expressive and efficient bounded model checking of concurrent software. University of Southampton, Physical Sciences and Engineering, Doctoral Thesis, 244pp.

Record type: Thesis (Doctoral)

Abstract

To improve automated verification techniques for ANSI-C software, I examine temporal logics for describing program properties, and techniques for increasing the speed of program verification,for both single threaded and concurrent programs, based on the model checker ESBMC. A
technique for evaluating LTL formulae over finite program traces is proposed and evaluated over a piece of industrial software and a suite of benchmarks, with favourable results. Efficient formulations of the model checking problem for SMT solvers are evaluated, and the performance
of different solvers compared. Finally a number of optimisations for concurrent program verification not previously applied to symbolic software model checking are evaluated, resulting in an order of magnitude performance improvement over ESBMCs prior and already internationally
competitive performance.

PDF
__soton.ac.uk_ude_personalfiles_users_jo1d13_mydesktop_thesis-jmorse-ecs.pdf - Other
Download (1MB)

More information

Published date: April 2015
Organisations: University of Southampton, Electronic & Software Systems

Identifiers

Local EPrints ID: 379284
URI: http://eprints.soton.ac.uk/id/eprint/379284
PURE UUID: 0d45a780-de3f-4890-97df-aa6b6e255b25

Catalogue record

Date deposited: 22 Jul 2015 11:38
Last modified: 17 Jul 2017 20:45

Export record

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×