The paper describes a system which is able, given execution traces of formal program specifications, to surmise relevant program properties. The system is embedded in an environment of software development by levels of abstractions. A surmising algorithm is given which is based on generalization, instantiation by symbolic execution and symbolic execution trace analysis. Examples are given which illustrate the behaviour and the capabilities of the system. Finally, conditions are given on program specification schemata which guarantee that the surmised properties actually hold.
Surmising properties from computations
SIROVICH, Franco
1978-01-01
Abstract
The paper describes a system which is able, given execution traces of formal program specifications, to surmise relevant program properties. The system is embedded in an environment of software development by levels of abstractions. A surmising algorithm is given which is based on generalization, instantiation by symbolic execution and symbolic execution trace analysis. Examples are given which illustrate the behaviour and the capabilities of the system. Finally, conditions are given on program specification schemata which guarantee that the surmised properties actually hold.
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.
