Evolving algebras 1993: Lipari guide
Specification and validation methods
Sequential abstract-state machines capture sequential algorithms
ACM Transactions on Computational Logic (TOCL)
A semantic characterization of unbounded-nondeterministic abstract state machines
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
The church-turing thesis over arbitrary domains
Pillars of computer science
Exact exploration and hanging algorithms
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Fields of logic and computation
| Hi-index | 0.00 |
We propose a formalization of analog algorithms, extending the framework of abstract state machines to continuous-time models of computation.