Name
Abstract | ||
|---|---|---|
State-OK (s ) -> Int (s , n) = Map (Int (Map (s ), k)).A A A C AFigure 1 illustrates this theorem. The theorem says that given an initial legal abstract state s as defined byA-1Abstract-State-OK, and time n, there exists a time k such that Map of the concrete interpreter result is identicalto the final state reached by the abstract interpreter. The theorem form is slightly more complex when aninterpreter which requires an oracle argument is under consideration. We refer back to... |
Year | DOI | Venue |
|---|---|---|
1987 | 10.1109/SP.1987.10018 | IEEE Symposium on Security and Privacy |
Keywords | Field | DocType |
hardware,assembly,concrete,finite element methods,operating systems | Computer science,Compiler,Software,Operating system,Embedded system | Conference |
ISSN | ISBN | Citations |
1540-7993 | 0-8186-0771-8 | 11 |
PageRank | References | Authors |
5.33 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| William R. Bevier | 1 | 118 | 21.65 |
| Warren A. Hunt, Jr. | 2 | 520 | 59.18 |
| William D. Young | 3 | 331 | 66.64 |