Verifying traits: an incremental proof system for fine-grained reuse
From MaRDI portal
Publication:736803
DOI10.1007/s00165-013-0278-3zbMath1342.68059OpenAlexW1967305746MaRDI QIDQ736803
Ferruccio Damiani, Einar Broch Johnsen, Ina Schaefer, Johan Dovland
Publication date: 5 August 2016
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2318/150050
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (4)
Traits: correctness-by-construction for free ⋮ Flexible Correct-by-Construction Programming ⋮ A proof system for adaptable class hierarchies ⋮ Verifying traits: an incremental proof system for fine-grained reuse
Uses Software
Cites Work
- Featherweight Jigsaw. Replacing inheritance by composition in Java-like languages
- Incremental reasoning with lazy behavioral subtyping for multiple inheritance
- Lazy behavioral subtyping
- Verifying traits: an incremental proof system for fine-grained reuse
- Verification of sequential and concurrent programs
- Creol: A type-safe object-oriented model for distributed concurrent systems
- Extending FeatherTrait Java with interfaces
- An axiomatic proof technique for parallel programs
- Combining traits with boxes and ownership types in a Java-like setting
- On flexible dynamic trait replacement for Java-like languages
- Behavioral interface specification languages
- Separation logic, abstraction and inheritance
- Ten Years of Hoare's Logic: A Survey—Part I
- Separation Logic for Multiple Inheritance
- KeY: A Formal Method for Object-Oriented Systems
- An axiomatic basis for computer programming
This page was built for publication: Verifying traits: an incremental proof system for fine-grained reuse
