Combining dynamic and static slicing for analysing assembler
From MaRDI portal
Publication:2266945
Recommendations
Cites work
- scientific article; zbMATH DE number 3574936 (Why is no real title available?)
- scientific article; zbMATH DE number 1927431 (Why is no real title available?)
- Algorithms for computing the static single assignment form
- Combining dynamic and static slicing for analysing assembler
- Dynamic program slicing
- Flow diagrams, turing machines and languages with only two formation rules
- Pigs from sausages? Reengineering from assembler to C via FermaT transformations
- Portability by automatic translation: A large-scale case study
- Program Slicing
- Proving total correctness of nondeterministic programs in infinitary logic
- The 3x + 1 Problem and Its Generalizations
Cited in
(2)
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)