Pages that link to "Item:Q2554952"
From MaRDI portal
The following pages link to Proof of correctness of data representations (Q2554952):
Displaying 50 items.
- Logical relations and parametricity -- a Reynolds programme for category theory and programming languages (Q280200) (← links)
- Object-oriented programming: some history, and challenges for the next fifty years (Q393077) (← links)
- Invariant diagrams with data refinement (Q432148) (← links)
- Certifying algorithms (Q465678) (← links)
- Formal communication elimination and sequentialization equivalence proofs for distributed system models (Q466919) (← links)
- Interface theories for concurrency and data (Q549177) (← links)
- Prespecification in data refinement (Q578901) (← links)
- Blaming the client: on data refinement in the presence of pointers (Q607403) (← links)
- Abstraction for concurrent objects (Q615951) (← links)
- Algebraic proofs of consistency and completeness (Q672320) (← links)
- On the correctness of modular systems (Q674009) (← links)
- A single complete rule for data refinement (Q684396) (← links)
- A theory of software product line refinement (Q714875) (← links)
- A formal abstract framework for modelling and testing complex software systems (Q714878) (← links)
- Components as coalgebras: the refinement dimension (Q820141) (← links)
- An analysis of refinement in an abortive paradigm (Q851133) (← links)
- Observational purity and encapsulation (Q882452) (← links)
- Do-it-yourself type theory (Q911744) (← links)
- Semantical analysis of specification logic (Q913527) (← links)
- Verifying atomic data types (Q914403) (← links)
- Derivation of efficient parallel programs: An example from genetic sequence analysis (Q916411) (← links)
- A mechanical analysis of program verification strategies (Q928673) (← links)
- A view of computability on term algebras (Q1051428) (← links)
- Non-deterministic data types: Models and implementations (Q1058286) (← links)
- Pushdown machines for the macro tree transducer (Q1089810) (← links)
- Crypt-equivalent algebraic specifications (Q1095646) (← links)
- Proving entailment between conceptual state specifications (Q1095649) (← links)
- Algebraic specifications of computable and semicomputable data types (Q1098613) (← links)
- Equational specification of partial higher-order algebras (Q1102736) (← links)
- Semantics and verification of monitors and systems of monitors and processes (Q1112588) (← links)
- Auxiliary variables in data refinement (Q1114384) (← links)
- Correctness proofs for abstract implementations (Q1119388) (← links)
- Final algebra semantics and data type extensions (Q1131834) (← links)
- An approach for data type specification and its use in program verification (Q1137374) (← links)
- Hierarchical program specification and verification - a many-sorted logical approach (Q1138904) (← links)
- Invariants in the application-oriented specification of control systems (Q1159109) (← links)
- Specifications, models, and implementations of data abstractions (Q1161277) (← links)
- Data refinement of predicate transformers (Q1177155) (← links)
- Iterated stack automata and complexity classes (Q1183602) (← links)
- Language design methods based on semantic principles (Q1225927) (← links)
- On a new approach to representation independent data classes (Q1234589) (← links)
- Proving programs correct through refinement (Q1242447) (← links)
- The correctness of the Schorr-Waite list marking algorithm (Q1250706) (← links)
- Program refinement in fair transition systems (Q1323314) (← links)
- The lattice of data refinement (Q1323380) (← links)
- Software perfective maintenance: Including retrainable software in software reuse (Q1328513) (← links)
- Essential concepts of algebraic specification and program development (Q1377322) (← links)
- Proof systems for structured specifications with observability operators (Q1391730) (← links)
- Swinging types=functions+relations+transition systems (Q1575635) (← links)
- A hidden agenda (Q1575735) (← links)
