Massacci, Fabio and Siahaan, Ida (2009) Simulation Matching Implementation of Automata Modulo Theory (AMT). UNSPECIFIED. (Unpublished)
The traditional realm of formal methods is the oﬀ-line veriﬁcation 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 speciﬁcation 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.
Actions (login required)