scientific article
From MaRDI portal
Publication:2724177
zbMath0982.68086MaRDI QIDQ2724177
Publication date: 10 July 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Theory of programming languages (68N15) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (39)
Components as coalgebras: the refinement dimension ⋮ Diversity and adjudication ⋮ Verifying data refinements using a model checker ⋮ An analysis of refinement in an abortive paradigm ⋮ Property transformation under specification change ⋮ Model Checking Simulation Rules for Linearizability ⋮ Incompleteness of relational simulations in the blocking paradigm ⋮ A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures ⋮ Composition mechanisms for retrenchment ⋮ Temporal-logic property preservation under Z refinement ⋮ Model evolution and refinement ⋮ Data refinement and singleton failures refinement are not equivalent ⋮ Relational Concurrent Refinement: Automata ⋮ Of wlp and CSP ⋮ Completeness of ASM Refinement ⋮ More Relational Concurrent Refinement: Traces and Partial Relations ⋮ General Refinement, Part One: Interfaces, Determinism and Special Refinement ⋮ Alloy as a Refactoring Checker? ⋮ Modeling and visualizing object-oriented programs with Codecharts ⋮ Refining autonomous agents with declarative beliefs and desires ⋮ Preservation of probabilistic information flow under refinement ⋮ Completeness of fair ASM refinement ⋮ Changing system interfaces consistently: a new refinement strategy for CSP\(\|\)B ⋮ Stronger compositions for retrenchments ⋮ ASM refinement and generalizations of forward simulation in data refinement: a comparison ⋮ Model transformations across views ⋮ Changing System Interfaces Consistently: A New Refinement Strategy for CSP||B ⋮ Analysing neurobiological models using communicating automata ⋮ The behavioural semantics of Event-B refinement ⋮ Introducing extra operations in refinement ⋮ Continuous KAOS, ASM, and formal control system design across the continuous/discrete modeling interface: a simple train stopping application ⋮ Relational concurrent refinement. III: Traces, partial relations and automata ⋮ Model checking action system refinements ⋮ Relational concurrent refinement. II: Internal operations and outputs ⋮ Refinement for user interface designs ⋮ Sound and Relaxed Behavioural Inheritance ⋮ Generic Tools via General Refinement ⋮ Moded and continuous abstract state machines ⋮ Flashix: modular verification of a concurrent and crash-safe flash file system
This page was built for publication:
