TY - GEN
T1 - The verification grand challenge and abstract interpretation
AU - Cousot, Patrick
PY - 2008
Y1 - 2008
N2 - Interpretation is a theory of approximation of mathematical structures, in particular those involved in the semantic models of computer systems [4,10,11]. Abstract interpretation can be applied to the systematic construction of methods and effective algorithms to approximate undecidable or very complex problems in computer science. The scope of application is rather large e.g. from type inference [5], model-checking [13], program transformation [14], watermarking [15] to context-free grammar parser generation [16].
AB - Interpretation is a theory of approximation of mathematical structures, in particular those involved in the semantic models of computer systems [4,10,11]. Abstract interpretation can be applied to the systematic construction of methods and effective algorithms to approximate undecidable or very complex problems in computer science. The scope of application is rather large e.g. from type inference [5], model-checking [13], program transformation [14], watermarking [15] to context-free grammar parser generation [16].
UR - http://www.scopus.com/inward/record.url?scp=84885668074&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84885668074&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-69149-5_21
DO - 10.1007/978-3-540-69149-5_21
M3 - Conference contribution
AN - SCOPUS:84885668074
SN - 9783540691471
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 189
EP - 201
BT - Verified Software
T2 - 1st IFIP TC 2/WG 2.3 Conference on Verified Software: Theories, Tools, Experiments, VSTTE 2005
Y2 - 10 October 2005 through 13 October 2005
ER -