Coupling reverse engineering and SAT to tackle NP-complete arithmetic circuitry verification in ∼O(# of gates).
Yi DiaoXing WeiTak-Kei LamYu-Liang WuPublished in: ASP-DAC (2016)
Keyphrases
- reverse engineering
- np complete
- satisfiability problem
- sat problem
- np complete problems
- phase transition
- software engineering
- np hard
- randomly generated
- object oriented
- gene regulatory networks
- program understanding
- dynamic analysis
- software maintenance
- model checking
- max sat
- boolean formula
- cnf formula
- conceptual schema
- constraint satisfaction problems
- reverse engineer
- business rules
- computational complexity
- software evolution
- temporal logic
- legacy systems
- search algorithm
- formal verification
- software engineers
- constraint satisfaction
- class diagrams
- polynomial time complexity
- artificial intelligence
- legacy software systems