Verifying of interface assertions for infinite state Mealy machines
Author:
- Manfred BroyMBManfred Broy
- 1 November 2014
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 80 (7) , 1298-1322
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Turing machines, transition systems, and interactionInformation and Computation, 2004
- Why Church's Thesis Still Holds. Some Notes on Peter Wegner's Tracts on Interaction and ComputabilityThe Computer Journal, 1998
- Why interaction is more powerful than algorithmsCommunications of the ACM, 1997
- Adding fair choice to Dijkstra's calculusACM Transactions on Programming Languages and Systems, 1994
- Elements of interactionCommunications of the ACM, 1993
- Concurrency and computability1990
- Computable nondeterministic functions1978
- Data Types as LatticesSIAM Journal on Computing, 1976