Combining dynamic and static slicing for analysing assembler
From MaRDI portal
Publication:2266945
DOI10.1016/j.scico.2009.11.001zbMath1191.68174OpenAlexW1980072053MaRDI QIDQ2266945
Publication date: 26 February 2010
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.scico.2009.11.001
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Dynamic program slicing
- Proving total correctness of nondeterministic programs in infinitary logic
- Portability by automatic translation: A large-scale case study
- Pigs from sausages? Reengineering from assembler to C via FermaT transformations
- Combining dynamic and static slicing for analysing assembler
- Program Slicing
- Algorithms for computing the static single assignment form
- The 3x + 1 Problem and Its Generalizations
- Flow diagrams, turing machines and languages with only two formation rules
This page was built for publication: Combining dynamic and static slicing for analysing assembler