Referential opacity in nondeterministic data refinement
ACM Letters on Programming Languages and Systems (LOPLAS)
A complete calculus for the multialgebraic and functional semantics of nondeterminism
ACM Transactions on Programming Languages and Systems (TOPLAS)
State abstraction and modular software development
SIGSOFT '95 Proceedings of the 3rd ACM SIGSOFT symposium on Foundations of software engineering
Algebraic approaches to nondeterminism—an overview
ACM Computing Surveys (CSUR)
The Formal Classification and Verification of Simpson's 4-Slot Asynchronous Communication Mechanism
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
Compositional Homomorphisms of Relational Structures
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
The Early Search for Tractable Ways of Reasoning about Programs
IEEE Annals of the History of Computing
A complete axiomatic semantics of spawning
Distributed Computing
Verification of an Off-Line Checker for Priority Queues
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Theoretical Computer Science
Splitting Atoms with Rely/Guarantee Conditions Coupled with Data Reification
ABZ '08 Proceedings of the 1st international conference on Abstract State Machines, B and Z
On a semantic definition of data independence
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Abstraction as a unifying link for formal approaches to concurrency
SEFM'12 Proceedings of the 10th international conference on Software Engineering and Formal Methods
Data refinement in Isabelle/HOL
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
| Hi-index | 0.00 |