Paper Info
Title
Interval-Based Analysis of Software Processes
Abstract
A typical characteristic of complex embedded systems is their large software share that consists of software processes either being directly written in an implementation language like C, or being created from abstract modeling tools (e. g. Simulink or StateMate) using standard code generators, or being reused from previous designs (e. g. legacy code). A major challenge is the safe integration of these separately designed system parts. This paper focuses on the formal analysis of software processes with respect to their non-functional properties like timing or power consumption. The proposed approach yields safe upper and lower bounds on these properties and has advantages over previous work in terms of accuracy and efficiency. Further, it is shown how the results of this process-level analysis can be utilized to generate a model for the system-wide validation of non-functional properties. The applicability of the approach is demonstrated using an example of a filter process operating on a packet stream.
Year
DOI
Venue
2001
10.1145/384198.384211
OM '01 Proceedings of the 2001 ACM SIGPLAN workshop on Optimization of middleware and distributed systems
Keywords
Field
DocType
cost analysis,upper and lower bounds,embedded system,software process,code generation
Upper and lower bounds,Computer science,Network packet,Coding (social sciences),Real-time computing,Software,Legacy code,Interval arithmetic,Power consumption
Conference
Volume
Issue
ISSN
36
8
0362-1340
ISBN
Citations 
PageRank 
1-58113-426-6
5
0.74
References 
Authors
11
5
Name
Order
Citations
PageRank
D. Ziegenbein19710.69
Fabian Wolf28010.53
Kai Richter338434.65
Marek Jersak430525.27
Rolf Ernst52633252.90