| Authors: |
Cook, Byron, bycook@microsoft.com, Sebastiani, Roberto1, roberto.sebastiani@dit.unitn.it, Büning, Hans Kleine2, kbcsl@upb.de, Barrett, Clark3, barrett@cs.nyu.edu, Shikanian, Igor3, igor@cs.nyu.edu, Tinelli, Cesare4, tinelli@cs.uiowa.edu, Kim, Hyondeuk5, hyondeuk.kim@colorado.edu, Jin, Hoonsang5, hoonsang.jin@samsung.com, Somenzi, Fabio5, fabio@colorado.edu, Seshia, Sanjit A.6, sseshia@eecs.berkeley.edu, Subramani, K.7, ksmani@csee.wvu.edu, Bryant, Randal E.8, randy.bryant@cs.cmu.edu, Ganai, Malay K.9, malay@nec-labs.com, Talupur, Muralidhar10, tmurali@cs.cmu.edu, Gupta, Aarti9, agupta@nec-labs.com, Zhao, Xishun11 |
| Source: |
Journal on Satisfiability, Boolean Modeling & Computation; 2007, Vol. 3, preceding p1-123, 137p, 10 Diagrams, 9 Charts, 13 Graphs |
