Data Refinement

From MaRDI portal
Publication:4702189

DOI10.1017/CBO9780511663079zbMath0955.68076OpenAlexW4254136620MaRDI QIDQ4702189

Kai Engelhardt, Willem Paul de Roever

Publication date: 24 November 1999

Full work available at URL: https://doi.org/10.1017/cbo9780511663079




Related Items (63)

Layout randomization and nondeterminismComponents as coalgebras: the refinement dimensionEvolution of rule-based programsAllegories and Collagories for Transformation of Graph Structures Considered as CoalgebrasLogical relations and parametricity -- a Reynolds programme for category theory and programming languagesLevels of abstraction and the Turing testVerifying data refinements using a model checkerAn analysis of refinement in an abortive paradigmThe specification logic \(\nu \)ZOn assertion-based encapsulation for object invariants and simulationsProperty transformation under specification changeGeneralising the array split obfuscationOn using data abstractions for model checking refinementsIncompleteness of relational simulations in the blocking paradigmInformation flow in systems with schedulers. II: RefinementObservational purity and encapsulationA Sound and Complete Proof Technique for Linearizability of Concurrent Data StructuresComposition mechanisms for retrenchmentTemporal-logic property preservation under Z refinementModel evolution and refinementA probability perspectiveSimple feature engineering via neat default retrenchmentsOn the Purpose of Event-B Proof ObligationsHybrid I/O automata.Formal communication elimination and sequentialization equivalence proofs for distributed system modelsThe mechanical generation of fault trees for reactive systems via retrenchment. I. Combinational circuitsSecure Microkernels, State Monads and Scalable RefinementRelational Concurrent Refinement: AutomataData Refinement with Probability in MindGuarded Operations, Refinement and SimulationBridging arrays and ADTs in recursive proofsCompleteness of ASM RefinementMore Relational Concurrent Refinement: Traces and Partial RelationsLayout Randomization and NondeterminismVerifying a Network Invariant for All Configurations of the Futurebus+ Cache Coherence ProtocolCompleteness of fair ASM refinementA hierarchy of failures-based models: theory and applicationRetrenchment and refinement interworking: the tower theoremsCollagories: relation-algebraic reasoning for gluing constructionsStronger compositions for retrenchmentsRefactoring Object-Oriented Specifications with Data and ProcessesASM refinement and generalizations of forward simulation in data refinement: a comparisonModel transformations across viewsA Bibliography of Willem-Paul de RoeverIntegrated and Automated Abstract Interpretation, Verification and Testing of C/C++ ModulesModelling Divergence in Relational Concurrent RefinementUnnamed ItemUsing First-Order Theorem Provers in the Jahob Data Structure Verification SystemConcerned with the unprivileged: user programs in kernel refinementIntroducing extra operations in refinementContinuous KAOS, ASM, and formal control system design across the continuous/discrete modeling interface: a simple train stopping applicationRelational concurrent refinement. III: Traces, partial relations and automataPhilosophical Conceptions of InformationVerified Synthesis of Knowledge-Based Programs in Finite Synchronous EnvironmentsRelational concurrent refinement. II: Internal operations and outputsTrace-based derivation of a scalable lock-free stack algorithmCategory Theoretic Models of Data RefinementAgainst digital ontologyAutomated verification of refinement lawsCogent: uniqueness types and certifying compilationSoundness of data refinement for a higher-order imperative languageGeneric Tools via General RefinementState-level and value-level simulations in data refinement




This page was built for publication: Data Refinement