R.R.Hansen, J.G.Jensen: Flow Logics for Mobile Ambients. M.Sc.-thesis, 1999. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Validating Firewalls in Mobile Ambients - Nielson, Nielson, Hansen, Jensen (1999) (27 citations) Self-citation (Hansen) (Correct)
....l mg, f(I ; H; M) j (I ; H) j me M : Mg are Moore families and then proceeds by structural induction. ut By restricting the attention to a given program n l [P ] of size s one can devise an O(s 5 ) algorithm for computing the least solution. Roughly the idea is as follows [7]. There are O(s) places where conditions needs to be checked. Each condition can have length O(s 3 ) because there are at most three nested quanti ers each ranging over O(s) entities. Hence at most O(s 4 ) basic conditions need to be checked. Since the height of each set of values is O(s) this ....
R.R.Hansen, J.G.Jensen: Flow Logics for Mobile Ambients. M.Sc.-thesis, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC