Pith. sign in

REVIEW 2 cited by

Evolving Algebras 1993: Lipari Guide

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1808.06255 v1 pith:UGCI6OP2 submitted 2018-08-19 cs.LO cs.SEmath.LO

Yuri Gurevich This is my paper · ORCID
classification cs.LOcs.SEmath.LO
keywords asmsmachinesalgebrasevolvingguidethesisversatileable
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Computation models and specification methods seem to be worlds apart. The project on abstract state machines (in short ASMs, also known as evolving algebras) started as an attempt to bridge the gap by improving on Turing's thesis. We sought more versatile machines which would be able to step-for-step simulate arbitrary algorithms on their natural abstraction levels. The ASM thesis asserts that ASMs are such versatile machines. The guide provides the definitions of sequential, parallel and distributed ASMs.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. How to Win First-Order Safety Games

    cs.LO 2019-08 conditional novelty 7.0 of 10

    First-order safety games reduce winning-strategy synthesis to second-order quantifier elimination, with monadic games classified and an implemented solver that synthesizes strategies for leader election and conference...

  2. Basic interactive algorithms: Preview

    cs.LO 2025-08 unverdicted novelty 3.0 of 10

    The paper previews an upcoming axiomatization in which probabilistic and quantum algorithms are modeled as basic sequential algorithms with oracles, extending the classical abstract state machine thesis.

Pith tools