Evolving algebras 1993: Lipari guide
Specification and validation methods
Dynamic Logic
Java and the Java Virtual Machine: Definition, Verification, Validation with Cdrom
Java and the Java Virtual Machine: Definition, Verification, Validation with Cdrom
Symbolic Analysis of Transition Systems
ASM '00 Proceedings of the International Workshop on Abstract State Machines, Theory and Applications
Encoding Abstract State Machines in PVS
ASM '00 Proceedings of the International Workshop on Abstract State Machines, Theory and Applications
Composition and Submachine Concepts for Sequential ASMs
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Peer-to-peer form based web information systems
ADC '06 Proceedings of the 17th Australasian Database Conference - Volume 49
A Hoare-style verification calculus for control state ASMs
Proceedings of the Fifth Balkan Conference in Informatics
| Hi-index | 0.00 |
We introduce a logic for sequential, non distributed Abstract State Machines. Unlike other logics for ASMs which are based on dynamic logic, our logic is based on atomic propositions for the function updates of transition rules. We do not assume that the transition rules of ASMs are in normal form, for example, that they concern distinct cases. Instead we allow structuring concepts of ASM rules including sequential composition and possibly recursive submachine calls. We show that several axioms that have been proposed for reasoning about ASMs are derivable in our system and that the logic is complete for hierarchical (non-recursive) ASMs.