The following pages link to Daniel Kroening (Q438554):
Displaying 46 items.
- An interpolating sequent calculus for quantifier-free Presburger arithmetic (Q438556) (← links)
- Deciding floating-point logic with abstract conflict driven clause learning (Q479837) (← links)
- Decision procedures. An algorithmic point of view (Q518892) (← links)
- Context-aware counter abstraction (Q600978) (← links)
- Lost in abstraction: monotonicity in multi-threaded programs (Q729809) (← links)
- Automatic analysis of DMA races using model checking and \(k\)-induction (Q763238) (← links)
- Verification and falsification of programs with loops using predicate abstraction (Q968302) (← links)
- A framework for satisfiability modulo theories (Q1037239) (← links)
- Incremental bounded model checking for embedded software (Q1682291) (← links)
- Predicate abstraction of ANSI-C programs using SAT (Q1888196) (← links)
- Deep reinforcement learning with temporal logics (Q1996007) (← links)
- Unbounded-time safety verification of guarded LTI models with inputs by abstract acceleration (Q2031413) (← links)
- Model checking boot code from AWS data centers (Q2050104) (← links)
- Abstract interpretation with unfoldings (Q2164221) (← links)
- Loop summarization using state and transition invariants (Q2248058) (← links)
- Ranking function synthesis for bit-vector relations (Q2248069) (← links)
- Formalizing and checking thread refinement for data-race-free execution models (Q2272925) (← links)
- Automated formal synthesis of provably safe digital controllers for continuous plants (Q2303883) (← links)
- Verification of SpecC using predicate abstraction (Q2369884) (← links)
- Counterexample-guided abstraction refinement for symmetric concurrent programs (Q2441711) (← links)
- Verification of Boolean programs with unbounded thread creation (Q2464944) (← links)
- Decision procedures. An algorithmic point of view. With foreword by Randal E. Bryant (Q2473386) (← links)
- Automatic Generation of Propagation Complete SAT Encodings (Q2796076) (← links)
- $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation (Q2817292) (← links)
- On Partial Order Semantics for SAT/SMT-Based Symbolic Encodings of Weak Memory Concurrency (Q2827447) (← links)
- (Q2848683) (← links)
- (Q2849596) (← links)
- Numeric Bounds Analysis with Conflict-Driven Learning (Q2894265) (← links)
- Efficient Coverability Analysis by Proof Minimization (Q2912699) (← links)
- Abstraction of Syntax (Q2926654) (← links)
- An Abstract Interpretation of DPLL(T) (Q2926657) (← links)
- Abstract conflict driven learning (Q2931790) (← links)
- Unbounded-Time Analysis of Guarded LTI Systems with Inputs by Abstract Acceleration (Q2949859) (← links)
- Independence Abstractions and Models of Concurrency (Q2961560) (← links)
- Loop Summarization and Termination Analysis (Q3000639) (← links)
- Mutation-Based Test Case Generation for Simulink Models (Q3066126) (← links)
- Beyond Quantifier-Free Interpolation in Extensions of Presburger Arithmetic (Q3075472) (← links)
- Strengthening Induction-Based Race Checking with Lightweight Static Analysis (Q3075479) (← links)
- Linear Completeness Thresholds for Bounded Model Checking (Q3088266) (← links)
- SAT-Based Model Checking (Q3176368) (← links)
- Lost in Abstraction: Monotonicity in Multi-threaded Programs (Q3190114) (← links)
- Learning the Language of Software Errors (Q5109907) (← links)
- Unfolding-based Partial Order Reduction (Q5357723) (← links)
- Certified reinforcement learning with logic guidance (Q6136089) (← links)
- Enhancing active model learning with equivalence checking using simulation relations (Q6151756) (← links)
- Synthesising programs with non-trivial constants (Q6161231) (← links)
