Archer, M, TAME: Using PVS strategies for special-purpose theorem proving, Annals of Mathematics and Artificial Intelligence 29 (2000), 139--181.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....most realistic system model will be one in which time is treated as a continuous variable. Timed automata [AD94] might therefore be a suitable model; these can be encoded in PVS [ORSvH95] and formally verified by hand or with the aid of specialized libraries and strategies such as those of TAME [Arc00] or we could use a model checker for timed automata such as Kronos [BDM 98] or UP PAAL [LPY97] or an experimental encoding in SAL ICS [dMRS] Lonn [Lon99a,Lon99b] considers startup algorithms for TDMA systems similar to TTA and verifies one of them using UPPAAL [LP97] Lon99b, Chapter 9] ....

Myla Archer. TAME: Using PVS strategies for special-purpose theorem proving. Annals of Mathematics and Artificial Intelligence, 29(1--4):139--181, 2000.

....for specifying the required behavior of software systems. The SCR toolset provides a user friendly interface for writing requirements specifications in a tabular format and a number of analysis tools, including a consistency checker [18] a simulator [17] a model checker [16] a theorem prover [2], and an invariant generator [21, 24] In the toolset, the specification is displayed as a collection of tables. A context free grammar is the underlying communication medium for the different tools. By applying the SCR tools, a user can develop high confidence that a specification is a correct ....

Archer, M.: 2001, `TAME: Using PVS Strategies for Special-Purpose Theorem Proving'. Annals of Mathematics and Artificial Intelligence 29(1-4).

No context found.

M. Archer. TAME: Using PVS strategies for specialpurpose theorem proving. Annals of Mathematics and Artificial Intelligence, 29(1-4):139--181, 2000.

....a policy essentially by browsing the policy. For analyzing a policy for deep properties, more powerful tools are needed. To answer this need, we have taken some initial steps to develop tool support for analyzing SE Linux security policies using the tool TAME (Timed Automata Modeling Environment) [2, 3]. These steps include 1) creation of an abstract SE Linux model in TAME with policy independent and policy dependent parts, 2) design and implementation of algorithms for extracting a) a subset of a specified security policy on which to focus analysis and b) the policy dependent parts of the model ....

M. Archer. TAME: Using PVS strategies for specialpurpose theorem proving. Annals of Math. and Artif. Intel., 29(1-4):139--181, 2000.

....the security goals, eliminated programs could be reintroduced and the resulting policy analyzed. Some portions of the example policy, such as that associated with booting and initializing the system, could be independently analyzed. 7. Analyzing the State Machine Model of a Policy with TAME TAME [4,1] is an interface to PVS designed to simplify the specification of automata models and proofs of automata properties, especially invariant properties. To specify an automaton, the user fills in the TAME template, providing the information shown in Figure 1. Auxiliary definitions are also usually ....

M. Archer. TAME: Using PVS strategies for special-purpose theorem proving. Annals of Mathematics and Artificial Intelligence, 29(1-4):139--181, 2000.

....involve nonlinear real arithmetic, for which there are no decision procedures. Reference [13] describes the basic TESLA protocol and several increasingly sophisticated variants. This paper reports on a mechanically checked proof of the correctness of the basic TESLA protocol using the tool TAME [3,2]. TAME is an interface to PVS that simplifies specifying and proving properties of automata. The basic TESLA correctness proof is based on the method demonstrated in [6] 1) model the system being studied as a Lynch Vaandrager (LV) timed automaton [9] 2) express any desired system property as a ....

....the key committed to in p1, p1 can be authenticated, and ArrT i T i 1 , where ArrT i is the receive time of the i th packet p and T i 1 is the (earliest possible) send time of the (i 1) st packet p2, as measured on the receiver s clock. 3. Reasoning about LV Timed Automata in TAME TAME [3,2] is an interface to PVS [14] that simplifies specifying and proving properties of automata. To make it simpler to specify automata, TAME provides specification templates for various classes of automata, including LV timed automata. To make it simpler to prove properties of automata, TAME provides ....

M. Archer. TAME: Using PVS strategies for special-purpose theorem proving. Annals of Mathematics and Artificial Intelligence, 29(1-4), 2000.

No context found.

Archer, M, TAME: Using PVS strategies for special-purpose theorem proving, Annals of Mathematics and Artificial Intelligence 29 (2000), 139--181.

No context found.

M. Archer. TAME: Using PVS strategies for special-purpose theorem proving. Annals of Mathematics and Artificial Intelligence, 29(1-4), February 2001.

No context found.

Myla Archer. TAME: Using PVS strategies for special-purpose theorem proving. Annals of Mathematics and Artificial Intelligence,29&&9 2000.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC