Tentative steps toward a development method for interfering programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Kit: A Study in Operating System Verification
IEEE Transactions on Software Engineering
An experiment in high level language microprogramming and verification
Communications of the ACM
A model for verification of data security in operating systems
Communications of the ACM
Correctness-preserving program transformations
POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Data abstraction and information hiding
ACM Transactions on Programming Languages and Systems (TOPLAS)
Scientific Decisions which Characterize VDM
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Programming methodology
An algebraic description of programs with assertions, verification and simulation
Proceedings of ACM conference on Proving assertions about programs
The Early Search for Tractable Ways of Reasoning about Programs
IEEE Annals of the History of Computing
Proof of correctness of data representations
Software pioneers
A theory of normed simulations
ACM Transactions on Computational Logic (TOCL)
A laboratory for the study of automating programming
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Inclusion dynamics hybrid automata
Information and Computation
On probabilistic kleene algebras, automata and simulations
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Correct transformation: From object-based graph grammars to PROMELA
Science of Computer Programming
Managing evolution in software product lines: a model-checking perspective
Proceedings of the Sixth International Workshop on Variability Modeling of Software-Intensive Systems
Simulation-based abstractions for software product-line model checking
Proceedings of the 34th International Conference on Software Engineering
Learning Probabilistic Systems from Tree Samples
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Assume-guarantee abstraction refinement for probabilistic systems
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Towards an incremental automata-based approach for software product-line model checking
Proceedings of the 16th International Software Product Line Conference - Volume 2
| Hi-index | 0.03 |
A simulation relation between programs is defined which is quasi-ordering. Mutual simulation is then an equivalence relation, and by dividing out by it we abstract from a program such details as how the sequencing is controlled and how data is represented. The equivalence classes are approxiamtions to the algorithms which are realized, or expressed, by their member programs. A technique is given and illustrated for proving simulation and equivalence of programs; there is an analogy with Floyd''s technique for proving correctness of programs. Finally, necessary and sufficient conditions for simulation are given.