Parallel SMT Solving and Concurrent Symbolic Execution
Satisfiability Modulo Theories (SMT) solving is a fundamental tool in numerous areas of computer science, where problems are expressed as logical formulas whose satisfiability has to be decided. State-of-the-art solvers can handle many real-world problems efficiently, however, SMT solving is an NP-h...
Saved in:
Published in: | 2015 IEEE Trustcom/BigDataSE/ISPA Vol. 3; pp. 17 - 26 |
---|---|
Main Authors: | , , , |
Format: | Conference Proceeding |
Language: | English |
Published: |
IEEE
01-08-2015
|
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!