Inclusion Matching Implementation of Automata Modulo Theory (AMT)

Massacci, Fabio and Siahaan, Ida (2009) Inclusion Matching Implementation of Automata Modulo Theory (AMT). UNSPECIFIED. (Unpublished)

Download (745Kb) | Preview


    The traditional realm of formal methods is the off-line verification of formal properties of hardware and software. In this technical report we describe a different approach that uses formal methods (namely the integration of automata modulo theory with decision procedures) on-the-fly, at the time an application is downloaded on a mobile application such as PDA or a smart phone. We also describe its integration with decision solver based on MathSAT and NuSMV, and the results of our experiments on matching. The idea behind security-by-contract is that a mobile application comes equipped with a signed contract describing the security relevant behavior of the application and such contract should be matched against the mobile platform policy. Both are specified as special kinds of automata and the operation is just an on-the-fly emptiness test over two automata modulo theories where edges are not just finite states of labels but rather expressions that can capture infinite transitions such as "connect only to urls starting with https://".

    Item Type: Departmental Technical Report
    Department or Research center: Information Engineering and Computer Science
    Subjects: Q Science > QA Mathematics > QA075 Electronic computers. Computer science
    Uncontrolled Keywords: Access control, Language-based security, Malicious code, Security and privacy policies
    Report Number: DISI-09-073
    Repository staff approval on: 06 Apr 2010

    Actions (login required)

    View Item