A proof method for the correctness of modularized 0CFA (Q1603499): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A cost-effective estimation of uncaught exceptions in Standard ML programs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Co-induction in relational semantics / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:47, 4 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A proof method for the correctness of modularized 0CFA |
scientific article |
Statements
A proof method for the correctness of modularized 0CFA (English)
0 references
14 July 2002
0 references
control-flow analysis
0 references
functional languages
0 references
separate compilation
0 references
static analysis
0 references
formal semantics
0 references
