B. Carr'e. Program analysis and verification. In C. T. Sennett, editor, High-Integrity Software, chapter 8, pages 176--197. Plenum Press, 1989. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Semantic Identification of Dead Control-Flow Paths - Hayes, Fidge, Lermer (1999) (Correct)
.... on the generated object code, we must explore all possible paths which end at critical timing points [9] ffl To identify coding errors, such as uninitialised variables appearing in expressions, or ineffective 1 assignments, we need to apply data flow analysis to each possible control flow path [4]. In each of these applications it is important that we can eliminate those paths that will never be followed at run time. In the literature, such paths are often referred to as false [8] or infeasible [16] Here we favour the term dead [5] which avoids confusion with the (related but different) ....
.... associated with system variables during symbolic execution may not be sufficiently discerning to accurately identify the actual paths that will be followed [12] Formal verification techniques can be used to identify dead paths through backward substitution or by solving fixed point equations [4, 10]. 4 Control flow paths As a simple motivational example, consider the program in Figure 1. For concreteness, we use an Adalike syntax (although we reserve semi colons for sequential composition, rather than as statement terminators) The program aims to use simple arithmetic operators and ....
B. Carr'e. Program analysis and verification. In C. T. Sennett, editor, High-Integrity Software, chapter 8, pages 176--197. Plenum Press, 1989.
Safety And Social Aspects Of Intelligent Vehicle-Highway Systems - West (1994) (1 citation) (Correct)
....for small systems. Static Analysis is a means of analysing source code without executing it [76] most compilers perform a rudimentary form of static analysis. This contrasts with dynamic analysis or testing. A formal specification also facilitates the use of static analysis tools such as SPADE [77]. Tools which perform such an analysis frequently work with a safe subset of a standard language (as described in the next subsection) Programs are then formally annotated; for instance procedures are specified by their pre and post conditions. The tool is then used to prove that if the ....
B A Carr'e. Program Analysis and Verification. In C T Sennett, editor, High-integrity Software, pages 176--197. Pitman, London, 1989.
WORST-CASE TIMING Analysis Via Finding Longest PATHS IN SPARK Ada .. - Chapman (1994) (9 citations) (Correct)
No context found.
Carré, B.A., Program analysis and verification, in High Integrity Software, C.T. Sennet, Editor. 1989, Pitman: p. 176-197.
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