Armin Biere (source code)

= Armin Biere
{c}

<Armin Biere> coauthored <Symbolic Model Checking without BDDs by Armin Biere and others>, which introduced a <bounded model checking> procedure for <linear temporal logic> using <Boolean satisfiability>. The method encodes a finite sequence of <finite-state machine> transitions as a <propositional formula>; a satisfying assignment can describe a path violating a requested property. The paper demonstrates how <SAT> solving can replace <binary decision diagrams> in this verification task.<Symbolic Model Checking without BDDs by Armin Biere and others>[abstract and §§2–4]{ref}