Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Armin Biere
2010 – today
- 2013
[c62]Armin Biere, Jens Knoop, Laura Kovács, Jakob Zwirchmayr: SmacC: A Retargetable Symbolic Execution Engine. ATVA 2013: 482-486- [c61]Gergely Kovásznai, Andreas Fröhlich, Armin Biere: : A Tool for Polynomially Translating Quantifier-Free Bit-Vector Formulas into. CADE 2013: 443-449
- [c60]
- [c59]Andreas Fröhlich, Gergely Kovásznai, Armin Biere: More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics with Binary Encoding. CSR 2013: 378-390
- [c58]Alexandra Goultiaeva, Martina Seidl, Armin Biere: Bridging the gap between dual propagation and CNF-based QBF solving. DATE 2013: 811-814
- [c57]Jean-Marie Lagniez, Armin Biere: Factoring Out Assumptions to Speed Up MUS Extraction. SAT 2013: 276-292
- [c56]Cyrille Artho, Armin Biere, Martina Seidl: Model-Based Testing for Verification Back-Ends. TAP 2013: 39-55
- [c55]Armin Biere, Jens Knoop, Laura Kovács, Jakob Zwirchmayr: The Auspicious Couple: Symbolic Execution and WCET Analysis. WCET 2013: 53-63
- [e4]Armin Biere, Amir Nahir, Tanja E. J. Vos (Eds.): Hardware and Software: Verification and Testing - 8th International Haifa Verification Conference, HVC 2012, Haifa, Israel, November 6-8, 2012. Revised Selected Papers. Lecture Notes in Computer Science 7857, Springer 2013, ISBN 978-3-642-39610-6
- 2012
- [j29]Matti Järvisalo, Armin Biere, Marijn Heule: Simulating Circuit-Level Simplifications on CNF. J. Autom. Reasoning 49(4): 583-619 (2012)
- [c54]
- [c53]Norbert Manthey, Marijn Heule, Armin Biere: Automated Reencoding of Boolean Formulas. Haifa Verification Conference 2012: 102-117
- [c52]Aina Niemetz, Mathias Preiner, Florian Lonsing, Martina Seidl, Armin Biere: Resolution-Based Certificate Extraction for QBF - (Tool Presentation). SAT 2012: 430-435
- [c51]Peter van der Tak, Marijn Heule, Armin Biere: Concurrent Cube-and-Conquer - (Poster Presentation). SAT 2012: 475-476
- [c50]Magdalena Widl, Armin Biere, Petra Brosch, Uwe Egly, Marijn Heule, Gerti Kappel, Martina Seidl, Hans Tompits: Guided Merging of Sequence Diagrams. SLE 2012: 164-183
- [c49]Alexander Nöhrer, Armin Biere, Alexander Egyed: A comparison of strategies for tolerating inconsistencies during decision-making. SPLC (1) 2012: 11-20
- [c48]Alexander Nöhrer, Armin Biere, Alexander Egyed: Managing SAT inconsistencies with HUMUS. VaMoS 2012: 83-91
- [e3]Vladimir Klebanov, Bernhard Beckert, Armin Biere, Geoff Sutcliffe (Eds.): Proceedings of the 1st International Workshop on Comparative Empirical Evaluation of Reasoning Systems, Manchester, United Kingdom, June 30, 2012. CEUR Workshop Proceedings 873, CEUR-WS.org 2012
- 2011
- [j28]
- [c47]
- [c46]Armin Biere: Preprocessing and Inprocessing Techniques in SAT. Haifa Verification Conference 2011: 1
- [c45]Marijn Heule, Oliver Kullmann, Siert Wieringa, Armin Biere: Cube and Conquer: Guiding CDCL SAT Solvers by Lookaheads. Haifa Verification Conference 2011: 50-65
- [c44]Marijn Heule, Matti Järvisalo, Armin Biere: Efficient CNF Simplification Based on Binary Implication Graphs. SAT 2011: 201-215
- [c43]
- 2010
- [j27]
- [c42]Marijn Heule, Matti Järvisalo, Armin Biere: Clause Elimination Procedures for CNF Formulas. LPAR (Yogyakarta) 2010: 357-371
- [c41]Robert Brummayer, Florian Lonsing, Armin Biere: Automated Testing and Debugging of SAT and QBF Solvers. SAT 2010: 44-57
- [c40]Florian Lonsing, Armin Biere: Integrating Dependency Schemes in Search-Based QBF Solvers. SAT 2010: 158-171
- [c39]Matti Järvisalo, Armin Biere: Reconstructing Solutions after Blocked Clause Elimination. SAT 2010: 340-345
- [c38]
- [i2]
2000 – 2009
- 2009
- [j26]Florian Lonsing, Armin Biere: Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers. Electr. Notes Theor. Comput. Sci. 251: 83-95 (2009)
- [j25]Robert Brummayer, Armin Biere: Lemmas on Demand for the Extensional Theory of Arrays. JSAT 6(1-3): 165-201 (2009)
- [c37]
- [c36]
- [c35]
- [c34]Florian Lonsing, Armin Biere: A Compact Representation for Syntactic Dependencies in QBFs. SAT 2009: 398-411
- [c33]Robert Brummayer, Armin Biere: Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays. TACAS 2009: 174-177
- [p1]
- [e2]Armin Biere, Marijn Heule, Hans van Maaren, Toby Walsh (Eds.): Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications 185, IOS Press 2009, ISBN 978-1-58603-929-5
- 2008
- [j24]
- [c32]Armin Biere: Tutorial on Model Checking: Modelling and Verification in Computer Science. AB 2008: 16-21
- [c31]Armin Biere, Robert Brummayer: Consistency Checking of All Different Constraints over Bit-Vectors within a SAT Solver. FMCAD 2008: 1-4
- [c30]
- [c29]
- 2007
- [j23]
- [j22]Toni Jussila, Armin Biere: Compressing BMC Encodings with QBF. Electr. Notes Theor. Comput. Sci. 174(3): 45-56 (2007)
- [c28]
- [c27]Cyrille Artho, Boris Zweimüller, Armin Biere, Etsuya Shibayama, Shinichi Honiden: Efficient Model Checking of Applications with Input/Output. EUROCAST 2007: 515-522
- [c26]Toni Jussila, Armin Biere, Carsten Sinz, Daniel Kröning, Christoph M. Wintersteiger: A First Step Towards a Unified Proof Checker for QBF. SAT 2007: 201-214
- 2006
- [j21]
- [j20]Viktor Schuppan, Armin Biere: Liveness Checking as Safety Checking for Infinite State Spaces. Electr. Notes Theor. Comput. Sci. 149(1): 79-96 (2006)
- [j19]Armin Biere, Carsten Sinz: Decomposing SAT Problems into Connected Components. JSAT 2(1-4): 201-208 (2006)
- [j18]Armin Biere, Keijo Heljanko, Tommi A. Junttila, Timo Latvala, Viktor Schuppan: Linear Encodings of Bounded LTL Model Checking. Logical Methods in Computer Science 2(5) (2006)
- [c25]
- [c24]Cyrille Artho, Armin Biere, Shinichi Honiden: Enforcer - Efficient Failure Injection. FM 2006: 412-427
- [c23]Cyrille Artho, Armin Biere, Shinichi Honiden: Exhaustive Testing of Exception Handlers with Enforcer. FMCO 2006: 26-46
- [c22]Cyrille Artho, Armin Biere: Advanced Unit Testing: How to Scale up a Unit Test Framework. AST 2006: 92-98
- [c21]Toni Jussila, Carsten Sinz, Armin Biere: Extended Resolution Proofs for Symbolic SAT Solving with Quantification. SAT 2006: 54-60
- [e1]Armin Biere, Carla P. Gomes (Eds.): Theory and Applications of Satisfiability Testing - SAT 2006, 9th International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings. Lecture Notes in Computer Science 4121, Springer 2006, ISBN 3-540-37206-7
- [i1]Armin Biere, Keijo Heljanko, Tommi A. Junttila, Timo Latvala, Viktor Schuppan: Linear Encodings of Bounded LTL Model Checking. CoRR abs/cs/0611029 (2006)
- 2005
- [j17]Viktor Schuppan, Marcel Baur, Armin Biere: JVM Independent Replay in Java. Electr. Notes Theor. Comput. Sci. 113: 85-104 (2005)
- [j16]
- [j15]Cyrille Artho, Armin Biere: Combined Static and Dynamic Analysis. Electr. Notes Theor. Comput. Sci. 131: 3-14 (2005)
- [j14]Cyrille Artho, Armin Biere: Subroutine Inlining and Bytecode Abstraction to Simplify Static and Dynamic Analysis. Electr. Notes Theor. Comput. Sci. 141(1): 109-128 (2005)
- [j13]
- [j12]Mukul R. Prasad, Armin Biere, Aarti Gupta: A survey of recent advances in SAT-based formal verification. STTT 7(2): 156-173 (2005)
- [c20]Niklas Eén, Armin Biere: Effective Preprocessing in SAT Through Variable and Clause Elimination. SAT 2005: 61-75
- [c19]
- [c18]Viktor Schuppan, Armin Biere: Shortest Counterexamples for Symbolic Model Checking of LTL with Past. TACAS 2005: 493-509
- [c17]Timo Latvala, Armin Biere, Keijo Heljanko, Tommi A. Junttila: Simple Is Better: Efficient Bounded Model Checking for Past LTL. VMCAI 2005: 380-395
- 2004
- [j11]Viktor Schuppan, Armin Biere: Efficient reduction of finite state model checking to reachability analysis. STTT 5(2-3): 185-204 (2004)
- [c16]Cyrille Artho, Klaus Havelund, Armin Biere: Using Block-Local Atomicity to Detect Stale-Value Concurrency Errors. ATVA 2004: 150-164
- [c15]Cyrille Artho, Viktor Schuppan, Armin Biere, Pascal Eugster, Marcel Baur, Boris Zweimüller: JNuke: Efficient Dynamic Analysis for Java. CAV 2004: 462-465
- [c14]Timo Latvala, Armin Biere, Keijo Heljanko, Tommi A. Junttila: Simple Bounded LTL Model Checking. FMCAD 2004: 186-200
- [c13]
- [c12]
- 2003
- [j10]Armin Biere, Alessandro Cimatti, Edmund M. Clarke, Ofer Strichman, Yunshan Zhu: Bounded model checking. Advances in Computers 58: 117-148 (2003)
- [j9]David A. Plaisted, Armin Biere, Yunshan Zhu: A satisfiability procedure for quantified Boolean formulae. Discrete Applied Mathematics 130(2): 291-328 (2003)
- [j8]Armin Biere, Cyrille Artho, Malek Haroud, Viktor Schuppan: Formal Methods Group ETH Zürich. Electr. Notes Theor. Comput. Sci. 80: 289-293 (2003)
- [j7]
- [j6]Viktor Schuppan, Armin Biere: Verifying the IEEE 1394 FireWire Tree Identify Protocol with SMV. Formal Asp. Comput. 14(3): 267-280 (2003)
- [j5]Cyrille Artho, Klaus Havelund, Armin Biere: High-level data races. Softw. Test., Verif. Reliab. 13(4): 207-227 (2003)
- [c11]
- 2002
- [j4]Armin Biere, Cyrille Artho, Viktor Schuppan: Liveness Checking as Safety Checking. Electr. Notes Theor. Comput. Sci. 66(2): 160-177 (2002)
- [j3]Sergey Berezin, Edmund M. Clarke, Armin Biere, Yunshan Zhu: Verification of Out-Of-Order Processor Designs Using Model Checking and a Light-Weight Completion Function. Formal Methods in System Design 20(2): 159-186 (2002)
- [c10]Armin Biere, Wolfgang Kunz: SAT and ATPG: Boolean engines for formal hardware verification. ICCAD 2002: 782-785
- 2001
- [j2]Edmund M. Clarke, Armin Biere, Richard Raimi, Yunshan Zhu: Bounded Model Checking Using Satisfiability Solving. Formal Methods in System Design 19(1): 7-34 (2001)
- [c9]Cyrille Artho, Armin Biere: Applying Static Analysis to Large-Scale, Multi-Threaded Java Programs. Australian Software Engineering Conference 2001: 68-75
- 2000
- [c8]Poul Frederick Williams, Armin Biere, Edmund M. Clarke, Anubhav Gupta: Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model Checking. CAV 2000: 124-138
1990 – 1999
- 1999
- [j1]Armin Biere, Edmund M. Clarke, Yunshan Zhu: Combining Local and Global Model Checking. Electr. Notes Theor. Comput. Sci. 23(2): 34-45 (1999)
- [c7]Armin Biere, Edmund M. Clarke, Yunshan Zhu: Multiple State and Single State Tableaux for Combining Local and Global Model Checking. Correct System Design 1999: 163-179
- [c6]Armin Biere, Edmund M. Clarke, Richard Raimi, Yunshan Zhu: Verifiying Safety Properties of a Power PC Microprocessor Using Symbolic Model Checking without BDDs. CAV 1999: 60-71
- [c5]Armin Biere, Alessandro Cimatti, Edmund M. Clarke, Masahiro Fujita, Yunshan Zhu: Symbolic Model Checking Using SAT Procedures instead of BDDs. DAC 1999: 317-320
- [c4]Armin Biere, Alessandro Cimatti, Edmund M. Clarke, Yunshan Zhu: Symbolic Model Checking without BDDs. TACAS 1999: 193-207
- 1998
- [c3]Bwolen Yang, Randal E. Bryant, David R. O'Hallaron, Armin Biere, Olivier Coudert, Geert Janssen, Rajeev K. Ranjan, Fabio Somenzi: A Performance Study of BDD-Based Model Checking. FMCAD 1998: 255-289
- [c2]Sergey Berezin, Armin Biere, Edmund M. Clarke, Yunshan Zhu: Combining Symbolic Model Checking with Uninterpreted Functions for Out-of-Order Processor Verification. FMCAD 1998: 369-386
- 1997
- [b1]Armin Biere: Effiziente Modellprüfung des µ-Kalküls mit binären Entscheidungsdiagrammen. Universität Karlsruhe 1997, pp. I-VIII, 1-230
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:24 CEST by the dblp team