7 citations · 9 across the 2 of their papers we have counts for
2 papers
cs.PL2017★ 2 cited
Constraint Logic Programming over Infinite Domains with an Application to Proof
Sebastian Krings, Michael Leuschel
We present a CLP(FD)-based constraint solver able to deal with unbounded domains. It is based on constraint propagation, resorting to enumeration if all other methods fail. An impo…
cs.SE2014★ 7 cited
Who watches the watchers: Validating the ProB Validation Tool
Jens Bendisposto, Sebastian Krings, Michael Leuschel
Over the years, ProB has moved from a tool that complemented proving, to a development environment that is now sometimes used instead of proving for applications, such as exhaustiv…