Extended abstract of a hidden agenda
- Oxford Univ. (United Kingdom)
The initial goal of our hidden research programme was both straightforward and ambitious: give a semantics for software engineering, and in particular for the object paradigm, supporting correctness proofs that are as simple and mechanical as possible. This emphasizes proofs rather than models, and thus suggests an equational approach, rather than one based on higher order logic, denotational semantics, or any kind of model, because equational proofs achieve maximal simplicity and mechanization, and yet are fully expressive. We introduce powerful coinduction techniques for proving behavioral properties of complex systems. We make the no doubt outrageous claim that our hidden approach gives simpler proofs than other formalisms; this is because we exploit algebraic structure that most other approaches discard.
- OSTI ID:
- 466447
- Report Number(s):
- CONF-9610138--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Extending Automatic Parallelization to Optimize High-Level Abstractions for Multicore
Proving refinement transformations using extended denotational semantics