Share This Author
ProB: A Model Checker for B
This work presents the first experiences in using PROB on several case studies, highlighting that PROB enables users to uncover errors that are not easily discovered by existing tools.
ProB: an automated analysis toolset for the B method
ProB is presented, a validation toolset for the B method that contains an automated animation facilities and a model checker and a refinement checker that can be used to detect various errors in B specifications.
Infinite State Model Checking by Abstract Interpretation and Program Specialisation
This work presents a technique for infinite state model checking of safety properties based upon logic program specialisation and analysis techniques and discusses how this approach has to be extended to handle more complicated infinite state systems and to handle arbitrary CTL formulae.
Redundant Argument Filtering of Logic Programs
A safe, effective approximation of the notion of a redundant argument is given and several simple and efficient algorithms based on the approximative notion are described, illustrating the practical benefits of this approach.
Conjunctive Partial Deduction: Foundations, Control, Algorithms, and Experiments
On the Power of Homeomorphic Embedding for Online Termination
- M. Leuschel
- 14 September 1998
It is shown that the homeomorphic embedding relation is strictly more powerful than a large class of involved well-founded approaches.
Validating Z Specifications Using the ProBAnimator and Model Checker
The architecture and implementation of the proz tool is presented, which was integrated into prob, by providing a translation of Z into B and by extending the kernel of prob to accommodate some new syntax and data types.
Combining CSP and B for Specification and Property Verification
This paper presents an extension of ProB that supports checking of specifications written in a combination of CSP and B, and explains how the notations are combined semantically and gives an overview of the implementation of the combination.
Controlling generalization and polyvariance in partial deduction of normal logic programs
This article elaborate global control for partial deduction, using the concept of a characteristic tree, encapsulating specialization behavior rather than syntactic structure, to guide generalization and polyvariance, and shows how this can be done in a correct and elegant way.
Automated property verification for large scale B models with ProB
- M. Leuschel, Jérôme Falampin, F. Fritz, Daniel Plagge
- Computer ScienceFormal Aspects of Computing
- 1 November 2011
This paper shows how ProB was able to use ProB to validate all of the about 300 properties of the San Juan deployment, detecting exactly the same faults automatically in a few minutes that were manually uncovered in about one man-month.