- Nenofex: Expanding NNF for QBF Solving Florian Lonsing and Armin Biere
- Effective Preprocessing in SAT through Variable and Clause Elimination
- Helsinki University of Technology Laboratory for Theoretical Computer Science Research Reports 92
- Efficient CNF Simplification based on Binary Implication Graphs
- Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model
- Combining Local and Global Model Checking Armin Biere1 and Edmund M. Clarke2 and and Yunshan Zhu2
- Simple Bounded LTL Model Checking Timo Latvala1, , Armin Biere2, Keijo Heljanko3, and Tommi Junttila4,
- Symbolic Model Checking using SAT procedures instead of BDDs A. Biere1 2, A. Cimatti3, E.M. Clarke1 2, M. Fujita4, Y. Zhu1 2
- Covered Clause Elimination Marijn Heule
- Resolve and Expand Armin Biere
- Effiziente Modellprfung des -Kalkls mit binren Entscheidungsdiagrammen
- AIOOL 2005 Preliminary Version Combined Static and Dynamic Analysis
- Tutorial on Model Checking Modelling and Verification in Computer Science
- RV'04 Preliminary Version JVM Independent Replay in Java
- A Satisfiability Procedure for Quantified Boolean Formulae
- Efficient Model Checking of Applications with Input/Output
- Software Tools for Technology Transfer manuscript No. (will be inserted by the editor)
- SDL versus C Equivalence Checking Malek Haroud1
- Under consideration for publication in Formal Aspects of Computing Verifying the IEEE 1394 FireWire
- Logical Methods in Computer Science Vol. 2 (5:5) 2006, pp. 164
- A Performance Study of BDD-Based Model Checking
- Automated Testing and Debugging of SAT and QBF Solvers
- SAT and ATPG: Boolean engines for formal hardware verification Armin Biere Wolfgang Kunz
- Simple is Better: Efficient Bounded Model Checking for Timo Latvala1, , Armin Biere2, Keijo Heljanko1, and Tommi Junttila1,
- Electronic Notes in Theoretical Computer Science 66 No. 2 (2002) URL: http://www.elsevier.nl/locate/entcs/volume66.html 18 pages
- Shortest Counterexamples for Symbolic Model Checking of LTL with Past
- Reconstructing Solutions after Blocked Clause Elimination
- High-level Data Races Cyrille Artho
- Journal on Satisfiability, Boolean Modeling and Computation 6 (2009) 165-201 Lemmas on Demand for the Extensional Theory of Arrays
- Adaptive Restart Control for Conflict Driven SAT Solvers
- Integrating Dependency Schemes in Search-Based QBF Solvers
- Consistency Checking of All Different Constraints over Bit-Vectors within a SAT Solver
- Extended Resolution Proofs for Conjoining BDDs Carsten Sinz and Armin Biere
- Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays
- Minimizing Learned Clauses Niklas Sorensson1
- Symbolic Model Checking without BDDs? Armin Biere1, Alessandro Cimatti2, Edmund Clarke1, and Yunshan Zhu1
- Combining Local and Global Model Checking Armin Bierea;b;c
- High-Level Data Races Cyrille Artho1
- Compressing BMC Encodings with QBF Toni Jussila 1
- Verifying Sequential Behavior with Model Checking Armin Biere
- A First Step Towards a Unified Proof Checker for QBF
- on Bounded Model Checking Preliminary Proceedings
- Clause Elimination Procedures for CNF Formulas Marijn Heule1
- DepQBF: A Dependency-Aware QBF Solver, System Description
- Blocked Clause Elimination Matti Jarvisalo1
- Lingeling, Plingeling, PicoSAT and PrecoSAT at SAT Race 2010
- Fuzzing and Delta-Debugging SMT Solvers Robert Brummayer and Armin Biere
- A Compact Representation for Syntactic Dependencies in QBFs
- Effective Bit-Width and Under-Approximation Robert Brummayer and Armin Biere
- MEMICS 2008 Efficiently Representing Existential
- Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers
- BTOR: Bit-Precise Modelling of Word-Level Problems for Model Checking
- Journal on Satisfiability, Boolean Modeling and Computation 4 (2008) 75-97 PicoSAT Essentials
- C32SAT: Checking C Expressions Robert Brummayer and Armin Biere
- Local Two-Level And-Inverter Graph Minimization without Blowup
- The 2006 Federated Logic Conference The Seattle Sheraton Hotel and Towers
- Extended Resolution Proofs for Symbolic SAT Solving with Quantification
- Enforcer Efficient Failure Injection Cyrille Artho1
- Advanced Unit Testing How to Scale up a Unit Test Framework
- Journal on Satisfiability, Boolean Modeling and Computation 2 (2006) 191-198 Research Note
- INFINITY 2005 Preliminary Version Liveness Checking as Safety Checking for
- Bytecode 2005 Preliminary Version Subroutine Inlining and Bytecode Abstraction
- Combined Static and Dynamic Analysis Cyrille Artho1 and Armin Biere2
- Using Block-local Atomicity to Detect Stale-value Concurrency Errors
- HW accelerated Ultra Wide Band MAC protocol using SDL and SystemC
- JNuke: Efficient Dynamic Analysis for Java Cyrille Artho1
- The Evolution from LIMMAT to NANOSAT Technical Report #444
- Software Tools for Technology Transfer manuscript No. (will be inserted by the editor)
- Bounded Model Checking Armin Biere1 Alessandro Cimatti2 Edmund M. Clarke3
- 13 July, 2003 First International Workshop on
- Formal Methods in System Design, 20, 159186, 2002 c 2002 Kluwer Academic Publishers. Manufactured in The Netherlands.
- Bounded Model Checking Using Satisfiability Solving Edmund Clarke1, Armin Biere2, Richard Raimi3, and Yunshan Zhu4
- Applying Static Analysis to Large-scale, Multi-threaded Java Programs
- A Simple Verification of the Tree Identify Protocol with Viktor Schuppan and Armin Biere
- Combining Symbolic Model Checking with Uninterpreted Functions for
- cke Efficient -Calculus Model Checking Armin Biere1
- Lemmas on Demand for the Extensional Theory of Arrays Robert Brummayer Armin Biere
- Shortest Counterexamples for Symbolic Model Checking of LTL with Past
- Second International Workshop on Bounded Model Checking
- Blocked Clause Elimination for QBF Armin Biere , Florian Lonsing, and Martina Seidl
- Failed Literal Detection for QBF Florian Lonsing and Armin Biere
- Lingeling and Friends at the SAT Competition 2011
- Journal of Automated Reasoning manuscript No. (will be inserted by the editor)
- Prrogramm Proceedinggs Program Chairs
- P{re,i}coSAT@SC'09 Armin Biere
- Cube and Conquer: Guiding CDCL SAT Solvers by Lookaheads
- (Q)CompSAT and (Q)PicoSAT at the SAT'06 Race Armin Biere
