(release prob 1.4.0) |
No edit summary |
||
| Line 14: | Line 14: | ||
|width="40%" style="background:#EDF2F2;" | '''News''' | |width="40%" style="background:#EDF2F2;" | '''News''' | ||
'''18/8/2014''' | '''18/8/2014''' | ||
[[Download|ProB 1.4.0]] is available. Highlights: CLP(FD)-based constraint solver enabled by default, kernel can handle more operations symbolically, integration of the TLC model checker, bug fixes and performance improvements. | [[Download|ProB 1.4.0]] is available. Highlights: CLP(FD)-based constraint solver enabled by default, kernel can handle more operations symbolically and auto-detects potentially infinite sets, integration of the TLC model checker, bug fixes and performance improvements. | ||
'''3/6/2014''' | '''3/6/2014''' | ||
| ProB is an animator and model checker for the B-Method (see the B-Method site of Clearsy). It allows fully automatic animation of many B specifications, and can be used to systematically check a specification for range of errors. The constraint-solving capabilities of ProB can also be used for model finding, deadlock checking and test-case generation.
In addition to B, ProB now also supports Event-B, CSP-M, TLA+, and Z. ProB can be installed within Rodin, where it comes with BMotionStudio to easily generate domain specific graphical visualizations. ProB is now being used within Siemens, Alstom, and several other companies for data validation of complicated properties. Commercial support is provided by the spin-off company Formal Mind. Part of the research and development was conducted within the EPSRC funded projects ABCD and iMoc, and within the EU funded project Rodin. Development is continued under the EU funded projects Deploy and Advance as well as the DFG project Gepavas. Automatically generated test coverage reports are available. |
News
18/8/2014 ProB 1.4.0 is available. Highlights: CLP(FD)-based constraint solver enabled by default, kernel can handle more operations symbolically and auto-detects potentially infinite sets, integration of the TLC model checker, bug fixes and performance improvements. 3/6/2014 ProB supports Event-B Theories. 4/3/2013 ProB 1.3.6 is available. Highlights: improved constraint propagation for division, modulo, intervals, model checking progress bar, performance improvements, improved Kodkod backend and use within REPL, and many more. |
The core of ProB is implemented in SICStus Prolog (but can be run without a SICStus Prolog license). The ProB constraint solver is implemented using co-routining and the CLP(FD) finite domain library of SICStus. An alternate constraint solver based on Kodkod (and thus SAT) is also available within ProB, as is an alternate model checking engine (TLC) for low-level B specifications. The ProB Licence can be found here.
ProB covers a large part of B, and we are striving towards full coverage of Atelier B and B4Free constructs. ProB supports B features such as non-deterministic operations, ANY statements, operations with complex arguments, sets, sequences, functions, lambda abstractions, set comprehensions, records, constants and properties, and many more. Not supported are the Atelier B tree operations and there are restrictions on DEFINITIONS. ProB does support multiple machines, refinements, and implementations. ProB can also be used for automated refinement checking and LTL model checking. It also supports almost full CSP-M process descriptions (as of version 1.2.7), to be used on their own or to guide B machines for specification and property validation. The state space of the specifications can be graphically visualized. ProB also supports Z specifications (ProB in this context is sometimes called ProZ) as well as TLA+ specifications. We now also have an online ProB Logic Calculator.