ABSTRACT EXECUTION OF PROGRAMS

Abstract

Compilation time analysis of programs is usually incomplete. One of the basic methods for static determination of the program's dynamic properties is symbolic execution. Symbolic execution still fails to satisfy practical requirements, mainly because of the high execution time and memory requirement, theorem proving and program termination problems. In this paper new methods are presented which can make symbolic execution applicable in everyday work, e.g. in programming microprocessor equipment.