| Title: |
Fast generation of lexicographic satisfiable assignments: enabling canonicity in SAT-based applications |
| Article URLs: |
|
| Alternative Article URLs: |
|
| Authors: |
Ana Petkovska |
-
Ecole Polytechnique Fédérale de Lausanne, School of Computer and Communication Sciences
|
| Alan Mishchenko |
-
University of California - Berkeley, Department of EECS
|
| Mathias Soeken |
-
Ecole Polytechnique Fédérale de Lausanne, School of Computer and Communication Sciences
|
| Giovanni De Micheli |
-
Ecole Polytechnique Fédérale de Lausanne, School of Computer and Communication Sciences
|
| Robert K. Brayton |
-
University of California - Berkeley, Department of EECS
|
| Paolo Ienne |
-
Ecole Polytechnique Fédérale de Lausanne, School of Computer and Communication Sciences
|
| Sharing: |
Unknown
|
| Verification: |
Authors have
not verified
information
|
| Artifact Evaluation Badge: |
none
|
| Artifact URLs: |
|
| Artifact Correspondence Email Addresses: |
|
| NSF Award Numbers: |
unknown
|
| DBLP Key: |
conf/iccad/PetkovskaMSMBI16
|
| Author Comments: |
|