Verifying traits: an incremental proof system for fine-grained reuse
From MaRDI portal
Recommendations
Cites work
- An axiomatic basis for computer programming
- An axiomatic proof technique for parallel programs
- Behavioral interface specification languages
- Combining traits with boxes and ownership types in a Java-like setting
- Creol: A type-safe object-oriented model for distributed concurrent systems
- Extending FeatherTrait Java with interfaces
- Featherweight Jigsaw. Replacing inheritance by composition in Java-like languages
- Incremental reasoning with lazy behavioral subtyping for multiple inheritance
- KeY: A Formal Method for Object-Oriented Systems
- Lazy behavioral subtyping
- On flexible dynamic trait replacement for Java-like languages
- Separation Logic for Multiple Inheritance
- Separation logic, abstraction and inheritance
- Ten Years of Hoare's Logic: A Survey—Part I
- Verification of sequential and concurrent programs
- Verifying traits: an incremental proof system for fine-grained reuse
Cited in
(7)- Combining traits with boxes and ownership types in a Java-like setting
- On flexible dynamic trait replacement for Java-like languages
- Flexible Correct-by-Construction Programming
- Verifying traits: an incremental proof system for fine-grained reuse
- Extending FeatherTrait Java with interfaces
- A proof system for adaptable class hierarchies
- Traits: correctness-by-construction for free
This page was built for publication: Verifying traits: an incremental proof system for fine-grained reuse
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q736803)