Name
Abstract | ||
|---|---|---|
The theory of abstract interpretation is a conceptual framework for reasoning about approximation of semantics. We ask if the creative process of designing an approximation can be studied mathematically. Semantic approximations, whether studied in a purely mathematical setting, or implemented in a static analyser, must have a representation. We apply abstract interpretation to syntactic representations and study abstraction of syntax. We show that semantic abstractions and syntactic abstractions are different, and identify criteria for deriving semantic abstractions by purely syntactic means. As a case study, we show that descriptions of numeric abstract domains can be derived by abstraction of syntax. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-35873-9_24 | VERIFICATION, MODEL CHECKING, AND ABSTRACT INTERPRETATION (VMCAI 2013) |
Field | DocType | Volume |
Programming language,Abstraction,Computer science,Abstract interpretation,Abstract syntax tree,Propositional calculus,Theoretical computer science,Abstract syntax,Abstract semantic graph,Syntax,Semantics | Conference | 7737 |
ISSN | Citations | PageRank |
0302-9743 | 1 | 0.36 |
References | Authors | |
18 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vijay D'Silva | 1 | 239 | 14.07 |
| Daniel Kroening | 2 | 3084 | 187.60 |