Abstract
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]. © IFIP International Federation for Information Processing 2008.
Cite
CITATION STYLE
Cousot, P. (2008). The verification grand challenge and abstract interpretation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4171 LNCS, pp. 189–201). https://doi.org/10.1007/978-3-540-69149-5_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
