173 citations · 655 across the 66 of their papers we have counts for
4 papers · 2 filters
Using Program Synthesis for Program Analysis
Cristina David, Daniel Kroening, Matt Lewis
In this paper, we identify a fragment of second-order logic with restricted quantification that is expressive enough to capture numerous static analysis problems (e.g. safety provi…
Unfolding-based Partial Order Reduction
César Rodríguez, Marcelo Sousa, Subodh Sharma +1
Partial order reduction (POR) and net unfoldings are two alternative methods to tackle state-space explosion caused by concurrency. In this paper, we propose the combination of bot…
Safety Verification and Refutation by k-invariants and k-induction (extended version)
Martin Brain, Saurabh Joshi, Daniel Kroening +1
Most software verification tools can be classified into one of a number of established families, each of which has their own focus and strengths. For example, concrete counterexamp…
On partial order semantics for SAT/SMT-based symbolic encodings of weak memory concurrency
Alex Horn, Daniel Kroening
Concurrent systems are notoriously difficult to analyze, and technological advances such as weak memory architectures greatly compound this problem. This has renewed interest in pa…