Name
Abstract | ||
|---|---|---|
In this tutorial we will consider abstract non-interference as a formal model for reasoning about language based security. Abstract non-interference generalises standard non-interference by modelling the information leaked as abstract properties of concrete ... |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/SEFM.2008.30 | SEFM |
Keywords | Field | DocType |
abstract non-interference,compute heap memory bounds,abstract property,standard non-interference,java card applets,fast algorithm,formal model,directed acyclic graph,upper bound,static analysis,java card,java,computational complexity,control flow graph | Programming language,Fibonacci heap,Computer science,Parallel computing,Min-max heap,Algorithm,Heap (data structure),Binary heap,Memory footprint,Binomial heap,d-ary heap,Double-ended priority queue | Conference |
Citations | PageRank | References |
4 | 0.43 | 9 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tuan Pham | 1 | 503 | 73.75 |
| Anh-Hoang Truong | 2 | 26 | 4.98 |
| Ninh-thuan Truong | 3 | 15 | 9.97 |
| Wei-Ngan Chin | 4 | 868 | 63.37 |