Automata modulo Theory ( Amt )

نویسندگان

  • Fabio Massacci
  • Ida Siahaan
چکیده

With the advent of the next generation java servlet on the smartcard, the Future Internet will be composed by web servers and clients silently yet busily running on high end smart cards in our phones and our wallets. In this new world model we can no longer accept the current security model where programs can be downloaded on our machines just because they are vaguely “trusted”. We want to know what they do in more precise details. We claim that the Future Internet needs the notion of security-by-contract : a contract describes the security relevant interactions that an application could have with the smart devices hosting them. Compliance with contracts should verified at development time, checked at deployment time and contracts should be accepted by the platform before deployment and possibly their enforcement guaranteed, for instance by in-line monitoring. In this technical report we provide a formal model and an algorithm for matching the claims on the security behavior of a midlet (for short contract) with the desired security behavior of a platform (for short policy) on a security-by-contract framework for realistic security scenarios.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Matching Midlet's Security Claims with a Platform Security Policy using Automata Modulo Theory

Model-carrying code and security-by-contract have proposed to augment mobile code with a claim on its security behavior that could be matched against a mobile platform policy before downloading the code. In this paper we show that it is possible to de ne very expressive policies | essentially with in nite cases | that can capture realistic scenarios (e.g. "only connections to urls starting with...

متن کامل

Testing Decision Procedures for Security - by - Contract : Extended

The traditional realm of formal methods is off-line verification of formal properties of hardware and software. We report 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. The idea behind security-by-contract is that a...

متن کامل

Representing hybrid automata by action language modulo theories

Both hybrid automata and action languages are formalisms for describing the evolution of dynamic systems. This paper establishes a formal relationship between them. We show how to succinctly represent hybrid automata in an action language which in turn is defined as a high-level notation for answer set programming modulo theories (ASPMT) — an extension of answer set programs to the first-order ...

متن کامل

F . Jacquemard , M . Rusinowitch and L . Vigneron Tree automata with equality constraints modulo equational theories Research Report LSV - 05 - 16 August 2005

This paper presents new classes of tree automata combining automata with equality test with automata modulo equational theories. These tree automata are obtained by extending their standard Horn clause representations with equational conditions and monadic rewrite systems. We show in particular that the general membership problem is decidable by proving that the saturation of tree automata pres...

متن کامل

Tree Automata with Equality Constraints Modulo Equational Theories

This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that this class has a good potential for application in e.g. software verification. These tree automata are obtained by extending the standard Horn clause representations with equational conditions and rewrite systems. We show in particular that a generalize...

متن کامل

Stochastic Satisfiability Modulo Theory: A Novel Technique for the Analysis of Probabilistic Hybrid Systems

The analysis of hybrid systems exhibiting probabilistic behaviour is notoriously difficult. To enable mechanised analysis of such systems, we extend the reasoning power of arithmetic satisfiability-modulo-theory solving (SMT) by a comprehensive treatment of randomized (a.k.a. stochastic) quantification over discrete variables within the mixed Boolean-arithmetic constraint system. This provides ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010