Totality, definability and boolean circuits | Zendy

Antonio Bucciarelli | Zendy; Ivano Salvo | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Totality, definability and boolean circuits

Author(s) -

Antonio Bucciarelli,

Ivano Salvo

Publication year - 1998

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-64781-3

DOI - 10.1007/bfb0055104

Subject(s) - equivalence class (music) , boolean expression , equivalence (formal languages) , boolean function , equivalence relation , class (philosophy) , boolean circuit , computer science , boolean network , discrete mathematics , set (abstract data type) , frame (networking) , two element boolean algebra , function (biology) , boolean domain , theoretical computer science , algorithm , mathematics , algebra over a field , pure mathematics , artificial intelligence , programming language , telecommunications , evolutionary biology , filtered algebra , biology

We present a bottom-up type inference algorithm for security types in Mobile Ambients. The algorithm, given an untyped process $P$, calculates the minimal set of constraints on security levels such that all the actions during a run of $P$ can be performed without violating the security level priorities. Our algorithm appears as a preliminary step in order to use type systems to ensure security properties in the web scenario

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research