Author of the publication

A performance-driven QBF-based iterative logic array representation with applications to verification, debug and test.

, , , , and . ICCAD, page 240-245. IEEE Computer Society, (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

PoW-less Bitcoin with Confidential Byzantine PoA., , , , , , and . ICBC, page 1-3. IEEE, (2023)SAT-Based Cooperative Planning: A Proposal., and . Mechanizing Mathematical Reasoning, volume 2605 of Lecture Notes in Computer Science, page 494-513. Springer, (2005)Evaluating QBFs via Symbolic Skolemization.. LPAR, volume 3452 of Lecture Notes in Computer Science, page 285-300. Springer, (2004)Certified Byzantine Consensus with Confidential Quorum for a Bitcoin-derived Permissioned DLT., , , , , , and . DLT, volume 3460 of CEUR Workshop Proceedings, CEUR-WS.org, (2023)Abstract Branching for Quantified Formulas.. AAAI, page 16-21. AAAI Press, (2006)Extracting Certificates from Quantified Boolean Formulas.. IJCAI, page 47-53. Professional Book Center, (2005)Conditional Pure Literal Graphs.. IJCAR, volume 2083 of Lecture Notes in Computer Science, page 331-346. Springer, (2001)Robust QBF Encodings for Sequential Circuits with Applications to Verification, Debug, and Test., , and . IEEE Trans. Computers, 59 (7): 981-994 (2010)Incremental Compilation-to-SAT Procedures., and . SAT, (2004)On the use of Max-SAT and PDDL in RBAC maintenance., and . Cybersecurity, 2 (1): 19 (2019)