Name
Abstract | ||
|---|---|---|
A computing policy is a sequence of rules, where each rule consists of a predicate and an action, which can be either "accept" or "reject". A policy P is said to accept (or reject, respectively) a request iff the action of the first rule in P, whose predicate matches the request, is "accept" (or "reject", respectively). An accept (or reject, respectively) property of a policy P is a set of requests that should be accepted (or rejected, respectively) by P. Policy P is said to satisfy an accept (or reject, respectively) property pp iff every request that is specified by property pp is accepted (or rejected, respectively) by policy P. In this paper, we outline efficient methods for verifying whether any given policy P satisfies any given property pp, provided that policy P results from changing only one rule in another policy that is known to satisfy property pp. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-319-11764-5_16 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
Computing Policies,Access Control Policies,Routing Policies,Firewall Policies,Packet Classifiers,Logical Analysis,Incremental Verification,NP-hard | Mathematical economics,Computer science,Predicate (grammar),Logical analysis | Conference |
Volume | ISSN | Citations |
8756 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 9 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ehab S. Elmallah | 1 | 105 | 19.29 |
| Hrishikesh B. Acharya | 2 | 56 | 9.09 |
| Mohamed G. Gouda | 3 | 1982 | 317.23 |