[go: up one dir, main page]

Follow
Armin Biere
Armin Biere
Professor of Computer Science, University of Freiburg
Verified email at informatik.uni-freiburg.de - Homepage
Title
Cited by
Cited by
Year
Symbolic model checking without BDDs
A Biere, A Cimatti, E Clarke, Y Zhu
International conference on tools and algorithms for the construction and …, 1999
36121999
Handbook of satisfiability
A Biere, M Heule, H van Maaren, T Walsh
IOS press, 2009
32032009
Bounded model checking
A Biere
handbook of Satisfiability, 739-764, 2021
18482021
Bounded model checking using satisfiability solving
E Clarke, A Biere, R Raimi, Y Zhu
Formal methods in system design 19 (1), 7-34, 2001
12032001
Symbolic model checking using SAT procedures instead of BDDs
A Biere, A Cimatti, EM Clarke, M Fujita, Y Zhu
Proceedings of the 36th annual ACM/IEEE Design Automation Conference, 317-320, 1999
11021999
Effective preprocessing in SAT through variable and clause elimination
N Eén, A Biere
International conference on theory and applications of satisfiability …, 2005
9922005
PicoSAT essentials
A Biere
Journal on Satisfiability, Boolean Modelling and Computation 4 (2-4), 75-97, 2008
7182008
Boolector: An efficient SMT solver for bit-vectors and arrays
R Brummayer, A Biere
International Conference on Tools and Algorithms for the Construction and …, 2009
5852009
CaDiCaL, kissat, paracooba, plingeling and treengeling entering the SAT competition 2020
A Biere, K Fazekas, M Fleury, M Heisinger
SAT COMPETITION 50, 2020, 2020
5212020
A survey of recent advances in SAT-based formal verification
MR Prasad, A Biere, A Gupta
International Journal on Software Tools for Technology Transfer 7 (2), 156-173, 2005
4372005
Resolve and expand
A Biere
International conference on theory and applications of satisfiability …, 2004
3862004
Inprocessing rules
M Järvisalo, MJH Heule, A Biere
International Joint Conference on Automated Reasoning, 355-370, 2012
3202012
Lingeling, Plingeling and Treengeling entering the SAT competition 2013
A Biere
Proceedings of SAT competition 2013, 1, 2013
3182013
Cube and conquer: Guiding CDCL SAT solvers by lookaheads
MJH Heule, O Kullmann, S Wieringa, A Biere
Haifa Verification Conference, 50-65, 2011
2852011
High‐level data races
C Artho, K Havelund, A Biere
Software Testing, Verification and Reliability 13 (4), 207-227, 2003
2652003
Linear encodings of bounded LTL model checking
A Biere, K Heljanko, T Junttila, T Latvala, V Schuppan
Logical Methods in Computer Science 2, 2006
2592006
Liveness checking as safety checking
A Biere, C Artho, V Schuppan
Electronic Notes in Theoretical Computer Science 66 (2), 160-177, 2002
2562002
Boolector 2.0: system description
A Niemetz, M Preiner, A Biere
Journal on Satisfiability, Boolean Modelling and Computation 9 (1), 53-58, 2014
2472014
Lingeling, plingeling, picosat and precosat at sat race 2010
A Biere
2462010
Verifying safety properties of a PowerPC− microprocessor using symbolic model checking without BDDs
A Biere, E Clarke, R Raimi, Y Zhu
International Conference on Computer Aided Verification, 60-71, 1999
2311999
The system can't perform the operation now. Try again later.
Articles 1–20