Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Will Klieber

dblp:21/8296 · also William Klieber · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
1since 2021 · last 2026
0009-0009-4468-1243ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 2 first-authorSoftware engineering, systems software and programming languages · 2 · 1 first-author · 1 since 2021Theory of computation · 2 · 1 first-authorSecurity and privacy · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Automated reasoning and model checking · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Automated reasoning and model checking › abstraction refinement
counterexample-guided abstraction refinement
0.212016
Solving QBF with counterexample guided refinement · Artif. Intell. 2016
Automated reasoning and model checking › satisfiability › quantified boolean formula
quantified boolean formula solving
0.212016
Solving QBF with counterexample guided refinement · Artif. Intell. 2016
Automated reasoning and model checking
satisfiability
0.212016
Solving QBF with counterexample guided refinement · Artif. Intell. 2016

Methods — techniques the papers use, named apart from their topics

counterexample-guided refinement · 0.2QBF solving · 0.2
YearPublicationVenuePosition
2026 A Pointer-Ownership Model for C Inspired by Rust
abstract
Memory-safety bugs are a major source of vulnerabilities in C code. Much work has focused on spatial memory safety (e.g., buffer overflows), while temporal memory safety (e.g., use-after-free) has received less attention. One solution for achieving temporal memory safety is to apply an ownership model to an existing program and enforce it. In this paper, we describe the design and implementation of a new temporal memory safety model for C source code. Our design improves on CERT's Pointer Ownership Model with enhancements including use of a SAT solver to enforce constraint satisfaction, LLMs to complete a per-program model, and an improved mechanism to prevent use-after-free errors inspired by Rust's borrow checker and object lifetimes. Our implementation performed well on a large test suite of memory-safe and memory-unsafe code examples. We tested all 4,604 C code examples for the 5 CWEs associated with temporal memory safety (CWEs 401, 415, 416, 590, 761) from the Juliet C/C++ test suite. In our tests, all of the memory-unsafe examples were correctly recognized as unsafe, and 81% of the 2,302 memory-safe examples were correctly recognized as memory-safe.
David Svoboda, Will Klieber, Lori Flynn, Ruben Martins, Jeffrey Hoskinson
LCTES2
2018 Practical Precise Taint-flow Static Analysis for Android App Sets
abstract
Colluding apps, or a combination of a malicious app and leaky app, can use intents (messages sent to Android app components) to exfiltrate sensitive or private information from an Android phone. This paper describes a novel static analysis method "Precise-DF" to detect taint flow in Android app sets (including flows involving multiple apps) that is precise, fast, and uses relatively little disk and memory space. Precise-DF re-uses the fast modular analysis of the DidFail static analysis tool, and adds context and therefore precision with parameterized summaries of potential data flows. We added Boolean formulas to DidFail's flow equations, to record conditions of control flow paths relevant to possible taint flows. The method that we have refined (a modular analysis with parameterized summaries of flow of sensitive information) is generally applicable to the class of problems involving taint flow analysis for software systems that communicate by message passing. This paper also describes how an enterprise architecture could use Precise-DF to analyze and enforce compliance with dataflow policies.
Will Klieber, Lori Flynn, William Snavely, Michael Zheng
ARES1
2016 Solving QBF with counterexample guided refinement
Mikolás Janota, Will Klieber, João Marques-Silva 0001, Edmund M. Clarke
Artif. Intell.2
2013 Solving QBF with Free Variables
Will Klieber, Mikolás Janota, João Marques-Silva 0001, Edmund M. Clarke
CP1
2012 Solving QBF with Counterexample Guided Refinement
Mikolás Janota, Will Klieber, João Marques-Silva 0001, Edmund M. Clarke
SAT2
2010 A Non-prenex, Non-clausal QBF Solver with Game-State Learning
Will Klieber, Samir Sapra, Sicun Gao, Edmund M. Clarke
SAT1