ProB: A model checker for B

M Leuschel, M Butler - … 2003: Formal Methods: International Symposium of …, 2003 - Springer
We present PROB, an animation and model checking tool for the B method. PROB's
animation facilities allow users to gain confidence in their specifications, and unlike the …

[BOOK][B] Introduction to process algebra

W Fokkink - 2013 - books.google.com
Automated and semi-automated manipulation of so-called labelled transition systems has
become an important means in discovering flaws in software and hardware systems …

ProB: an automated analysis toolset for the B method

M Leuschel, M Butler - International Journal on Software Tools for …, 2008 - Springer
We present P ro B, a validation toolset for the B method. P ro B's automated animation
facilities allow users to gain confidence in their specifications. P ro B also contains a model …

Synthesizing software verifiers from proof rules

S Grebenshchikov, NP Lopes, C Popeea… - ACM SIGPLAN …, 2012 - dl.acm.org
Automatically generated tools can significantly improve programmer productivity. For
example, parsers and dataflow analyzers can be automatically generated from declarative …

On fast large-scale program analysis in datalog

B Scholz, H Jordan, P Subotić… - Proceedings of the 25th …, 2016 - dl.acm.org
Designing and crafting a static program analysis is challenging due to the complexity of the
task at hand. Among the challenges are modelling the semantics of the input language …

XSB: Extending Prolog with tabled logic programming

T Swift, DS Warren - Theory and Practice of Logic Programming, 2012 - cambridge.org
The paradigm of Tabled Logic Programming (TLP) is now supported by a number of Prolog
systems, including XSB, YAP Prolog, B-Prolog, Mercury, ALS, and Ciao. The reasons for this …

Efficient on-the-fly model-checking for regular alternation-free mu-calculus

R Mateescu, M Sighireanu - Science of Computer Programming, 2003 - Elsevier
Model-checking is a successful technique for automatically verifying concurrent finite-state
systems. When designing a model-checker, a good compromise must be made between the …

Model checking in CLP

G Delzanno, A Podelski - … Conference on Tools and Algorithms for the …, 1999 - Springer
Abstract We show that Constraint Logic Programming (CLP) can serve as a conceptual
basis and as a practical implementation platform for the model checking of infinite-state …

Using selective memoization to defeat regular expression denial of service (ReDoS)

JC Davis, F Servant, D Lee - 2021 IEEE symposium on security …, 2021 - ieeexplore.ieee.org
Regular expressions (regexes) are a denial of service vector in most mainstream
programming languages. Recent empirical work has demonstrated that up to 10% of …

Tabling for non‐monotonic programming

T Swift - Annals of Mathematics and Artificial Intelligence, 1999 - Springer
Non‐monotonic extensions add power to logic programs. However, the main logic
programming language, Prolog, is widely recognized as inadequate to implement these …