A method, postdomination, used to reduce the space requirements of data flow analysis (DFA) was discussed. A formal proof system was used that contained an approximation of the information collected at nodes when all paths were executed. The Java bytecode verification in particular fit the requirements and the proposed algorithm was used to develop a Verifier on memory limited embedded systems. The approach used has the potential to be feasible for a large number of programs, for a given amount of RAM, since the maximum nesting depth is largely independent from the total number of control instructions.
Using postdomination to reduce space requirements of data flow analysis
BERNARDESCHI, CINZIA;LETTIERI, GIUSEPPE;MASCI, PAOLO MANUEL
2006-01-01
Abstract
A method, postdomination, used to reduce the space requirements of data flow analysis (DFA) was discussed. A formal proof system was used that contained an approximation of the information collected at nodes when all paths were executed. The Java bytecode verification in particular fit the requirements and the proposed algorithm was used to develop a Verifier on memory limited embedded systems. The approach used has the potential to be feasible for a large number of programs, for a given amount of RAM, since the maximum nesting depth is largely independent from the total number of control instructions.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
