A unifying theory of control dependence and its application to arbitrary program structures
DOI10.1016/j.tcs.2011.08.033zbMath1231.68179OpenAlexW2152565800WikidataQ59609313 ScholiaQ59609313MaRDI QIDQ650921
Mark Harman, Michael R. Laurence, Richard W. Barraclough, Sebastian Danicic, John D. Howroyd, Ákos Kiss
Publication date: 7 December 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://publicatio.bibl.u-szeged.hu/1568/2/danicic-condep-authorscopy.pdf
graph theoryformal methodsprogram analysisprogram slicingsoftware engineeringprogram semanticscontrol dependenceprogram dependence
Graph theory (including graph drawing) in computer science (68R10) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (8)
Cites Work
- A trajectory-based strict semantics for program slicing
- Slicing for modern program structures: a theory for eliminating irrelevant loops
- A non-standard semantics for program slicing and dependence analysis
- A formal relationship between program slicing and partial evaluation
- Theoretical foundations of dynamic program slicing
- A formalisation of the relationship between forms of program slicing
- Program Slicing
- The program dependence graph and its use in optimization
- Eliminating go to's while preserving program structure
- Certification of programs for secure information flow
- Programming Languages and Systems
- Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
This page was built for publication: A unifying theory of control dependence and its application to arbitrary program structures