Abstract
Mathematical programming is Turing complete, and can be used as a general-purpose declarative language. We present a new constructive proof of this fact, and showcase its usefulness by discussing an application to finding the hardest input of any given program running on a Minsky Register Machine. We also discuss an application of mathematical programming to software verification obtained by relaxing one of the properties of Turing complete languages.
| Original language | English |
|---|---|
| Pages (from-to) | 82-104 |
| Number of pages | 23 |
| Journal | Journal of Combinatorial Optimization |
| Volume | 28 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 1 Jan 2014 |
Keywords
- Abstract interpretation
- Code verification
- Static analysis