Armin Biere

Armin Biere's AcademicInfluence.com Rankings

Armin Biere

Computer Science

#4969

World Rank

#5248

Historical Rank

Automated Reasoning

#11

World Rank

#11

Historical Rank

Database

#2139

World Rank

#2250

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Armin Biere Influential?

(Suggest an Edit or Addition)

(See a Problem?)

Armin Biere's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Symbolic Model Checking without BDDs (1999) (2516)
Bounded model checking (2021) (1119)
Symbolic model checking using SAT procedures instead of BDDs (1999) (802)
Bounded Model Checking Using Satisfiability Solving (2001) (793)
Effective Preprocessing in SAT Through Variable and Clause Elimination (2005) (701)
Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications (2009) (531)
Handbook of satisfiability (2009) (485)
PicoSAT Essentials (2008) (428)
Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays (2009) (403)
A survey of recent advances in SAT-based formal verification (2005) (305)
Resolve and Expand (2004) (294)
Linear Encodings of Bounded LTL Model Checking (2006) (244)
High‐level data races (2003) (213)
Inprocessing Rules (2012) (203)
Lingeling, Plingeling and Treengeling Entering the SAT Competition 2013 (2013) (201)
Liveness Checking as Safety Checking (2002) (174)
Theory and Applications of Satisfiability Testing - SAT 2006, 9th International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings (2006) (159)
Lingeling, Plingeling, PicoSAT and PrecoSAT at SAT Race 2010 (2010) (152)
DepQBF: A Dependency-Aware QBF Solver (2010) (148)
Cube and Conquer: Guiding CDCL SAT Solvers by Lookaheads (2011) (146)
Verifiying Safety Properties of a Power PC Microprocessor Using Symbolic Model Checking without BDDs (1999) (139)
Blocked Clause Elimination (2010) (137)
Blocked Clause Elimination for QBF (2011) (123)
Lemmas on demand for the extensional theory of arrays (2008) (123)
Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model Checking (2000) (119)
CADICAL, KISSAT, PARACOOBA, PLINGELING and TREENGELING Entering the SAT Competition 2020 (2020) (118)
Minimizing Learned Clauses (2009) (118)
Adaptive Restart Strategies for Conflict Driven SAT Solvers (2008) (112)
Boolector 2.0 (2015) (102)
Applying static analysis to large-scale, multi-threaded Java programs (2001) (101)
Fuzzing and delta-debugging SMT solvers (2009) (98)
A Performance Study of BDD-Based Model Checking (1998) (98)
On the Complexity of (2012) (95)
Automated Testing and Debugging of SAT and QBF Solvers (2010) (93)
Simple Bounded LTL Model Checking (2004) (90)
Yet another Local Search Solver and Lingeling and Friends Entering the SAT Competition 2014 (2014) (86)
Compressing BMC Encodings with QBF (2007) (85)
Clause Elimination Procedures for CNF Formulas (2010) (80)
Efficient reduction of finite state model checking to reachability analysis (2004) (79)
Extended Resolution Proofs for Conjoining BDDs (2006) (79)
Evaluating CDCL Variable Scoring Schemes (2015) (79)
Automated Reencoding of Boolean Formulas (2012) (77)
Boolector 2 . 0 system description (2015) (75)
Combining Symbolic Model Checking with Uninterpreted Functions for Out-of-Order Processor Verification (1998) (68)
Clause Elimination for SAT and QSAT (2015) (65)
Efficient CNF Simplification Based on Binary Implication Graphs (2011) (65)
A satisfiability procedure for quantified Boolean formulae (2003) (60)
Shortest Counterexamples for Symbolic Model Checking of LTL with Past (2005) (59)
Combined Static and Dynamic Analysis (2005) (59)
Simulating Circuit-Level Simplifications on CNF (2012) (58)
Integrating Dependency Schemes in Search-Based QBF Solvers (2010) (57)
CADICAL at the SAT Race 2019 (2019) (56)
Resolution-Based Certificate Extraction for QBF - (Tool Presentation) (2012) (56)
A First Step Towards a Unified Proof Checker for QBF (2007) (55)
The AIGER And-Inverter Graph (AIG) Format Version 20070427 (2007) (54)
SAT Race 2015 (2016) (52)
SAT and ATPG: Boolean engines for formal hardware verification (2002) (52)
JNuke: Efficient Dynamic Analysis for Java (2004) (51)
Using Block-Local Atomicity to Detect Stale-Value Concurrency Errors (2004) (51)
Splatz , Lingeling , Plingeling , Treengeling , YalSAT Entering the SAT Competition 2016 (2016) (51)
Verifying Safety Properties of a PowerPC TM 1 Microprocessor Using Symbolic Model Checking without BDDs (1999) (50)
Nenofex: Expanding NNF for QBF Solving (2008) (50)
Verifying Large Multipliers by Combining SAT and Computer Algebra (2019) (50)
Optimization of Combinatorial Testing by Incremental SAT Solving (2015) (48)
Managing SAT inconsistencies with HUMUS (2012) (48)
Column-wise verification of multipliers using computer algebra (2017) (48)
A Unified Proof System for QBF Preprocessing (2014) (46)
Liveness Checking as Safety Checking for Infinite State Spaces (2006) (46)
Factoring Out Assumptions to Speed Up MUS Extraction (2013) (45)
Detecting Cardinality Constraints in CNF (2014) (45)
LINGELING and Friends Entering the SAT Challenge 2012 (2012) (45)
Decomposing SAT Problems into Connected Components (2006) (44)
Lingeling Essentials, A Tutorial on Design and Implementation Aspects of the the SAT Solver Lingeling (2014) (43)
Simple Is Better: Efficient Bounded Model Checking for Past LTL (2005) (43)
Evaluating CDCL Restart Schemes (2019) (43)
Extended Resolution Proofs for Symbolic SAT Solving with Quantification (2006) (42)
Btor2 , BtorMC and Boolector 3.0 (2018) (41)
Greedy combinatorial test case generation using unsatisfiable cores (2016) (40)
iDQ: Instantiation-Based DQBF Solving (2014) (39)
Bridging the gap between dual propagation and CNF-based QBF solving (2013) (38)
Efficient extraction of Skolem functions from QRAT proofs (2014) (38)
A DPLL Algorithm for Solving DQBF (2012) (37)
Complexity of Fixed-Size Bit-Vector Logics (2016) (36)
On the Complexity of Fixed-Size Bit-Vector Logics with Binary Encoded Bit-Width (2012) (36)
Stochastic Local Search for Satisfiability Modulo Theories (2015) (35)
BTOR: bit-precise modelling of word-level problems for model checking (2008) (34)
Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination (2015) (34)
Modbat: A Model-Based API Tester for Event-Driven Systems (2013) (34)
µcke - Efficient µ-Calculus Model Checking (1997) (34)
Local Two-Level And-Inverter Graph Minimization without Blowup (2006) (33)
Short Proofs Without New Variables (2017) (32)
Lingeling and Friends at the SAT Competition 2011 (2011) (32)
Solution Validation and Extraction for QBF Preprocessing (2016) (31)
Model-Based Testing for Verification Back-Ends (2013) (28)
Hardware model checking competition 2017 (2017) (28)
Incremental Inprocessing in SAT Solving (2019) (27)
Covered Clause Elimination (2010) (26)
Effective Bit-Width and Under-Approximation (2009) (26)
Improving and extending the algebraic approach for verifying gate-level multipliers (2018) (26)
Guided Merging of Sequence Diagrams (2012) (25)
PRuning Through Satisfaction (2017) (25)
Consistency Checking of All Different Constraints over Bit-Vectors within a SAT Solver (2008) (25)
Hardware Model Checking Competition 2014: An Analysis and Comparison of Solvers and Benchmarks (2016) (24)
Counterexample-Guided Model Synthesis (2017) (24)
The Evolution from LIMMAT to NANOSAT (2004) (24)
A Survey on Applications of Quantified Boolean Formulas (2019) (24)
DepQBF: A Dependency-Aware QBF Solver (System Description) (2010) (23)
Reconstructing Solutions after Blocked Clause Elimination (2010) (23)
qbf2epr: A Tool for Generating EPR Formulas from QBF (2013) (23)
JVM Independent Replay in Java (2004) (22)
What a Difference a Variable Makes (2018) (22)
Analysis of Portfolio-Style Parallel SAT Solving on Current Multi-Core Architectures (2013) (22)
Verification of Out-Of-Order Processor Designs Using Model Checking and a Light-Weight Completion Function (2002) (21)
Failed Literal Detection for QBF (2011) (21)
Strong Extension-Free Proof Systems (2019) (21)
Multiple State and Single State Tableaux for Combining Local and Global Model Checking (1999) (20)
Revisiting Hyper Binary Resolution (2013) (19)
Enforcer - Efficient Failure Injection (2006) (19)
Blocked Clause Decomposition (2013) (19)
Cube-and-Conquer for Satisfiability (2018) (19)
The Auspicious Couple: Symbolic Execution and WCET Analysis (2013) (18)
Propagation based local search for bit-precise reasoning (2017) (18)
Super-Blocked Clauses (2016) (18)
Backing Backtracking (2019) (18)
A Compact Representation for Syntactic Dependencies in QBFs (2009) (18)
Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo Theories (2018) (16)
Collection of Combinational Arithmetic Miters Submitted to the SAT Competition 2016 (2016) (16)
P{re,i}cosat@sc'09 Picosat 193 (2009) (15)
Improving Implementation of SLS Solvers for SAT and New Heuristics for k-SAT with Long Clauses (2014) (15)
Precise and Complete Propagation Based Local Search for Satisfiability Modulo Theories (2016) (15)
Verifying the IEEE 1394 FireWire Tree Identify Protocol with SMV (2003) (15)
Model-Based API Testing for SMT Solvers (2017) (15)
Everything You Always Wanted to Know about Blocked Sets (But Were Afraid to Ask) (2014) (14)
Improving Local Search for Bit-Vector Logics in SMT with Path Propagation (2015) (14)
Turbo-charging Lemmas on demand with don't care reasoning (2014) (14)
More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics with Binary Encoding (2013) (14)
Encoding Redundancy for Satisfaction-Driven Clause Learning (2019) (14)
Incremental column-wise verification of arithmetic circuits using computer algebra (2019) (13)
A comparison of strategies for tolerating inconsistencies during decision-making (2012) (13)
Subroutine Inlining and Bytecode Abstraction to Simplify Static and Dynamic Analysis (2005) (13)
A Practical Polynomial Calculus for Arithmetic Circuit Verification (2018) (13)
Preprocessing and Inprocessing Techniques in SAT (2011) (13)
Efficiently Solving Bit-Vector Problems Using Model Checkers (2013) (12)
Preprocessing in SAT Solving (2021) (12)
Compositional Propositional Proofs (2015) (12)
Effiziente Modellprüfung des µ-Kalküls mit binären Entscheidungsdiagrammen (1997) (12)
Blocked Clauses in First-Order Logic (2017) (12)
Experimenting with SAT Solvers in Vampire (2014) (12)
Concurrent Cube-and-Conquer (2014) (11)
Arithmetic Verification Problems Submitted to the SAT Race 2019 (2019) (11)
Distributed Cube and Conquer with Paracooba (2020) (11)
Exhaustive Testing of Exception Handlers with Enforcer (2006) (11)
SDL Versus C Equivalence Checking (2005) (10)
Clausal Proofs of Mutilated Chessboards (2019) (10)
Blocked Literals Are Universal (2015) (10)
Lemmas on Demand for Lambdas (2013) (10)
Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers (2009) (10)
C32SAT: Checking C Expressions (2007) (9)
Lingeling and Friends Entering the SAT Race 2015 (2015) (9)
From DRUP to PAC and Back (2020) (9)
Efficient Model Checking of Applications with Input/Output (2007) (8)
Advanced unit testing: how to scale up a unit test framework (2006) (8)
SAT Solving with GPU Accelerated Inprocessing (2021) (8)
CADICAL, KISSAT, PARACOOBA Entering the SAT Competition 2021 (2021) (8)
AMulet 2.0 for Verifying Multiplier Circuits (2021) (8)
Random Test Case Generation and Delta Debugging for BitVector Logic with Arrays (2008) (7)
Computer Aided Verification (2014) (7)
A Simple Verification of the Tree Identify Protocol with SMV (2001) (7)
Concurrent Cube-and-Conquer - (Poster Presentation) (2012) (7)
Tutorial on Model Checking: Modelling and Verification in Computer Science (2008) (7)
Dualizing Projected Model Counting (2018) (7)
Truth Assignments as Conditional Autarkies (2019) (7)
Clausal Proof Compression (2016) (7)
Two flavors of DRAT (2018) (7)
On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic (2014) (7)
The Effect of Scrambling CNFs (2019) (6)
Nullstellensatz-Proofs for Multiplier Verification (2020) (6)
Clausal Proofs for Pseudo-Boolean Reasoning (2022) (6)
Comparative Empirical Evaluation of Reasoning Systems (2012) (6)
SAT, Computer Algebra, Multipliers (2020) (6)
Boolector at the SMT Competition 2016 (2011) (6)
Digitaltechnik - eine praxisnahe EinfÃ¼hrung (2008) (6)
Non-clausal Redundancy Properties (2021) (5)
Non-clausal Redundancy Properties (2021) (5)
Challenges in Verifying Arithmetic Circuits Using Computer Algebra (2017) (5)
Tools and Algorithms for the Construction and Analysis of Systems: 26th International Conference, TACAS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25–30, 2020, Proceedings, Part I (2020) (5)
Combining Local and Global Model Checking (2001) (5)
Bit-Precise Reasoning Beyond Bit-Blasting (2017) (5)
Skolem Function Continuation for Quantified Boolean Formulas (2017) (5)
Chasing Target Phases (2020) (5)
: A Tool for Polynomially Translating Quantifier-Free Bit-Vector Formulas into (2013) (4)
LINGELING , T REENGELING and Y AL SAT Entering the SAT Competition 2017 (2017) (4)
Covered Clauses Are Not Propagation Redundant (2020) (4)
bv 2 epr : A Tool for Polynomially Translating Quantifier-Free Bit-Vector Formulas into EPR Æ (2013) (4)
An Abstract Dual Propositional Model Counter (2017) (4)
Combining Conflict-Driven Clause Learning and Chronological Backtracking for Propositional Model Counting (2019) (3)
Progress in Certifying Hardware Model Checking Results (2021) (3)
Local Redundancy in SAT: Generalizations of Blocked Clauses (2017) (3)
A Duality-Aware Calculus for Quantified Boolean Formulas (2016) (3)
Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing (2006) (3)
Simulating Strong Practical Proof Systems with Extended Resolution (2020) (3)
Cube-and-Conquer Approach for SAT Solving on Grids (2013) (3)
(Q)CompSAT and (Q)PicoSAT at the SAT’06 Race (2006) (3)
Better Decision Heuristics in CDCL through Local Search and Target Phases (2022) (3)
Four Flavors of Entailment (2020) (3)
SAT-Based Model Checking (2018) (3)
Efficient All-UIP Learned Clause Minimization (2021) (3)
Blockedness in Propositional Logic: Are You Satisfied With Your Neighborhood? (2017) (3)
SmacC: A Retargetable Symbolic Execution Engine (2013) (3)
The Proof Checkers Pacheck and Pastèque for the Practical Algebraic Calculus (2020) (3)
Adding Dual Variables to Algebraic Reasoning for Gate-Level Multiplier Verification (2022) (3)
Better lemmas with lambda extraction (2015) (3)
Verifying sequential behavior with model checking (2001) (3)
PicoSAT Versions 535 (2007) (2)
Aiding an Introduction to Formal Reasoning Within a First-Year Logic Course for CS Majors Using a Mobile Self-Study App (2020) (2)
SAT, SMT and Applications (2009) (2)
Certifying Hardware Model Checking Results (2019) (2)
Computational Logic in the First Semester of Computer Science: An Experience Report (2020) (2)
Hardware and Software: Verification and Testing (2012) (2)
Tools and Algorithms for the Construction and Analysis of Systems: 26th International Conference, TACAS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25–30, 2020, Proceedings, Part II (2020) (2)
Proceedings of the 8th international conference on Hardware and Software: verification and testing (2012) (2)
Duplex Encoding of Staircase At-Most-One Constraints for the Antibandwidth Problem (2020) (2)
Practical algebraic calculus and Nullstellensatz with the checkers Pacheck and Pastèque and Nuss-Checker (2022) (2)
Challenges in bit-precise reasoning (2014) (2)
Where does SAT not work (2014) (2)
Single Clause Assumption without Activation Literals to Speed-up IC3 (2021) (1)
Extracting and Checking Q-Resolution Proofs from a State-Of-The-Art QBF-Solver (2012) (1)
Mining definitions in Kissat with Kittens (2023) (1)
Revisiting Decision Diagrams for SAT (2018) (1)
Scalable Proof Producing Multi-Threaded SAT Solving with Gimsatul through Sharing instead of Copying Clauses (2022) (1)
Improving AMulet2 for verifying multiplier circuits using SAT solving and computer algebra (2023) (1)
Extracting and Validating Skolem/Herbrand Function-Based QBF Certificates (2012) (1)
A Duality-Aware Calculus for Quantified Boolean Formulas (2016) (1)
Efficient All-UIP Learned Clause Minimization (Extended Version) (2021) (1)
Quantifier-Free Bit-Vector Formulas with Binary Encoding: Benchmark Description (2013) (1)
Deep Bound Hardware Model Checking Instances , Quadratic Propagations Benchmarks and Reencoded Factorization Problems Submitted to the SAT Competition 2017 (2017) (1)
P LINGELING , T REENGELING and Y AL SAT Entering the SAT Competition 2018 (2018) (1)
Formal Methods Group ETH Zürich (2003) (0)
Chapter 14 Bounded Model Checking (2016) (0)
Preface (2006) (0)
Óñòòòò ××óò Ööñ× Òò Ëëì Èöó Blockin (2000) (0)
Tutorial on World-Level Model Checking (2020) (0)
Simulating Circuit-Level Simplifications on CNF (2011) (0)
Strong Extension-Free Proof Systems (2019) (0)
Computer Algebra , Multipliers ∗ (2020) (0)
Efficient Model Checking of Applications with I/O (2007) (0)
Bounded Model Checking 1 (2003) (0)
FMCAD 2009 Conference Organization (2009) (0)
Combining Decision Diagrams and SAT Procedure sfo rEcien tSymboli cModel Checking (2000) (0)
On Enumerating Short Projected Models (2021) (0)
First-Order Subsumption via SAT Solving (2022) (0)
Propagation based local search for bit-precise reasoning (2017) (0)
Theoretical Foundations of Applied SAT Solving ( 14 w 5101 ) January 19-24 , 2014 (2015) (0)
A History of Satisfiability (2007) (0)
Title : Bounded model checking of liveness properties of TLA + specifications Topic : Computer science – formal verification (2018) (0)
Fuzzing and Delta Debugging And-Inverter Graph Verification Tools (2022) (0)
SAT solving experiments in Vampire (2016) (0)
Blocked Clause Elimination and its Extensions (2010) (0)
122 15171 – Theory and Practice of SAT Solving Participants (2015) (0)
Tools and algorithms for the construction and analysis of systems: a special issue for TACAS 2020 (2022) (0)
Migrating Solver State (2022) (0)
Testing I/O Failures with Enforcer (2006) (0)
A decision procedure for quantified boolean formulae (2000) (0)
Complexity of Fixed-Size Bit-Vector Logics (2015) (0)
Theory and Practice of SAT Solving (Dagstuhl Seminar 15171) (2015) (0)
Preface (2011) (0)
Incremental column-wise verification of arithmetic circuits using computer algebra (2019) (0)
Satisfiability Solvers (2014) (0)
Decomposition Strategies to Count Integer Solutions over Linear Constraints (2021) (0)
EPR Encodings of Bit-Vector Problems Even With Quantifiers (2014) (0)
Stratified Certification for k-Induction (2022) (0)
Handbook of Satisfiability: Preface (2009) (0)
Picosat Versions 535 1 Restarts and Phases 3 Occurrence Lists (2007) (0)
XOR Local Search for Boolean Brent Equations (2021) (0)
Formal Models (2020) (0)
Améliorer SAT dans le cadre incrémental (2014) (0)
Beyond SAT and BDD based model checking (2001) (0)
Preface to the Special Issue on Automated Reasoning Systems (2019) (0)
Proceedings of the 16th International Conference on Computer Aided Verification - Volume 8559 (2014) (0)
ParaQooba: A Fast and Flexible Framework for Parallel and Distributed QBF Solving (2023) (0)
A Framework for Model Checking Against CTLK Using Quantified Boolean Formulas (2019) (0)
Pr Rogram M Proceeding Gs Program Chairs (2011) (0)
Formal background and algorithms (2001) (0)
COMPARE 2012 Comparative Empirical Evaluation of Reasoning Systems (2012) (0)
Duplex Encoding of Antibandwidth Feasibility Formulas Submitted to the SAT Competition 2020 (2020) (0)
Formale Methoden zur Lösung von Komplexitäts- und Qualitätsproblemen (2001) (0)
QuAPI: Adding Assumptions to Non-Assuming SAT & QBF Solvers (2022) (0)
C32SAT: Checking C Expressions (Tool Paper) (2007) (0)
The 2006 Federated Logic (2006) (0)
Practical Aspects of SAT Solving (2013) (0)
Preface to the Special Issue on Automated Reasoning Systems (2019) (0)
Preface (2003) (0)
Solution Validation and Extraction for QBF Preprocessing (2016) (0)
Pragmatics of SAT 2015 and 2018 The Effect of Scrambling CNFs ∗ (2019) (0)
of Pragmatics of SAT 2015 and 2018 Two Flavors of DRAT (2019) (0)
Introductory paper (2005) (0)

This paper list is powered by the following services:

Other Resources About Armin Biere

fmv.jku.at

What Schools Are Affiliated With Armin Biere?

Armin Biere is affiliated with the following schools:

Johannes Kepler University Linz

Armin Biere's Academic­Influence.com Rankings

Why Is Armin Biere Influential?

Armin Biere's Published Works

Published Works

Other Resources About Armin Biere

What Schools Are Affiliated With Armin Biere?

Armin Biere's AcademicInfluence.com Rankings