scientific article; zbMATH DE number 3943003
From MaRDI portal
Publication:3713577
Recommendations
Cited in
(63)- A queue based mutual exclusion algorithm
- Normal form approach to compiler design
- The lattice of data refinement
- Data refinement of mixed specifications: A generalization of UNITY
- On the use of data refinement in the development of secure communications systems
- Decidability and complexity for quiescent consistency and its variations
- Objects and classes in Algol-like languages
- On hierarchically developing reactive systems
- Verification of compliance for multilevel models in individual trace semantics
- Bridging arrays and ADTs in recursive proofs
- Universal extensions to simulate specifications
- Splitting forward simulations to cope with liveness
- Refinement verification of the lazy caching algorithm
- scientific article; zbMATH DE number 1612491 (Why is no real title available?)
- scientific article; zbMATH DE number 1670751 (Why is no real title available?)
- Set-theoretic models of computations
- A sound and complete proof technique for linearizability of concurrent data structures
- Relational concurrent refinement: automata
- Of wlp and CSP
- Data refinement with probability in mind
- Guarded operations, refinement and simulation
- A Practical Single Refinement Method for B
- scientific article; zbMATH DE number 139814 (Why is no real title available?)
- scientific article; zbMATH DE number 1303985 (Why is no real title available?)
- scientific article; zbMATH DE number 1104392 (Why is no real title available?)
- scientific article; zbMATH DE number 2013580 (Why is no real title available?)
- scientific article; zbMATH DE number 2013581 (Why is no real title available?)
- A single complete refinement rule for Z
- scientific article; zbMATH DE number 1759495 (Why is no real title available?)
- Starvation-free mutual exclusion with semaphores
- Data Refinement
- scientific article; zbMATH DE number 827943 (Why is no real title available?)
- Simulation Refinement for Concurrency Verification
- More relational concurrent refinement: traces and partial relations
- Simulation refinement for concurrency verification
- Correct Hardware Design and Verification Methods
- Programming Languages and Systems
- ASM refinement and generalizations of forward simulation in data refinement: a comparison
- ZB 2005: Formal Specification and Development in Z and B
- Prespecification in data refinement
- Understanding, Explaining, and Deriving Refinement
- Sound and relaxed behavioural inheritance
- An algebraic formulation for data refinement
- Encoding, decoding and data refinement
- Blaming the client: on data refinement in the presence of pointers
- Incompleteness of relational simulations in the blocking paradigm
- The representational entity in physical computing
- Jifeng He at Oxford and beyond: an appreciation
- A pragmatic approach to stateful partial order reduction
- Abstraction for concurrent objects
- A single complete rule for data refinement
- Probabilistic predicate transformers. II: Partially observable probability
- An operational semantics for object-oriented concepts based on the class hierarchy
- On integrating confidentiality and functionality in a formal method
- Introducing extra operations in refinement
- Relational concurrent refinement. III: Traces, partial relations and automata
- The existence of refinement mappings
- Relational separation logic
- Observational purity and encapsulation
- A criterion for atomicity revisited
- Proving opacity of transactional memory with early release
- Process simulation and refinement
- Data refinement by calculation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3713577)
