5 citations · 17 across the 11 of their papers we have counts for
3 papers · 1 filter
Verifying the DPLL Algorithm in Dafny
Cezar-Constantin Andrici, Ştefan Ciobâcă
Modern high-performance SAT solvers quickly solve large satisfiability instances that occur in practice. If the instance is satisfiable, then the SAT solver can provide a witness w…
Trace-Relating Compiler Correctness and Secure Compilation
Carmine Abate, Roberto Blanco, Stefan Ciobaca +6
Compiler correctness is, in its simplest form, defined as the inclusion of the set of traces of the compiled program into the set of traces of the original program, which is equiva…
Reducing Total Correctness to Partial Correctness by a Transformation of the Language Semantics
Andrei-Sebastian Buruiană, Ştefan Ciobâcă
We give a language-parametric solution to the problem of total correctness, by automatically reducing it to the problem of partial correctness, under the assumption that an express…