Simulation Matching Implementation of Automata Modulo Theory (AMT)

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

[img]
Preview
 PDF
Download (817Kb) | Preview

    Abstract

    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 using fair simulation for matching and adapts the Jurdzinski's algorithm on parity games. The simulation algorithm takes as input two automata representing respectively the formal specification of a contract and of a policy. A match is obtained when every security-relevant action invoked by contract can also be invoked by AutP. In other words, every behavior of AutC is also a behavior of AutP. In this paper we thoroughly describe contract-policy matching using simulation, a prototype made on .NET for Desktop PC and give some experimental results.

    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: Formal Specification, Mobile Code, Language-based security, Malicious code, Security and privacy policies
    Report Number: DISI-09-074
    Repository staff approval on: 06 Apr 2010

    Actions (login required)

    		 View Item