The following pages link to (Q3569584):
Displaying 50 items.
- Verification of \(\mathrm{EB}^3\) specifications using CADP (Q282110) (← links)
- Concurrent abstract state machines (Q303691) (← links)
- Foundations for using linear temporal logic in Event-B refinement (Q333316) (← links)
- Experiments in program verification using Event-B (Q432154) (← links)
- Ambient abstract state machines with applications (Q439957) (← links)
- Refining autonomous agents with declarative beliefs and desires (Q520236) (← links)
- Changing system interfaces consistently: a new refinement strategy for CSP\(\|\)B (Q549684) (← links)
- Efficient approximate verification of B and Z models via symmetry markers (Q622591) (← links)
- Simple feature engineering via neat default retrenchments (Q649587) (← links)
- Generating counterexamples for quantitative safety specifications in probabilistic B (Q652160) (← links)
- Automating Event-B invariant proofs by rippling and proof patching (Q667526) (← links)
- Optimising the ProB model checker for B using partial order reduction (Q736463) (← links)
- Refinement patterns for ASTDs (Q736838) (← links)
- The behavioural semantics of Event-B refinement (Q736910) (← links)
- Derivation of concurrent programs by stepwise scheduling of Event-B models (Q736912) (← links)
- Introducing extra operations in refinement (Q736913) (← links)
- Continuous KAOS, ASM, and formal control system design across the continuous/discrete modeling interface: a simple train stopping application (Q736916) (← links)
- Relational concurrent refinement. III: Traces, partial relations and automata (Q736917) (← links)
- Sound verification procedures for temporal properties of infinite-state systems (Q832273) (← links)
- Balancing expressiveness in formal approaches to concurrency (Q890478) (← links)
- Integrating stochastic reasoning into Event-B development (Q903513) (← links)
- Developing topology discovery in Event-B (Q1044181) (← links)
- Modelling the embedded control system using iUML-B pattern state machine (Q1629456) (← links)
- Event algebra for transition systems composition application to timed automata (Q1656550) (← links)
- Relating trace refinement and linearizability (Q1688548) (← links)
- A verification and deployment approach for elastic component-based applications (Q1688553) (← links)
- Simulation relations for fault-tolerance (Q1688554) (← links)
- Stepwise refinement of heap-manipulating code in Chalice (Q1941869) (← links)
- External and internal choice with event groups in Event-B (Q1941871) (← links)
- Security invariants in discrete transition systems (Q1941889) (← links)
- IPL: an integration property language for multi-model cyber-physical systems (Q2024345) (← links)
- Modelling resilient collaborative multi-agent systems (Q2030154) (← links)
- Towards leveraging domain knowledge in state-based formal methods (Q2115898) (← links)
- Moded and continuous abstract state machines (Q2115900) (← links)
- Spot the difference: a detailed comparison between B and Event-B (Q2117587) (← links)
- Flashix: modular verification of a concurrent and crash-safe flash file system (Q2117600) (← links)
- Event-B refinement for continuous behaviours approximation (Q2147212) (← links)
- Integrating formal specifications into applications: the ProB Java API (Q2147695) (← links)
- Traits: correctness-by-construction for free (Q2165220) (← links)
- Verifying autonomous systems (Q2165494) (← links)
- Empowering the Event-B method using external theories (Q2165497) (← links)
- Reachability analysis and simulation for hybridised Event-B models (Q2165506) (← links)
- Operation caching and state compression for model checking of high-level models. How to have your cake and eat it (Q2165507) (← links)
- Formal models for consent-based privacy (Q2168784) (← links)
- Specification of systems with parameterised events: An institution-independent approach (Q2168786) (← links)
- Test generation from event system abstractions to cover their states and transitions (Q2216864) (← links)
- Bridging arrays and ADTs in recursive proofs (Q2233489) (← links)
- Knowledge representation analysis of graph mining (Q2317967) (← links)
- Semantics of Mizar as an Isabelle object logic (Q2323445) (← links)
- On labeled birooted tree languages: algebras, automata and logic (Q2347808) (← links)
