Rodin

swMATH7083MaRDI QIDQ19141FDOQ19141

Author name not available (Why is that?)

Cited In (90)

• An Event-B based approach for cloud composite services verification
• Verification by construction of distributed algorithms
• A formal verification technique for behavioural model-to-model transformations
• Sound verification procedures for temporal properties of infinite-state systems
• Event-B refinement for continuous behaviours approximation
• The refinement calculus of reactive systems
• Set-Theoretic Models of Computations
• On the purpose of Event-B proof obligations
• Retrenchment for Event-B: UseCase-wise development and Rodin integration
• Towards leveraging domain knowledge in state-based formal methods
• Flashix: modular verification of a concurrent and crash-safe flash file system
• Spot the difference: a detailed comparison between B and Event-B
• Title not available (Why is that?)
• Specification and verification of concurrent programs through refinements
• A verification and deployment approach for elastic component-based applications
• Changing system interfaces consistently: a new refinement strategy for CSP\(\|\)B
• Verification of \(\mathrm{EB}^3\) specifications using CADP
• Monitorability for the Hennessy-Milner logic with recursion
• Modelling the embedded control system using iUML-B pattern state machine
• Elucidating concurrent algorithms via layers of abstraction and reification
• Experiments in program verification using Event-B
• A concurrent constraint programming interpretation of access permissions
• Practical Theory Extension in Event-B
• Modelling resilient collaborative multi-agent systems
• Formal verification of cP systems using Coq
• Provably correct derivation of algorithms using FermaT
• Optimising the ProB model checker for B using partial order reduction
• Continuous KAOS, ASM, and formal control system design across the continuous/discrete modeling interface: a simple train stopping application
• Derivation of concurrent programs by stepwise scheduling of Event-B models
• Kaisa Sere: in memoriam
• Rule-based transformation of graph rewriting rules: towards higher-order graph grammars
• Event algebra for transition systems composition application to timed automata
• Security invariants in discrete transition systems
• Domain science and engineering from computer science to the sciences of informatics. II: Science
• A New Roadmap for Linking Theories of Programming
• Efficient approximate verification of B and Z models via symmetry markers
• Foundations for using linear temporal logic in Event-B refinement
• Stepwise refinement of heap-manipulating code in Chalice
• The behavioural semantics of Event-B refinement
• Proof-based verification approaches for dynamic properties: application to the information system domain
• Abstractions of non-interference security: probabilistic versus possibilistic
• External and internal choice with event groups in Event-B
• A Behavioural Theory of Recursive Algorithms
• Developing topology discovery in Event-B
• A refinement-based development of a distributed signalling system
• Hybrid dynamic logic institutions for event/data-based systems
• Simulation relations for fault-tolerance
• Moded and continuous abstract state machines
• On labeled birooted tree languages: algebras, automata and logic
• Fundamentals of software engineering. 6th international conference, FSEN 2015, Tehran, Iran, April 22--24, 2015. Revised selected papers
• Generating counterexamples for quantitative safety specifications in probabilistic B
• Semantics of Mizar as an Isabelle object logic
• Integration of SMT-solvers in B and Event-B development environments
• Changing System Interfaces Consistently: A New Refinement Strategy for CSP||B
• Automating Event-B invariant proofs by rippling and proof patching
• Manifest domains: analysis and description
• Refining autonomous agents with declarative beliefs and desires
• Relating trace refinement and linearizability
• Domain science and engineering from computer science to the sciences of informatics. I: Engineering
• Incremental System Modelling in Event-B
• Translating controlled graph grammars to ordinary graph grammars
• Knowledge representation analysis of graph mining
• Presentation and manipulation of Mizar properties in an Isabelle object logic
• Relational Differential Dynamic Logic
• Linking Event-B and Concurrent Object-Oriented Programs
• Checking the Conformance of a Promela Design to its Formal Specification in Event-B
• Proof-Based Approach to Hybrid Systems Development: Dynamic Logic and Event-B
• Refinement of Structured Interactive Systems
• Title not available (Why is that?)
• Putting logic-based distributed systems on stable grounds
• Theorem proving graph grammars with attributes and negative application conditions
• rCOS: Defining Meanings of Component-Based Software Architectures
• The techniques of formalization of OS Astra Linux Special Edition access control model using Event-B formal method for verification using Rodin and ProB
• Systematic Refinement of Abstract State Machines with Higher-Order Logic
• Combining refinement and signal-temporal logic for biological systems
• Integrating formal specifications into applications: the ProB Java API
• Title not available (Why is that?)
• Traits: correctness-by-construction for free
• Verifiable Code Generation from Scheduled Event-B Models
• Behavioural Models for FMI Co-simulations
• Proving Quicksort Correct in Event-B
• Specification of a Localization Component Driven by a Goal-Based Approach: Some Lessons We Learned
• Pliant Modalities in Hybrid Event-B
• A formal framework for Hybrid Event B
• Building Specifications in the Event-B Institution
• Consistency-preserving refactoring of refinement structures in Event-B models
• Refinement of Timing Constraints for Concurrent Tasks with Scheduling
• Title not available (Why is that?)
• The Subject-Oriented Approach to Software Design and the Abstract State Machines Method
• Developing Topology Discovery in Event-B

This page was built for software: Rodin