Automatic generation of software behavioral models

Dynamic analysis of software systems produces behavioral models that are useful for analysis, verification and testing. The main techniques for extracting models of functional behavior generate either models of constraints on data, usually in the form of Boolean expressions, or models of interaction...

Full description

Saved in:
Bibliographic Details
Published in:2008 ACM/IEEE 30th International Conference on Software Engineering Vol. 2008; no. 24; pp. 501 - 510
Main Authors: Lorenzoli, D., Mariani, L., Pezze, M.
Format: Conference Proceeding Journal Article
Language:English
Published: IEEE 01.01.2008
Subjects:
Automata
Data mining
dynamic analysis
gk-tail
Informatics
Information analysis
Law
Legal factors
model synthesis
Permission
Software systems
Software testing
System testing
ISBN:1424444861, 9781424444861, 1605580791, 9781605580791
ISSN:0270-5257
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Dynamic analysis of software systems produces behavioral models that are useful for analysis, verification and testing. The main techniques for extracting models of functional behavior generate either models of constraints on data, usually in the form of Boolean expressions, or models of interactions between components, usually in the form of finite state machines. Both data and interaction models are useful for analyzing and verifying different aspects of software behavior, but none of them captures the complex interplay between data values and components interactions. Thus related analysis and testing techniques can miss important information. In this paper, we focus on the generation of models of relations between data values and component interactions, and we present GK-tail, a technique to automatically generate extended finite state machines (EFSMs) from interaction traces. EFSMs model the interplay between data values and component interactions by annotating FSM edges with conditions on data values. We show that EFSMs include details that are not captured by either Boolean expressions or (classic) FSM alone, and allow for more accurate analysis and verification than separate models, even if considered jointly.
Bibliography:SourceType-Scholarly Journals-2
ObjectType-Feature-2
ObjectType-Conference Paper-1
content type line 23
SourceType-Conference Papers & Proceedings-1
ObjectType-Article-3
ISBN:1424444861
9781424444861
1605580791
9781605580791
ISSN:0270-5257
DOI:10.1145/1368088.1368157