| Fifty Years of Prolog and Beyond. | 0 | 0.34 | 2022 |
| Trace Refinement in B and Event-B | 0 | 0.34 | 2022 |
| Making ProB Compatible with SWI-Prolog | 0 | 0.34 | 2022 |
| Model Checking B Models via High-Level Code Generation | 0 | 0.34 | 2022 |
| Validation of Formal Models by Timed Probabilistic Simulation. | 0 | 0.34 | 2021 |
| Integrating formal specifications into applications: the ProB Java API | 0 | 0.34 | 2021 |
| Validation Obligations: A Novel Approach to Check Compliance between Requirements and their Formal Specification | 0 | 0.34 | 2021 |
| Spot the Difference - A Detailed Comparison Between B and Event-B. | 0 | 0.34 | 2021 |
| Improving SMT Solver Integrations for the Validation of B and Event-B Models. | 0 | 0.34 | 2021 |
| Analysing ProB's Constraint Solving Backends - What Do They Know? Do They Know Things? Let's Find Out! | 0 | 0.34 | 2020 |
| Validation and real-life demonstration of ETCS hybrid level 3 principles using a formal B model | 2 | 0.38 | 2020 |
| Fast and Effective Well-Definedness Checking. | 0 | 0.34 | 2020 |
| ProB and Jupyter for Logic, Set Theory, Theoretical Computer Science and Formal Methods. | 0 | 0.34 | 2020 |
| Towards a Shared Specification Repository. | 0 | 0.34 | 2020 |
| The First Twenty-Five Years of Industrial Use of the B-Method. | 0 | 0.34 | 2020 |
| Translating alloy and extensions to classical B | 0 | 0.34 | 2020 |
| Solving Set Constraints in B and Event-B: Foundations and Applications (invited talk). | 0 | 0.34 | 2018 |
| State-Of-The-Art Model Checking For B And Event-B Using Prob And Ltsmin | 0 | 0.34 | 2018 |
| Using a Formal B Model at Runtime in a Demonstration of the ETCS Hybrid Level 3 Concept with Real Trains. | 0 | 0.34 | 2018 |
| Repair And Generation Of Formal Models Using Synthesis | 1 | 0.40 | 2018 |
| Inferring physical units in formal models | 0 | 0.34 | 2017 |
| Formal Model-Based Constraint Solving and Document Generation. | 0 | 0.34 | 2016 |
| A Compact Encoding of Sequential ASMs in Event-B. | 4 | 0.48 | 2016 |
| Proof Assisted Symbolic Model Checking for B and Event-B. | 4 | 0.38 | 2016 |
| Optimising the ProB model checker for B using partial order reduction. | 1 | 0.35 | 2016 |
| Knowledge Representation Analysis of Graph Mining. | 1 | 0.35 | 2016 |
| Model-Based Robustness Testing in Event-B Using Mutation | 4 | 0.38 | 2015 |
| Towards B as a High-Level Constraint Modelling Language - Solving the Jobs Puzzle Challenge. | 5 | 0.44 | 2014 |
| Validation of the ABZ Landing Gear System Using ProB | 15 | 0.62 | 2014 |
| Towards Constraint-Solving over Higher-Order Unbounded Datatypes using Formal Methods Tools. | 0 | 0.34 | 2014 |
| Fast offline partial evaluation of logic programs. | 4 | 0.41 | 2014 |
| Validation of formal models by refinement animation | 6 | 0.55 | 2013 |
| Validating B, Z and TLA + Using ProB and Kodkod. | 12 | 0.54 | 2012 |
| Translating TLA+ to b for validation with ProB | 12 | 0.57 | 2012 |
| Runtime feedback in a meta-tracing JIT for efficient dynamic languages | 18 | 1.01 | 2011 |
| Automatic flow analysis for event-B | 7 | 0.47 | 2011 |
| Efficient approximate verification of B and Z models via symmetry markers | 2 | 0.41 | 2010 |
| Refinement-animation for event-b: towards a method of validation | 5 | 0.52 | 2010 |
| Avocs2010 Preface. | 0 | 0.34 | 2010 |
| A refinement-based correctness proof of symmetry reduced model checking | 7 | 0.48 | 2010 |
| An approach of requirements tracing in formal refinement | 12 | 0.87 | 2010 |
| A Semantics-Aware Editing Environment for Prolog in Eclipse | 2 | 0.44 | 2009 |
| Fast and accurate strong termination analysis with an application to partial evaluation | 1 | 0.37 | 2009 |
| Visualising Event-B Models with B-Motion Studio | 17 | 1.01 | 2009 |
| Validating and animating higher-order recursive functions in b | 2 | 0.47 | 2009 |
| Probing the Depths of CSP-M: A New fdr-Compliant Validation Tool | 24 | 1.04 | 2008 |
| Towards Demonstrably Correct Compilation of Java Byte Code | 1 | 0.36 | 2008 |
| ProB: an automated analysis toolset for the B method | 155 | 5.31 | 2008 |
| Efficient and flexible access control via Jones-optimal logic program specialisation | 7 | 0.46 | 2008 |
| Declarative programming for verification: lessons and outlook | 2 | 0.36 | 2008 |
