Applying symbolic bounded model checking to the 2012 RERS greybox challenge

Morse, Jeremy, Cordeiro, Lucas, Nicole, Denis and Fischer, Bernd (2014) Applying symbolic bounded model checking to the 2012 RERS greybox challenge. International Journal on Software Tools for Technology Transfer, 16 (5), 519-529. (doi:10.1007/s10009-014-0335-0).

Record type: Article

Abstract

We describe the application of ESBMC, a symbolic bounded model checker for C programs, to the 2012 RERS greybox challenge. We checked the reachability properties via reachability of the error labels, and the behavioral properties via a bounded LTL model checking approach. Our approach could solve about 700 properties for the small and medium problems from the offline phase, and scored overall about 5,000 marks but still ranked last in the competition.

Text

Applying symbolic bounded model checking to the 2012 RERS greybox challenge - Version of Record

Restricted to Repository staff only

Request a copy

More information

e-pub ahead of print date: 1 August 2014

Published date: October 2014

Learn more about Cyber Security research

Identifiers

Local EPrints ID: 433242

URI: http://eprints.soton.ac.uk/id/eprint/433242

DOI: doi:10.1007/s10009-014-0335-0

ISSN: 1433-2779

PURE UUID: 3cc93584-b886-4c0b-827f-8f1dccef1c00

Catalogue record

Date deposited: 12 Aug 2019 16:30

Last modified: 16 Mar 2024 03:18

Export record

Altmetrics

Share this record

Share this on Facebook Share this on Twitter Share this on Weibo

Contributors

Author: Jeremy Morse

Author: Lucas Cordeiro

Author: Denis Nicole

Author: Bernd Fischer

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

Library staff additional information