Mathematical programming: Turing completeness and applications to software analysis

标题
Mathematical programming: Turing completeness and applications to software analysis
作者
关键词
Static analysis, Abstract interpretation, Code verification
出版物
JOURNAL OF COMBINATORIAL OPTIMIZATION
Volume 28, Issue 1, Pages 82-104
出版商
Springer Nature
发表日期
2014-02-17
DOI
10.1007/s10878-014-9715-3

向作者/读者发起求助以获取更多资源

Reprint

联系作者

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started