Proving the correctness of behavioural implementations
From MaRDI portal
Publication:5096383
Recommendations
- Modular correctness proofs of behavioural implementations
- Correctness proofs for abstract implementations
- Proving the Correctness of the Implementation of a Control-Command Algorithm
- scientific article; zbMATH DE number 3938540
- scientific article; zbMATH DE number 17803
- Toward compiler implementation correctness proofs
- Hidden coinduction: behavioural correctness proofs for objects
- scientific article; zbMATH DE number 2013592
- Validating behavioral component interfaces in rewriting logic
Cites work
- scientific article; zbMATH DE number 3888893 (Why is no real title available?)
- scientific article; zbMATH DE number 4033040 (Why is no real title available?)
- scientific article; zbMATH DE number 3776831 (Why is no real title available?)
- scientific article; zbMATH DE number 517385 (Why is no real title available?)
- scientific article; zbMATH DE number 1142323 (Why is no real title available?)
- scientific article; zbMATH DE number 1761887 (Why is no real title available?)
- scientific article; zbMATH DE number 4113952 (Why is no real title available?)
- scientific article; zbMATH DE number 3235223 (Why is no real title available?)
- Behavioural and abstractor specifications
- Behavioural theories and the proof of behavioural properties
- Modular correctness proofs of behavioural implementations
- Proof of correctness of data representations
- Toward formal development of programs from algebraic specifications: Implementations revisited
Cited in
(11)- scientific article; zbMATH DE number 1735620 (Why is no real title available?)
- scientific article; zbMATH DE number 1696758 (Why is no real title available?)
- Behavioural correctness of data representations
- Object-oriented hybrid systems of coalgebras plus monoid actions
- A semi-algorithm for algebraic implementation proofs
- scientific article; zbMATH DE number 17803 (Why is no real title available?)
- Modular correctness proofs of behavioural implementations
- Swinging types=functions+relations+transition systems
- Observational implementations
- Behavioural satisfaction and equivalence in concrete model categories
- Proving correctness w.r.t. specifications with hidden parts
This page was built for publication: Proving the correctness of behavioural implementations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096383)