A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
SMT Solving for the Theory of Ordering Constraints
[chapter]
2016
Lecture Notes in Computer Science
Constraint solving and satisfiability checking play an important role in various tasks such as formal verification, software analysis and testing. In this paper, we identify a particular kind of constraints called ordering constraints, and study the problem of deciding satisfiability modulo such constraints. The theory of ordering constraints can be regarded as a special case of difference logic, and is essential for many important problems in symbolic analysis of concurrent programs. We
doi:10.1007/978-3-319-29778-1_18
fatcat:opwyt2dqs5c2roccvx2edcjrjm