|
|||||
|
|
Mathematical programming: Turing completeness and applications to software analysis |
|
| Authors: | Leo Liberti Fabrizio Marinelli |
| Affiliation: | 1. IBM “T.J.?Watson” Research Center, Yorktown Heights, NY, USA 2. LIX, école Polytechnique, 91128?, Palaiseau, France 3. DII, Università Politecnica delle Marche, Ancona, Italy |
| 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. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |