Evolving algebras 1993: Lipari guide
Specification and validation methods
Sequential abstract-state machines capture sequential algorithms
ACM Transactions on Computational Logic (TOCL)
Datalog LITE: a deductive query language with linear time model checking
ACM Transactions on Computational Logic (TOCL)
Java and the Java Virtual Machine: Definition, Verification, Validation with Cdrom
Java and the Java Virtual Machine: Definition, Verification, Validation with Cdrom
Guarded fixed point logics and the monadic theory of countable trees
Theoretical Computer Science - Complexity and logic
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Abstract state machines capture parallel algorithms
ACM Transactions on Computational Logic (TOCL)
Quantum computing and abstract state machines
ASM'03 Proceedings of the abstract state machines 10th international conference on Advances in theory and practice
Deciding the verification problem for abstract state machines
ASM'03 Proceedings of the abstract state machines 10th international conference on Advances in theory and practice
| Hi-index | 0.00 |
Abstract State Machines (ASMs) provide a formal method for transparent design and specification of complex dynamic systems. They combine advantages of informal and formal methods. Applications of this method motivate a number of computability and decidability problems connected to ASMs. Such problems result for example from the area of verifying properties of ASMs. Their high expressive power leads rather directly to undecidability respectively uncomputability results for most interesting problems in the case of unrestricted ASMs. Consequently, it is rather natural to ask whether there exist expressive classes of ASMs for which we can prove positive decidability and computability results. In this work, we introduce such a class of ASMs. The concept is similar to the one of the guarded fragment of first-order logic. We analyze the expressive power of this class and prove that it is stronger than Datalog LITE and the guarded fragment of first-order fixed point logic. Some decidability and computability results have been proven in earlier works.