Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Stefan Ciobaca"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 303, Iss Proc. FROM 2019, Pp 3-15 (2019)
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 which can be checked independently in the form of a satisfying truth as
Externí odkaz:
https://doaj.org/article/1c7608ab7f094101a0444ce6c7dc87df
Publikováno v:
Mathematics, Vol 10, Iss 13, p 2264 (2022)
We present a DPLL SAT solver, which we call TrueSAT, developed in the verification-enabled programming language Dafny. We have fully verified the functional correctness of our solver by constructing machine-checked proofs of its soundness, completene
Externí odkaz:
https://doaj.org/article/6923e3f10b7b46c6b259db9a8776be6e
Autor:
Andrei Stefanescu, Stefan Ciobaca, Radu Mereuta, Brandon Moore, Traian Florin Serbanuta, Grigore Rosu
Publikováno v:
Logical Methods in Computer Science, Vol Volume 15, Issue 2 (2019)
This paper presents a language-independent proof system for reachability properties of programs written in non-deterministic (e.g., concurrent) languages, referred to as all-path reachability logic. It derives partial-correctness properties with all-
Externí odkaz:
https://doaj.org/article/96a8baa5bbcb494daa698a3cb86a7923
Publikováno v:
SYNASC
We describe work that is part of a research project on static code analysis between the Alexandru Ioan Cuza University and Bitdefender. The goal of the project is to develop customized static analysis tools for detecting potential vulnerabilities in
Autor:
Stefan Ciobaca
Publikováno v:
SYNASC
Two programs P and Q are partially equivalent if, when both terminate on the same input, they end up with equivalent outputs. Establishing partial equivalence is useful in, e.g., Compiler verification, when P is the source program and Q is the target
Publikováno v:
LICS
This paper introduces *(one-path) reach ability logic*, a language-independent proof system for program verification, which takes an operational semantics as axioms and derives *reach ability rules*, which generalize Hoare triples. This system improv
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 289, Iss Proc. WPTE 2018, Pp 1-16 (2019)
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 expression whose value decreases with each program step in a well-founded ord
Externí odkaz:
https://doaj.org/article/73ff740ab2f94987b93d75e7897c5b1c