Many program verification, testing and performance prediction techniques rely on analysis of statically-identified control-flow paths. However, some such paths may be 'dead' because they can never be followed at run time, and should therefore be excluded from analysis. It is shown how the formal semantics of those statements comprising a path provides a sound theoretical foundation for identification of dead path
Abstract. State explosion in model checking continues to be the primary obstacle to widespread use o...
The control flow of programs can be represented by directed graphs. In this paper we provide a unifo...
Traditional flow analysis techniques, such as the ones typically employed by optimising Fortran comp...
Many program verification, testing and performance prediction techniques rely on analysis of statica...
This paper provides the syntax and semantics for a systematic approach to the problem of analysing c...
AbstractThis paper provides the syntax and semantics for a systematic approach to the problem of ana...
Program paths—sequences of executed basic blocks—have proven to be an effective way to capture a pro...
Abstract Interpretation (P. Cousot, R. Cousot and others) is a method for program analysis that is ...
Approaches and techniques for statically finding a multitude of issues in source code have been deve...
Abstract. Detection of infeasible code has recently been identified as a scalable and automated tech...
[[abstract]]Software quality is primarily determined by the quality of the software development proc...
Ensuring software reliability is a critical problem in the software development process. There are t...
The pervasiveness of computer systems in virtually every aspect of daily life entails a growing depe...
Workflows describe sequences of tasks to achieve goals. These sequences can contain decisions, loops...
Analyzing the program conditional control flow the important technique using in program execution. S...
Abstract. State explosion in model checking continues to be the primary obstacle to widespread use o...
The control flow of programs can be represented by directed graphs. In this paper we provide a unifo...
Traditional flow analysis techniques, such as the ones typically employed by optimising Fortran comp...
Many program verification, testing and performance prediction techniques rely on analysis of statica...
This paper provides the syntax and semantics for a systematic approach to the problem of analysing c...
AbstractThis paper provides the syntax and semantics for a systematic approach to the problem of ana...
Program paths—sequences of executed basic blocks—have proven to be an effective way to capture a pro...
Abstract Interpretation (P. Cousot, R. Cousot and others) is a method for program analysis that is ...
Approaches and techniques for statically finding a multitude of issues in source code have been deve...
Abstract. Detection of infeasible code has recently been identified as a scalable and automated tech...
[[abstract]]Software quality is primarily determined by the quality of the software development proc...
Ensuring software reliability is a critical problem in the software development process. There are t...
The pervasiveness of computer systems in virtually every aspect of daily life entails a growing depe...
Workflows describe sequences of tasks to achieve goals. These sequences can contain decisions, loops...
Analyzing the program conditional control flow the important technique using in program execution. S...
Abstract. State explosion in model checking continues to be the primary obstacle to widespread use o...
The control flow of programs can be represented by directed graphs. In this paper we provide a unifo...
Traditional flow analysis techniques, such as the ones typically employed by optimising Fortran comp...
DOI
Add to ORKG