Parallel program design: a foundation
Parallel program design: a foundation
The maximum-segment-sum problem
Formal development programs and proofs
Evolving algebras 1993: Lipari guide
Specification and validation methods
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Models of Computation: Exploring the Power of Computing
Models of Computation: Exploring the Power of Computing
The Complexity of Computing
Why Use Evolving Algebras for Hardware and Software Engineering?
SOFSEM '95 Proceedings of the 22nd Seminar on Current Trends in Theory and Practice of Informatics
Inadequacy of computable loop invariants
ACM Transactions on Computational Logic (TOCL)
Generating finite state machines from abstract state machines
ISSTA '02 Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis
Mode-automata: a new domain-specific construct for the development of safe critical systems
Science of Computer Programming - Special issure on formal methods for industrial critical systems (FMICS 2000)
A Verification Approach for Distributed Abstract State Machines
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Modeling Software: From Theory to Practice
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Abstract State Machines and Pure Mathematics
ASM '00 Proceedings of the International Workshop on Abstract State Machines, Theory and Applications
An ASM Dynamic Semantics for Standard ML
ASM '00 Proceedings of the International Workshop on Abstract State Machines, Theory and Applications
Abstract State Machines at the Cusp of the Millenium
ASM '00 Proceedings of the International Workshop on Abstract State Machines, Theory and Applications
Modeling the Dynamics of UML State Machines
ASM '00 Proceedings of the International Workshop on Abstract State Machines, Theory and Applications
Composition and Submachine Concepts for Sequential ASMs
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Background, Reserve, and Gandy Machines
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Model Checking Object-Z Using ASM
IFM '02 Proceedings of the Third International Conference on Integrated Formal Methods
Operational semantics of transactions
ADC '03 Proceedings of the 14th Australasian database conference - Volume 17
Abstract state machines capture parallel algorithms
ACM Transactions on Computational Logic (TOCL)
Irredundant Algorithms for Traversing Directed Graphs: The Deterministic Case
Programming and Computing Software
Modeling the meaning of transitions from and to concurrent states in UML state machines
Proceedings of the 2003 ACM symposium on Applied computing
Irredundant Algorithms for Traversing Directed Graphs: The Nondeterministic Case
Programming and Computing Software
Abstract Communication Model for Distributed Systems
IEEE Transactions on Software Engineering
Quality-Assured Design of On-Line Analytical Processing Systems using Abstract State Machines
QSIC '04 Proceedings of the Quality Software, Fourth International Conference
A Guarded Fragment for Abstract State Machines
Journal of Logic, Language and Information
Balancing redundancy and query costs in distributed data warehouses
APCCM '05 Proceedings of the 2nd Asia-Pacific conference on Conceptual modelling - Volume 43
A logic for secure memory access of abstract state machines
Theoretical Computer Science - Abstract state machines and high-level system design and analysis
Quality Assurance in the Design of Web Information Systems
QSIC '05 Proceedings of the Fifth International Conference on Quality Software
Ordinary interactive small-step algorithms, I
ACM Transactions on Computational Logic (TOCL)
Theoretical Computer Science - Formal methods for components and objects
ASM-based design of data warehouses and on-line analytical processing systems
Journal of Systems and Software - Special issue: Quality software
A Logic Framework for Verification of Timed Algorithms
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
Can abstract state machines be useful in language theory?
Theoretical Computer Science
Ordinary interactive small-step algorithms, II
ACM Transactions on Computational Logic (TOCL)
Ordinary interactive small-step algorithms, III
ACM Transactions on Computational Logic (TOCL)
Test case generation from formal models through abstraction refinement and model checking
Proceedings of the 3rd international workshop on Advances in model-based testing
ASM-based model of dynamic service update in OSGi
ACM SIGSOFT Software Engineering Notes
Abstract state machines capture parallel algorithms: Correction and extension
ACM Transactions on Computational Logic (TOCL)
The Abstract State Machines Method: Preface
Fundamenta Informaticae - This is a SPECIAL ISSUE ON ASM'05
CoreASM: An Extensible ASM Execution Engine
Fundamenta Informaticae - This is a SPECIAL ISSUE ON ASM'05
Early fault detection with model-based testing
Proceedings of the 7th ACM SIGPLAN workshop on ERLANG
Liberate Computer User from Programming
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
The computable kernel of Abstract State Machines
Theoretical Computer Science
ER '08 Proceedings of the ER 2008 Workshops (CMLSA, ECDM, FP-UML, M2AS, RIGiM, SeCoGIS, WISM) on Advances in Conceptual Modeling: Challenges and Opportunities
Model Driven Specification of Ontology Translations
ER '08 Proceedings of the 27th International Conference on Conceptual Modeling
Formalizing Operational Semantic Specifications in Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Model Based Testing of a Network-on-Chip Component
Electronic Notes in Theoretical Computer Science (ENTCS)
ER '09 Proceedings of the ER 2009 Workshops (CoMoL, ETheCoM, FP-UML, MOST-ONISW, QoIS, RIGiM, SeCoGIS) on Advances in Conceptual Modeling - Challenging Perspectives
Electronic Notes in Theoretical Computer Science (ENTCS)
Operational semantics for declarative multi-paradigm languages
Journal of Symbolic Computation
Remarks on turbo ASMs for functional equations and recursion schemes
ASM'03 Proceedings of the abstract state machines 10th international conference on Advances in theory and practice
The hidden computation steps of turbo abstract state machines
ASM'03 Proceedings of the abstract state machines 10th international conference on Advances in theory and practice
Quantum computing and abstract state machines
ASM'03 Proceedings of the abstract state machines 10th international conference on Advances in theory and practice
Consistent integration for sequential abstract state machines
ASM'03 Proceedings of the abstract state machines 10th international conference on Advances in theory and practice
Privacy, abstract encryption and protocols: an ASM model - part I
ASM'03 Proceedings of the abstract state machines 10th international conference on Advances in theory and practice
Building a reliable multicast service based on composite protocols for active networks
IWAN'04 Proceedings of the 6th IFIP TC6 international working conference on Active networks
Refinements in typed abstract state machines
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
A semantic characterization of unbounded-nondeterministic abstract state machines
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Automatic testing from formal specifications
TAP'07 Proceedings of the 1st international conference on Tests and proofs
SEUS'07 Proceedings of the 5th IFIP WG 10.2 international conference on Software technologies for embedded and ubiquitous systems
Term rewriting for web information systems: termination and church-rosser property
WISE'07 Proceedings of the 8th international conference on Web information systems engineering
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Towards a logic for abstract metafinite state machines
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
The church-turing thesis over arbitrary domains
Pillars of computer science
A service-oriented approach to web warehousing
Proceedings of the 11th International Conference on Information Integration and Web-based Applications & Services
Adaptive security protocol selection for mobile computing
Journal of Network and Computer Applications
Persistent queries in the behavioral theory of algorithms
ACM Transactions on Computational Logic (TOCL)
Exact exploration and hanging algorithms
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
A formal model for service mediators
ER'10 Proceedings of the 2010 international conference on Advances in conceptual modeling: applications and challenges
A customised ASM thesis for database transformations
Acta Cybernetica
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
Fields of logic and computation
ASMs and operational algorithmic completeness of lambda calculus
Fields of logic and computation
Fixed-point definability and polynomial time on chordal graphs and line graphs
Fields of logic and computation
Abstract state machines and the inquiry process
Fields of logic and computation
Program optimization using abstract state machines
MMACTEE'06 Proceedings of the 8th WSEAS international conference on Mathematical methods and computational techniques in electrical engineering
Model based testing of cryptographic protocols
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
Dependently-typed formalisation of relation-algebraic abstractions
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Information systems in modeling interactive computations on granules
Theoretical Computer Science
A proof system with bounded non-determinism in database transformations
SDKB'10 Proceedings of the 4th international conference on Semantics in data and knowledge bases
Modeling and verification of MPI based distributed software
EuroPVM/MPI'06 Proceedings of the 13th European PVM/MPI User's Group conference on Recent advances in parallel virtual machine and message passing interface
Simulator for real-time abstract state machines
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
How expressive are petri net schemata?
ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Modeling- and analysis techniques for web services and business processes
FMOODS'05 Proceedings of the 7th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
On the expressive power of petri net schemata
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Can abstract state machines be useful in language theory?
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
An ASM-Characterization of a class of distributed algorithms
Rigorous Methods for Software Construction and Analysis
An abstract machine architecture for web service based business process management
BPM'05 Proceedings of the Third international conference on Business Process Management
Making specifications complete through models
Proceedings of the 2004 international conference on Architecting Systems with Trustworthy Components
Abstract state machines for data-parallel computing
Conceptual Modelling and Its Theoretical Foundations
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Synchronous parallel database transformations
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
ASM2Bogor: An approach for verification of models specified through Asmeta language
Journal of Visual Languages and Computing
Towards an axiomatization of simple analog algorithms
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
A simplified parallel ASM thesis
ABZ'12 Proceedings of the Third international conference on Abstract State Machines, Alloy, B, VDM, and Z
A Representation Theorem for Primitive Recursive Algorithms
Fundamenta Informaticae
Functionals Using Bounded Information and the Dynamics of Algorithms
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
The Abstract State Machines Method
Fundamenta Informaticae - This is a SPECIAL ISSUE ON ASM'05
CoreASM: An Extensible ASM Execution Engine
Fundamenta Informaticae - This is a SPECIAL ISSUE ON ASM'05
Foundational analyses of computation
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
A Logic Framework for Verification of Timed Algorithms
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Evolving graph-structures and their implicit computational complexity
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
We examine sequential algorithms and formulate a sequential-time postulate, an abstract-state postulate, and a bounded-exploration postulate . Analysis of the postulates leads us to the notion of sequential abstract-state machine and to the theorem in the title. First we treat sequential algorithms that are deterministic and noninteractive. Then we consider sequential algorithms that may be nondeterministic and that may interact with their environments.