Modular reasoning in the presence of subclassing
Proceedings of the tenth annual conference on Object-oriented programming systems, languages, and applications
Algebraic approaches to nondeterminism—an overview
ACM Computing Surveys (CSUR)
Subtyping and constructive specification
Nordic Journal of Computing
On introducing higher order functions in ABEL
Nordic Journal of Computing
The Need for Compositional Proof Systems: A Survey
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
The roots of object orientation: the Simula language
Software pioneers
Undefinedness vs. underspecification in HALDEN ASL
Nordic Journal of Computing
ACM SIGPLAN Notices
Verification of an Off-Line Checker for Priority Queues
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Validating Behavioral Component Interfaces in Rewriting Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Axiomatic criteria for quotients and subobjects for higher-order data types
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Abstraction barrier-observing relational parametricity
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
A temporal approach to specification and verification of pointer data-structures
FASE'03 Proceedings of the 6th international conference on Fundamental approaches to software engineering
An axiomatic semantics for data-parallel computation
IW-FM'97 Proceedings of the 1st Irish conference on Formal Methods
Compositional reasoning about shared futures
SEFM'12 Proceedings of the 10th international conference on Software Engineering and Formal Methods
| Hi-index | 0.00 |
From the Publisher:Verifiable Programming is concerned with the techniques of reasoning about program specification. The author introduces verifiability, a powerful quality criterion which has a profound influence on programming style.