Latest revision as of 13:37, 5 April 2016

Contents

This tool is a realisation of the algorithm described in [1,2] for testing wether an executable specification in partial memebership equational logic can be regarded "as is" to be a specification in (non-partial) membership equational logic. More precisely, the algorithm tests wether the given specification is equivalent in the total world with its envelope.

where Name is the quoted name of the module to be tested and Bool is the same switch as upModule accepts (tells wether to build a module taking into account all the import commands or not). This command will return true if the given theory is a duplex. If it fails to prove automatically the duplex property then it will print the goals which it could not solve.

red in DUPLEX : envelope(Name, Bool) .

with the same meaning for the arguments as above returns the envelope of Name.