Programs as paths: An approach to timing constraint analysis

Hayes, I. J. (2003). Programs as paths: An approach to timing constraint analysis. In: J. Dong and J. Woodcock, Proceedings of the Fifth International Conference on Formal Engineering Methods. The Fifth International Conference on Formal Engineering Methods, Singapore, (1-15). 5-7 November, 2003. doi:10.1007/b94115


Author Hayes, I. J.
Title of paper Programs as paths: An approach to timing constraint analysis
Conference name The Fifth International Conference on Formal Engineering Methods
Conference location Singapore
Conference dates 5-7 November, 2003
Proceedings title Proceedings of the Fifth International Conference on Formal Engineering Methods   Check publisher's open access policy
Journal name Formal Methods and Software Engineering, Proceedings   Check publisher's open access policy
Place of Publication Germany
Publisher Springer
Publication Year 2003
Sub-type Fully published paper
DOI 10.1007/b94115
Open Access Status
ISBN 978-3-540-20461-9
ISSN 0302-9743
1611-3349
Editor J. Dong
J. Woodcock
Volume 2885
Start page 1
End page 15
Total pages 15
Language eng
Abstract/Summary A program can be decomposed into a set of possible execution paths. These can be described in terms of primitives such as assignments, assumptions and coercions, and composition operators such as sequential composition and nondeterministic choice as well as finitely or infinitely iterated sequential composition. Some of these paths cannot possibly be followed (they are dead or infeasible), and they may or may not terminate. Decomposing programs into paths provides a foundation for analyzing properties of programs. Our motivation is timing constraint analysis of real-time programs, but the same techniques can be applied in other areas such as program testing. In general the set of execution paths for a program is infinite. For timing analysis we would like to decompose a program into a finite set of subpaths that covers all possible execution paths, in the sense that we only have to analyze the subpaths in order to determine suitable timing constraints that cover all execution paths.
Subjects E1
280302 Software Engineering
700199 Computer software and services not elsewhere classified
Q-Index Code E1

 
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 4 times in Thomson Reuters Web of Science Article | Citations
Scopus Citation Count Cited 0 times in Scopus Article
Google Scholar Search Google Scholar
Created: Fri, 24 Aug 2007, 12:06:46 EST