Bit-vector Reasoning

Bit-Vector Reasoning is a formal reasoning technique within Satisfiability Modulo Theories that specifically handles constraints over fixed-size bit vectors using domain-specific inference rules and decision procedures to determine satisfiability.

34

Publications

1.1K

Citations

85

Authors

35

Institutions

Publications per year

2017–2026

11

Authors

85

  1. CR
    Cynthia Rudin

    Duke University, United States

    3 publications · 55 citations

    3

    h-index

  2. DK
    Daniel Kroening

    University of Oxford, United Kingdom

    3 publications · 128 citations

    3

    h-index

  3. CM
    Christoph M. Wintersteiger

    Microsoft Research (United Kingdom), United Kingdom

    3 publications · 111 citations

    3

    h-index

  4. TW
    Tobias Welp

    University of California, Berkeley, United States

    2 publications · 42 citations

    2

    h-index

  5. AN
    Alexander Nadel

    Intel (Israel), Israel

    2 publications · 45 citations

    2

    h-index

1–5 of 85

Venues

  1. Formal Methods in System Design

    4 publications · 152 citations

    4

    h-index

  2. arXiv (Cornell University)

    Repository · 3 publications · 55 citations

    3

    h-index

  3. Proceedings of the AAAI Conference on Artificial Intelligence

    Conference · 2 publications · 56 citations

    2

    h-index

  4. ACM SIGPLAN Notices

    1 publications · 11 citations

    1

    h-index

  5. 1

    h-index

1–5