See this document in CiteSeerX!

WORST-CASE TIMING Analysis Via Finding Longest PATHS IN SPARK Ada BASIC-PATH GRAPHS (1994)  (Make Corrections)  (9 citations)
Roderick Chapman



  Home/Search   Context   Related

 
View or download:
cs.york.ac.uk/ftpdir/...YCS94246.ps.Z
cs.york.ac.uk/pub/realtim...YCS246.ps.Z
cs.york.ac.uk/reports...YCS94246.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cs.york.ac.uk/ftpdir/reports/ (more)
From:  fermivista.math...p.cs.york.ac.uk
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: The SPARK Proof and Timing System (SPATS) is a collection of software tools developed to assist the static analysis of safetycritical and hard real-time software. SPATS integrates both classical program proof and worst-case execution time analysis through analysis of a program's basic-path control-flow graph. A new algorithm has been developed that transforms a cyclic basicpath graph into a path-expression that can be evaluated for worstcase timing assuming suitable bounds on each loop are... (Update)

Context of citations to this paper:   More

...to use it for a symbolic IPET calculation. Finally, in Section 9, we wrap up and give ideas for further research. 2 Related Work Chapman [5] gives a method to compute regular expressions for paths yielding WCET formulae parameterized in unknown loop bounds. The method only...

Cited by:   More
Facilitating Worst-Case Execution Times Analysis for.. - Engblom, Ermedahl.. (1998)   (Correct)
Fully Automatic, Parametric Worst-Case Execution Time Analysis - Lisper   (Correct)

Active bibliography (related documents):   More   All
1.3:   Integrated program proof and worst-case timing analysis.. - Chapman, Burns, Wellings (1994)   (Correct)
1.0:   Worst-case timing analysis of exception handling in Ada - Roderick Chapman (1993)   (Correct)
0.5:   Lisp Philosophy - TANAKA (1987)   (Correct)

Similar documents based on text:   More   All
0.9:   Document Set SPARK 95 Reference SPARK 95/3.1 - Title Spark The   (Correct)
0.8:   Industrial Experience with SPARK - Chapman (2000)   (Correct)
0.5:   SPARK - A state-of-the-practice approach to the Common Criteria.. - Chapman (2001)   (Correct)

Related documents from co-citation:   More   All
6:   the false path problem in hard real-time programs - Altenbernd - 1996
5:   Deriving annotations for tight calculation of execution time - Ermedahl, Gustafsson - 1997
5:   Computing maximum task execution times with linear programming techniques (context) - Puschner, Schedl - 1995

BibTeX entry:   (Update)

Roderick Chapman. Worst-case timing analysis via finding longest paths in SPARK Ada basic-path graphs. Technical Report YCS-94-246, Department of Computer Science, York University, October 1994. Facilitating Worst-Case Execution Times Analysis for Optimized Code 20 http://citeseer.ist.psu.edu/chapman94worstcase.html   More

@misc{ chapman94worstcase,
  author = "R. Chapman",
  title = "Worst-case timing analysis via finding longest paths in SPARK Ada basic-path
    graphs",
  text = "Roderick Chapman. Worst-case timing analysis via finding longest paths
    in SPARK Ada basic-path graphs. Technical Report YCS-94-246, Department
    of Computer Science, York University, October 1994. Facilitating Worst-Case
    Execution Times Analysis for Optimized Code 20",
  year = "1994",
  url = "citeseer.ist.psu.edu/chapman94worstcase.html" }
Citations (may not include all citations):
1399   Compilers: Principles (context) - Aho, Sethi et al. - 1986
218   Safety analysis of timing properties in real-time systems (context) - Jahanian, Mok - 1986
167   Calculating The Maximum Execution Time Of RealTime Programs (context) - Puschner, Koza - 1989
85   Predicting Program Execution Times by Analyzing Static and D.. (context) - Park - 1993
83   A Retargetable Technique for Predicting the Execution Time o.. - Harmon, Baker et al. - 1994
54   Evaluating Tight Execution Time Bounds of Programs by Annota.. (context) - Mok - 1989
51   Fast algorithms for solving path problems (context) - Tarjan
39   A unified approach to path problems (context) - Tarjan - 1981
32   Integrated program proof and worst-case timing analysis of S.. - Chapman, Burns et al. - 1994
20   Information Processing Letters (context) - Ihm, Ntafos - 1984
15   Information-flow and data-flow analysis of while-programs (context) - Carre, Bergeretti - 1985
13   Software Engineering Institute (context) - The, Real-Time et al. - 1993
13   An introduction to proving the correctness of programs (context) - Hantler, King - 1976
11   Graphs: An Introductory Approach (context) - Wilson, Watkins - 1990
10   Compilation Support for Fine-Grained Execution Time Analysis - Vrchoticky - 1994
5   The Longest Path in a Random Graph (context) - Ajtai, Komlos et al. - 1981
5   SPARK: the SPADE Ada Kernel (context) - Carre - 1992
4   Experiences with SPARK and its support tool (context) - Carre, Garnsworthy - 1990
4   SPARK - A Safety-Related Ada Subset (context) - Carre, Garnsworthy et al. - 1992
3   line computation of minimal and maximal length paths (context) - Ausiello - 1992
3   Program analysis and verification (context) - Carre - 1989
3   York Software Engineering Ltd (context) - Forsyth - 1992
3   Predicting Instruction Cache Behaviour (context) - Mueller, Whalley et al. - 1994
3   A Priori Execution Time Analysis for Parallel Processes (context) - Halang - 1989
3   Requirements for the Procurement of Safety Critical Software.. (context) - Interim - 1991
2   Oxford Applied Mathematics and Computing Science Series (context) - Carre - 1979
2   Programming in Common LISP (context) - Brooks - 1985
2   The Use of Ada for Safety Critical Applications: Appendix A:.. (context) - Winterstein, Holzapfel - 1987
1   Van Nostrand Reinhold Electrical/Computer Science and Engine.. (context) - Beizer - 1983
1   Notes on Oriented Depth-First Search and Longest Paths (context) - DeFraysseix, Imsi - 1989
1   Finding a Longest Path in a Complete Multipartite Graph (context) - Gutin - 1993
1   Validation Techniques (context) - Carre - 1990
1   York Software Engineering Ltd (context) - Jordan, of
1   Validation Techniques II (context) - Carre - 1990
1   On real-time features available in high-level languages and .. (context) - Halang - 1983
1   A subset of Ada for formal verification (context) - Carre, Jennings - 1989
1   Lecture notes on Program Validation (context) - Carre - 1987



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.cs.york.ac.uk/ftpdir/reports/):   More
TAM Technical Notes 1 and 2 - Scholefield (1993)   (Correct)
Debugging Distributed Ada Programs - Briggs, Jamieson, Randall, Wand (1994)   (Correct)
Structuring Architectural Topologies for Real-Time.. - Nicholson, Burns (1997)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC