Combining dynamic and static slicing for analysing assembler
From MaRDI portal
Publication:2266945
DOI10.1016/J.SCICO.2009.11.001zbMATH Open1191.68174OpenAlexW1980072053MaRDI QIDQ2266945FDOQ2266945
Authors: Hussein Zedan, Martin Ward
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
Recommendations
Cites Work
- Portability by automatic translation: A large-scale case study
- Title not available (Why is that?)
- Dynamic program slicing
- The 3x + 1 Problem and Its Generalizations
- Flow diagrams, turing machines and languages with only two formation rules
- Program Slicing
- Proving total correctness of nondeterministic programs in infinitary logic
- Pigs from sausages? Reengineering from assembler to C via FermaT transformations
- Title not available (Why is that?)
- Combining dynamic and static slicing for analysing assembler
- Algorithms for computing the static single assignment form
Cited In (2)
Uses Software
This page was built for publication: Combining dynamic and static slicing for analysing assembler
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2266945)