Semantic Scholar Open Access 2001 866 sitasi

A Logic for Abstract State Machines

R. Stärk Stanislas Nanchen

Lihat Sumber DOI

Abstrak

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.

Topik & Kata Kunci

Computer Science

Penulis (2)

R. Stärk

Stanislas Nanchen

Format Sitasi

APA MLA BibTeX

Stärk, R., Nanchen, S. (2001). A Logic for Abstract State Machines. https://doi.org/10.3217/jucs-007-11-0980

Akses Cepat

Lihat di Sumber doi.org/10.3217/jucs-007-11-0980

Informasi Jurnal

Tahun Terbit: 2001
Bahasa: en
Total Sitasi: 866×
Sumber Database: Semantic Scholar
DOI: 10.3217/jucs-007-11-0980
Akses: Open Access ✓