Evolving algebras 1993: Lipari guide
Specification and validation methods
Sequential abstract-state machines capture sequential algorithms
ACM Transactions on Computational Logic (TOCL)
Modeling Software: From Theory to Practice
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
State Isomorphism in Model Programs with Abstract Data Structures
FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
An SMT Approach to Bounded Reachability Analysis of Model Programs
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Protocol Modeling with Model Program Composition
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
ER '09 Proceedings of the ER 2009 Workshops (CoMoL, ETheCoM, FP-UML, MOST-ONISW, QoIS, RIGiM, SeCoGIS) on Advances in Conceptual Modeling - Challenging Perspectives
Artificial Intelligence
Partial Updates in Complex-Value Databases
Proceedings of the 2011 conference on Information Modelling and Knowledge Bases XXII
Yuri, logic, and computer science
Fields of logic and computation
Model based testing of cryptographic protocols
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
Rigorous Methods for Software Construction and Analysis
ΣK-constraints for hybrid systems
PSI'09 Proceedings of the 7th international Andrei Ershov Memorial conference on Perspectives of Systems Informatics
Making specifications complete through models
Proceedings of the 2004 international conference on Architecting Systems with Trustworthy Components
RAM Simulation of BGS Model of Abstract-state Machines
Fundamenta Informaticae - This is a SPECIAL ISSUE ON ASM'05
Executable formal specifications of complex distributed systems with CoreASM
Science of Computer Programming
| Hi-index | 0.00 |
The reserve of a state of an abstract state machine was defined to be a "naked set". In applications, it may be convenient to have tuples, sets, lists, arrays, etc. defined ahead of time on all elements, including the reserve elements. We generalize the notion of reserve appropriately. As an application, we solve a foundational problem in Gandy's formalization of mechanical devices.