Abstract
We examine the problem of automatically extracting a static semantics from a language's semantic definition. Traditional approaches require manual construction of static and dynamic semantics, followed by a proof that the two are consistent. As languages become more complex, the static analyses also become more complex, and consistency proofs have typically been challenging. We need to find techniques for automatically constructing static analyses that are provably correct.
Original language | English (US) |
---|---|
Pages (from-to) | 162-173 |
Number of pages | 12 |
Journal | Electronic Notes in Theoretical Computer Science |
Volume | 45 |
DOIs | |
State | Published - Nov 2001 |
Event | MFPS 2001, Seventeenth Conference on the Mathematical Foundations of Programming Semantics - Aarhus, Denmark Duration: May 23 2001 → May 26 2001 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- General Computer Science