The following pages link to Nikolaj Bjørner (Q483050):
Displayed 46 items.
- Symbolic tree automata (Q483051) (← links)
- Solving \(\mathrm{LIA}^\star\) using approximations (Q784151) (← links)
- Content-dependent chunking for differential compression, the local maximum approach (Q972380) (← links)
- Deciding effectively propositional logic using DPLL and substitution sets (Q972432) (← links)
- Automatic generation of invariants and intermediate assertions (Q1391929) (← links)
- (Q1589581) (redirect page) (← links)
- Deductive verification of real-time systems using STeP (Q1589585) (← links)
- (Q1656603) (redirect page) (← links)
- Constrained image generation using binarized neural networks with decision procedures (Q1656604) (← links)
- (Q1702929) (redirect page) (← links)
- Property-directed inference of universal invariants or proving their absence (Q1702932) (← links)
- Supercharging plant configurations using Z3 (Q2117195) (← links)
- Guiding high-performance SAT solvers with unsat-core predictions (Q2181943) (← links)
- (Q2723889) (← links)
- Scaling network verification using symmetry and surgery (Q2828246) (← links)
- Generalized Property Directed Reachability (Q2843329) (← links)
- Model-based Theory Combination (Q2864402) (← links)
- Symbolic Automata: The Toolkit (Q2894292) (← links)
- From Primal Infon Logic with Individual Variables to Datalog (Q2900510) (← links)
- Taking Satisfiability to the Next Level with Z3 (Q2908472) (← links)
- Canonical Regular Types (Q2909144) (← links)
- Symbolic finite state transducers (Q2942866) (← links)
- Horn Clause Solvers for Program Verification (Q2947164) (← links)
- Property-Directed Inference of Universal Invariants or Proving Their Absence (Q3177887) (← links)
- Equivalence of Finite-Valued Symbolic Finite Transducers (Q3179179) (← links)
- Computing All Implied Equalities via SMT-Based Partition Refinement (Q3192188) (← links)
- Input-Output Model Programs (Q3393419) (← links)
- Symbolic Bounded Conformance Checking of Model Programs (Q3402292) (← links)
- Symbolic Tree Transducers (Q3457988) (← links)
- Models and Software Model Checking of a Distributed File Replication System (Q3526923) (← links)
- Deciding Effectively Propositional Logic Using DPLL and Substitution Sets (Q3541720) (← links)
- Engineering DPLL(T) + Saturation (Q3541724) (← links)
- DKAL and Z3: A Logic Embedding Experiment (Q3586018) (← links)
- Efficient E-Matching for SMT Solvers (Q3608773) (← links)
- Path Feasibility Analysis for String-Manipulating Programs (Q3617764) (← links)
- Linear Functional Fixed-points (Q3636857) (← links)
- Satisfiability Modulo Theories: An Appetizer (Q3651277) (← links)
- Monadic Decomposition (Q4640286) (← links)
- (Q4904149) (← links)
- Symbolic Automata Constraint Solving (Q4933337) (← links)
- (Q4952308) (← links)
- Property Directed Polyhedral Abstraction (Q5172647) (← links)
- A practical integration of first-order reasoning and decision procedures (Q5234694) (← links)
- Linear Quantifier Elimination as an Abstract Decision Procedure (Q5747770) (← links)
- Bugs, Moles and Skeletons: Symbolic Reasoning for Software Development (Q5747779) (← links)
- Algebra-Based Reasoning for Loop Synthesis (Q6177467) (← links)