The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Armin Biere: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. 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]
  4. Armin Biere
    µcke - Efficient µ-Calculus Model Checking. [Citation Graph (0, 0)][DBLP]
    CAV, 1997, pp:468-471 [Conf]
  5. 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]
  6. 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]
  7. 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]
  8. Carsten Sinz, Armin Biere
    Extended Resolution Proofs for Conjoining BDDs. [Citation Graph (0, 0)][DBLP]
    CSR, 2006, pp:600-611 [Conf]
  9. 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]
  10. Cyrille Artho, Armin Biere, Shinichi Honiden
    Enforcer - Efficient Failure Injection. [Citation Graph (0, 0)][DBLP]
    FM, 2006, pp:412-427 [Conf]
  11. 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]
  12. 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]
  13. 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]
  14. Armin Biere, Wolfgang Kunz
    SAT and ATPG: Boolean engines for formal hardware verification. [Citation Graph (0, 0)][DBLP]
    ICCAD, 2002, pp:782-785 [Conf]
  15. Cyrille Artho, Klaus Havelund, Armin Biere
    High-Level Data Races. [Citation Graph (0, 0)][DBLP]
    NDDL/VVEIS, 2003, pp:82-93 [Conf]
  16. Armin Biere
    Resolve and Expand. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  17. Armin Biere
    Resolve and Expand. [Citation Graph (0, 0)][DBLP]
    SAT (Selected Papers, 2004, pp:59-70 [Conf]
  18. 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]
  19. 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]
  20. Malek Haroud, Armin Biere
    SDL Versus C Equivalence Checking. [Citation Graph (0, 0)][DBLP]
    SDL Forum, 2005, pp:323-338 [Conf]
  21. 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]
  22. 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]
  23. 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]
  24. 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]
  25. 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]
  26. 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]
  27. 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]
  28. 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]
  29. 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]
  30. 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]
  31. Armin Biere, Ofer Strichman
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:119, n:2, pp:1-0 [Journal]
  32. Armin Biere, Ofer Strichman
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:144, n:1, pp:1-0 [Journal]
  33. 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]
  34. 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]
  35. Ofer Strichman, Armin Biere
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:174, n:3, pp:1-2 [Journal]
  36. 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]
  37. 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]
  38. 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]
  39. 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]
  40. Armin Biere, Ofer Strichman
    Introductory paper. [Citation Graph (0, 0)][DBLP]
    STTT, 2005, v:7, n:2, pp:87-88 [Journal]
  41. 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]
  42. 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]
  43. 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]
  44. Robert Brummayer, Armin Biere
    C32SAT: Checking C Expressions. [Citation Graph (0, 0)][DBLP]
    CAV, 2007, pp:294-297 [Conf]
  45. 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]
  46. 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]
  47. 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]

  48. Effective Bit-Width and Under-Approximation. [Citation Graph (, )][DBLP]


  49. Consistency Checking of All Different Constraints over Bit-Vectors within a SAT Solver. [Citation Graph (, )][DBLP]


  50. Exhaustive Testing of Exception Handlers with Enforcer. [Citation Graph (, )][DBLP]


  51. Advanced Unit Testing: How to Scale up a Unit Test Framework. [Citation Graph (, )][DBLP]


  52. SAT, SMT and Applications. [Citation Graph (, )][DBLP]


  53. Adaptive Restart Strategies for Conflict Driven SAT Solvers. [Citation Graph (, )][DBLP]


  54. Nenofex: Expanding NNF for QBF Solving. [Citation Graph (, )][DBLP]


  55. Minimizing Learned Clauses. [Citation Graph (, )][DBLP]


  56. A Compact Representation for Syntactic Dependencies in QBFs. [Citation Graph (, )][DBLP]


  57. Automated Testing and Debugging of SAT and QBF Solvers. [Citation Graph (, )][DBLP]


  58. Reconstructing Solutions after Blocked Clause Elimination. [Citation Graph (, )][DBLP]


  59. Integrating Dependency Schemes in Search-Based QBF Solvers. [Citation Graph (, )][DBLP]


  60. Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays. [Citation Graph (, )][DBLP]


  61. Blocked Clause Elimination. [Citation Graph (, )][DBLP]


  62. Tutorial on Model Checking: Modelling and Verification in Computer Science. [Citation Graph (, )][DBLP]


  63. Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers. [Citation Graph (, )][DBLP]


Search in 0.011secs, Finished in 0.015secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002