Abstract

Many powerful specification languages are based on set theory, such as Z ([12]) and B ([1]) derived from VDM([6]). To validate a specification developed along such lines at a formal level, one needs tools to manipulate logical formulas on sets. Behavioral properties of modules specified in this manner can be naturally described using intentional sets and constraints on the global state variables of the specification. In this work we propose a method for such purposes of validation, by constructing a logic program meant as a "synthesis" of the behaviour of the state variables under the operations of the specification. The logic program thus constructed admits as a natural model the set of all reachable values of the state variables, after the execution of any sequence of operations. The main interest of such an approach is that it can allow us to prove the properties of a program; in addition, we can also use the logic program as a "prototype" capable of testing if a given value is reac...

Citations