Please use this identifier to cite or link to this item:
Title: Inferring Finite-State Models with Temporal Constraints
Authors: Walkinshaw, Neil
Bogdanov, Kirill
First Published: Sep-2008
Presented at: Automated Software Engineering, 2008 (ASE 2008), 23rd IEEE/ACM International Conference on, L'Aquila, Italy, 15-19 Sept. 2008
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Citation: International Conference on Automated Software Engineering (ASE), 2008, Proceedings of, pp. 248-257
Abstract: Finite state machine-based abstractions of software behaviour are popular because they can be used as the basis for a wide range of (semi-) automated verification and validation techniques. These can however rarely be applied in practice, because the specifications are rarely kept up- to-date or even generated in the first place. Several techniques to reverse-engineer these specifications have been proposed, but they are rarely used in practice because their input requirements (i.e. the number of execution traces) are often very high if they are to produce an accurate result. An insufficient set of traces usually results in a state machine that is either too general, or incomplete. Temporal logic formulae can often be used to concisely express constraints on system behaviour that might otherwise require thousands of execution traces to identify. This paper describes an extension of an existing state machine inference technique that accounts for temporal logic formulae, and encourages the addition of new formulae as the inference process converges on a solution. The implementation of this process is openly available, and some preliminary results are provided.
DOI Link: 10.1109/ASE.2008.35
ISBN: 978-1-4244-2187-9
Version: Post-print
Status: Peer-reviewed
Type: Conference Paper
Rights: Copyright © 2008 IEEE. Deposited with reference to the publisher's archiving policy available on the SHERPA/RoMEO website. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.
Appears in Collections:Conference Papers & Presentations, Dept. of Computer Science

Files in This Item:
File Description SizeFormat 
asedraft2.pdfPost-review (final submitted)221.6 kBAdobe PDFView/Open

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