ProB
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Model checking action system refinements
- CLPS-B
- BTestBox
- EventB2Java
- TopSpin
- GeneSyst
- CoreASM
- TinyOS
- LOGEN
- LOTOS
- A set solver for finite set relation algebra
- Tracking CSP computations
- A verification and deployment approach for elastic component-based applications
- CZT
- Cardinal
- Rodin
- B4Free
- Atelier B
- Z2sal
- Kodkod
- MUNCH
- Stepwise refinement of heap-manipulating code in Chalice
- Security invariants in discrete transition systems
- Validation of formal models by refinement animation
- Spin-to-Grape
- SymmSpin
- PROMELA
- jSpin
- csp2B
- Formal verification of cP systems using PAT3 and ProB
- A refinement-based development of a distributed signalling system
- Removing algebraic data types from constrained Horn clauses using difference predicates
- Pardinus: a temporal relational model finder
- Towards leveraging domain knowledge in state-based formal methods
- Spot the difference: a detailed comparison between B and Event-B
- Sound reasoning in \textit{tock}-CSP
- Integrating formal specifications into applications: the ProB Java API
- TLC
- Formal verification of cP systems using Coq
- DPPD
- Z/EVES
- Z
- BWare
- tptp2X
- Model checking approach to automated planning
- Solving quantifier-free first-order constraints over finite sets and binary relations
- Knowledge representation analysis of graph mining
- FDR2
- Proof-based verification approaches for dynamic properties: application to the information system domain
- A decision procedure for restricted intensional sets
- Consistency-preserving refactoring of refinement structures in Event-B models
- FDR3
- CSP theorems for communicating B machines
- SICStus
- PAT
- ERA-PAT
- Automated reasoning with restricted intensional sets
- Verification of \(\mathrm{EB}^3\) specifications using CADP
- Ours Is to Reason Why
- Model checking under fairness in ProB and its application to fair exchange protocols
- Directed Model Checking for B: An Evaluation and New Techniques
- Specification of a localization component driven by a goal-based approach: some lessons we learned
- Graph generation to statically represent CSP processes
- Jaza
- EFSMT
- kPWorkbench
- Foundations for using linear temporal logic in Event-B refinement
- ZRC
- Checking the Conformance of a Promela Design to its Formal Specification in Event-B
- mural
- Fast and accurate strong termination analysis with an application to partial evaluation
- Lifting General Correctness into Partial Correctness is ok
- The MEB and CEB Static Analysis for CSP Specifications
- Incremental System Modelling in Event-B
- Coccinelle
- JSetL
- Static slicing of explicitly synchronized languages
- FaCiLe
- Experiments in program verification using Event-B
- On the analysis of compensation correctness
- Model checking RAISE applicative specifications
- scientific article; zbMATH DE number 2086961 (Why is no real title available?)
- Incomplete SMT techniques for solving non-linear formulas over the integers
- The techniques of formalization of OS Astra Linux Special Edition access control model using Event-B formal method for verification using Rodin and ProB
- scientific article; zbMATH DE number 7453192 (Why is no real title available?)
- scientific article; zbMATH DE number 7178367 (Why is no real title available?)
- Trust Management
- Linking event-B and concurrent object-oriented programs
- Automatic Generation of CSP || B Skeletons from xUML Models
- ZB 2005: Formal Specification and Development in Z and B
- Program Development in Computational Logic
- FM 2005: Formal Methods
- JeB
- BMotionWeb
- VisB
- WebASM
- Efficient approximate verification of B and Z models via symmetry markers
- Generating counterexamples for quantitative safety specifications in probabilistic B
- Optimising the ProB model checker for B using partial order reduction
- An Event-B based approach for cloud composite services verification
This page was built for software: ProB
