|
Search the dblp DataBase
Armin Biere:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Cyrille Artho, Armin Biere
Applying Static Analysis to Large-Scale, Multi-Threaded Java Programs. [Citation Graph (0, 0)][DBLP] Australian Software Engineering Conference, 2001, pp:68-75 [Conf]
- Cyrille Artho, Klaus Havelund, Armin Biere
Using Block-Local Atomicity to Detect Stale-Value Concurrency Errors. [Citation Graph (0, 0)][DBLP] ATVA, 2004, pp:150-164 [Conf]
- Armin Biere, Edmund M. Clarke, Yunshan Zhu
Multiple State and Single State Tableaux for Combining Local and Global Model Checking. [Citation Graph (0, 0)][DBLP] Correct System Design, 1999, pp:163-179 [Conf]
- Armin Biere
µcke - Efficient µ-Calculus Model Checking. [Citation Graph (0, 0)][DBLP] CAV, 1997, pp:468-471 [Conf]
- Armin Biere, Edmund M. Clarke, Richard Raimi, Yunshan Zhu
Verifiying Safety Properties of a Power PC Microprocessor Using Symbolic Model Checking without BDDs. [Citation Graph (0, 0)][DBLP] CAV, 1999, pp:60-71 [Conf]
- Cyrille Artho, Viktor Schuppan, Armin Biere, Pascal Eugster, Marcel Baur, Boris Zweimüller
JNuke: Efficient Dynamic Analysis for Java. [Citation Graph (0, 0)][DBLP] CAV, 2004, pp:462-465 [Conf]
- Poul Frederick Williams, Armin Biere, Edmund M. Clarke, Anubhav Gupta
Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model Checking. [Citation Graph (0, 0)][DBLP] CAV, 2000, pp:124-138 [Conf]
- Carsten Sinz, Armin Biere
Extended Resolution Proofs for Conjoining BDDs. [Citation Graph (0, 0)][DBLP] CSR, 2006, pp:600-611 [Conf]
- Armin Biere, Alessandro Cimatti, Edmund M. Clarke, Masahiro Fujita, Yunshan Zhu
Symbolic Model Checking Using SAT Procedures instead of BDDs. [Citation Graph (0, 0)][DBLP] DAC, 1999, pp:317-320 [Conf]
- Cyrille Artho, Armin Biere, Shinichi Honiden
Enforcer - Efficient Failure Injection. [Citation Graph (0, 0)][DBLP] FM, 2006, pp:412-427 [Conf]
- Timo Latvala, Armin Biere, Keijo Heljanko, Tommi A. Junttila
Simple Bounded LTL Model Checking. [Citation Graph (0, 0)][DBLP] FMCAD, 2004, pp:186-200 [Conf]
- Sergey Berezin, Armin Biere, Edmund M. Clarke, Yunshan Zhu
Combining Symbolic Model Checking with Uninterpreted Functions for Out-of-Order Processor Verification. [Citation Graph (0, 0)][DBLP] FMCAD, 1998, pp:369-386 [Conf]
- 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. [Citation Graph (0, 0)][DBLP] FMCAD, 1998, pp:255-289 [Conf]
- Armin Biere, Wolfgang Kunz
SAT and ATPG: Boolean engines for formal hardware verification. [Citation Graph (0, 0)][DBLP] ICCAD, 2002, pp:782-785 [Conf]
- Cyrille Artho, Klaus Havelund, Armin Biere
High-Level Data Races. [Citation Graph (0, 0)][DBLP] NDDL/VVEIS, 2003, pp:82-93 [Conf]
- Armin Biere
Resolve and Expand. [Citation Graph (0, 0)][DBLP] SAT, 2004, pp:- [Conf]
- Armin Biere
Resolve and Expand. [Citation Graph (0, 0)][DBLP] SAT (Selected Papers, 2004, pp:59-70 [Conf]
- Toni Jussila, Carsten Sinz, Armin Biere
Extended Resolution Proofs for Symbolic SAT Solving with Quantification. [Citation Graph (0, 0)][DBLP] SAT, 2006, pp:54-60 [Conf]
- Niklas Eén, Armin Biere
Effective Preprocessing in SAT Through Variable and Clause Elimination. [Citation Graph (0, 0)][DBLP] SAT, 2005, pp:61-75 [Conf]
- Malek Haroud, Armin Biere
SDL Versus C Equivalence Checking. [Citation Graph (0, 0)][DBLP] SDL Forum, 2005, pp:323-338 [Conf]
- Armin Biere, Alessandro Cimatti, Edmund M. Clarke, Yunshan Zhu
Symbolic Model Checking without BDDs. [Citation Graph (0, 0)][DBLP] TACAS, 1999, pp:193-207 [Conf]
- Viktor Schuppan, Armin Biere
Shortest Counterexamples for Symbolic Model Checking of LTL with Past. [Citation Graph (0, 0)][DBLP] TACAS, 2005, pp:493-509 [Conf]
- Timo Latvala, Armin Biere, Keijo Heljanko, Tommi A. Junttila
Simple Is Better: Efficient Bounded Model Checking for Past LTL. [Citation Graph (0, 0)][DBLP] VMCAI, 2005, pp:380-395 [Conf]
- Armin Biere, Alessandro Cimatti, Edmund M. Clarke, Ofer Strichman, Yunshan Zhu
Bounded model checking. [Citation Graph (0, 0)][DBLP] Advances in Computers, 2003, v:58, n:, pp:118-149 [Journal]
- David A. Plaisted, Armin Biere, Yunshan Zhu
A satisfiability procedure for quantified Boolean formulae. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:130, n:2, pp:291-328 [Journal]
- Cyrille Artho, Armin Biere
Combined Static and Dynamic Analysis. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2005, v:131, n:, pp:3-14 [Journal]
- Cyrille Artho, Armin Biere
Subroutine Inlining and Bytecode Abstraction to Simplify Static and Dynamic Analysis. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2005, v:141, n:1, pp:109-128 [Journal]
- Armin Biere, Cyrille Artho, Malek Haroud, Viktor Schuppan
Formal Methods Group ETH Zürich. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2003, v:80, n:, pp:- [Journal]
- Armin Biere, Cyrille Artho, Viktor Schuppan
Liveness Checking as Safety Checking. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2002, v:66, n:2, pp:- [Journal]
- Armin Biere, Edmund M. Clarke, Yunshan Zhu
Combining Local and Global Model Checking. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 1999, v:23, n:2, pp:- [Journal]
- Armin Biere, Ofer Strichman
Preface. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2005, v:119, n:2, pp:1-0 [Journal]
- Armin Biere, Ofer Strichman
Preface. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2006, v:144, n:1, pp:1-0 [Journal]
- Viktor Schuppan, Armin Biere
Liveness Checking as Safety Checking for Infinite State Spaces. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2006, v:149, n:1, pp:79-96 [Journal]
- Viktor Schuppan, Marcel Baur, Armin Biere
JVM Independent Replay in Java. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2005, v:113, n:, pp:85-104 [Journal]
- Ofer Strichman, Armin Biere
Preface. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2007, v:174, n:3, pp:1-2 [Journal]
- Toni Jussila, Armin Biere
Compressing BMC Encodings with QBF. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2007, v:174, n:3, pp:45-56 [Journal]
- Viktor Schuppan, Armin Biere
Verifying the IEEE 1394 FireWire Tree Identify Protocol with SMV. [Citation Graph (0, 0)][DBLP] Formal Asp. Comput., 2003, v:14, n:3, pp:267-280 [Journal]
- Edmund M. Clarke, Armin Biere, Richard Raimi, Yunshan Zhu
Bounded Model Checking Using Satisfiability Solving. [Citation Graph (0, 0)][DBLP] Formal Methods in System Design, 2001, v:19, n:1, pp:7-34 [Journal]
- 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. [Citation Graph (0, 0)][DBLP] Formal Methods in System Design, 2002, v:20, n:2, pp:159-186 [Journal]
- Armin Biere, Ofer Strichman
Introductory paper. [Citation Graph (0, 0)][DBLP] STTT, 2005, v:7, n:2, pp:87-88 [Journal]
- Mukul R. Prasad, Armin Biere, Aarti Gupta
A survey of recent advances in SAT-based formal verification. [Citation Graph (0, 0)][DBLP] STTT, 2005, v:7, n:2, pp:156-173 [Journal]
- Viktor Schuppan, Armin Biere
Efficient reduction of finite state model checking to reachability analysis. [Citation Graph (0, 0)][DBLP] STTT, 2004, v:5, n:2-3, pp:185-204 [Journal]
- Cyrille Artho, Klaus Havelund, Armin Biere
High-level data races. [Citation Graph (0, 0)][DBLP] Softw. Test., Verif. Reliab., 2003, v:13, n:4, pp:207-227 [Journal]
- Robert Brummayer, Armin Biere
C32SAT: Checking C Expressions. [Citation Graph (0, 0)][DBLP] CAV, 2007, pp:294-297 [Conf]
- Cyrille Artho, Boris Zweimüller, Armin Biere, Etsuya Shibayama, Shinichi Honiden
Efficient Model Checking of Applications with Input/Output. [Citation Graph (0, 0)][DBLP] EUROCAST, 2007, pp:515-522 [Conf]
- Toni Jussila, Armin Biere, Carsten Sinz, Daniel Kröning, Christoph M. Wintersteiger
A First Step Towards a Unified Proof Checker for QBF. [Citation Graph (0, 0)][DBLP] SAT, 2007, pp:201-214 [Conf]
- Armin Biere, Keijo Heljanko, Tommi A. Junttila, Timo Latvala, Viktor Schuppan
Linear Encodings of Bounded LTL Model Checking [Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal]
Effective Bit-Width and Under-Approximation. [Citation Graph (, )][DBLP]
Consistency Checking of All Different Constraints over Bit-Vectors within a SAT Solver. [Citation Graph (, )][DBLP]
Exhaustive Testing of Exception Handlers with Enforcer. [Citation Graph (, )][DBLP]
Advanced Unit Testing: How to Scale up a Unit Test Framework. [Citation Graph (, )][DBLP]
SAT, SMT and Applications. [Citation Graph (, )][DBLP]
Adaptive Restart Strategies for Conflict Driven SAT Solvers. [Citation Graph (, )][DBLP]
Nenofex: Expanding NNF for QBF Solving. [Citation Graph (, )][DBLP]
Minimizing Learned Clauses. [Citation Graph (, )][DBLP]
A Compact Representation for Syntactic Dependencies in QBFs. [Citation Graph (, )][DBLP]
Automated Testing and Debugging of SAT and QBF Solvers. [Citation Graph (, )][DBLP]
Reconstructing Solutions after Blocked Clause Elimination. [Citation Graph (, )][DBLP]
Integrating Dependency Schemes in Search-Based QBF Solvers. [Citation Graph (, )][DBLP]
Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays. [Citation Graph (, )][DBLP]
Blocked Clause Elimination. [Citation Graph (, )][DBLP]
Tutorial on Model Checking: Modelling and Verification in Computer Science. [Citation Graph (, )][DBLP]
Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers. [Citation Graph (, )][DBLP]
Search in 0.094secs, Finished in 0.098secs
|