Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
434487 | Science of Computer Programming | 2009 | 24 Pages |
Abstract
This work presents a general mechanism for executing specifications that comply with given invariants, which may be expressed in different formalisms and logics. We exploit Maude’s reflective capabilities and its properties as a general semantic framework to provide a generic strategy that allows us to execute Maude specifications taking into account user-defined invariants. The strategy is parameterized by the invariants and by the logic in which such invariants are expressed. We experiment with different logics, providing examples for propositional logic, (finite future time) linear temporal logic and metric temporal logic.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics