Analysis of Component-Based Systems – An Automated Theorem Proving Approach

نویسندگان

  • Murali Rangarajan
  • Perry Alexander
چکیده

! " $#% & ')(* +) , & . 0/ 1 +% 2) 3 546 7% 870 & 5 0 9 3 8 + : 20 / % ; & < >= ?6+% & $ 5#0#% @+A ) 5 0 & +) 5 ) 5 & & 8 BC<5 & 52) D E#0 5# & F 2 @+G 6BH2% ) D & I 5 ( % & B> D & J() 6 D F I *< * & 8 6 3 67% < / 5#) % (I + 2) ) 5 0 B> 7% & 5 9 B $46 & +AB> 46 7% & 5 -K) 54C =L M & D M D N M# BO 78 6<5 & 2 6 & < & M 5B & 5=QP) 5 3 $ & & Q & & * (; 5 ) 5 & & R2 ) AB> D @+% 0 &: 2 & +% & +% & 9#0 BO % & A & #% < &7% , +) ,+0 & 5+) & D< * 5B; & 5 5="ST2 8 +) #% % & U46 & +V2) WB> 5 F 5 ) 5 & / & 8 +% 0 &: 2 & 8 +) 8 +) X & + 8 % 5 0 & ,B> & 5 7% & 5 ) ( D: 20 +% & +% & 9 # & 5 &Y 79Z ) 546 & 7% -# D 7 % X B> 4E & $# D #% & =A?6+0 & $#% < % + 5[ & \ W B + 7% & 5 W# #%2% & & VBH ]2 ) 2 @+,B> 5 ^ & F X +) 7% & 5 #% = _H +% & M# # 5( 4^ F70 2% F 5#0#% @+-BO 5 ) 5 & & F B` $#N % /> ) 76B> 5 6BH2% ) & 5 ) 5 L 5 / 82) 9 +) D a#0 5< 1 +% 0 &: 2 =]?6+ $# 5 ) % 5 )7+ *70 & 5 W 5 F # b 7 2 c + *dFe fTg^hi #N b & 5 & 5 ) 52) =C?6+ ; 7% & C & 78 % G : 2% &< 5 & % ; 70 j +) 8fIdFe# b & 5 1 & 5 ) 52) (^ 7W<5 & 2 * D ) #% #N & * * 2 & & W D' 7-BH ] +) * 7% 6 5 )7 + 8#% B> 8 8#0 5B> 8 3 2 & ! 9 *#) 7A2) #N & &YD 7k(C7% ) $ & ! 1 7 (T#% Bl =,mC 20 & 5BL 5#0#% & ) 3 2% @+% % &: 2) * <5 & 52) C 7% c#% % & ; 5 #% 5< &70 D7n(J 7 + o D 20 & F7 & 2) D7n=

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

ثبت نام

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

منابع مشابه

Deriving Safety Cases for Hierarchical Systems in Model-based Development

Model-based development and automated code generation are increasingly used for actual production code, in particular in mathematical and engineering domains. However, since code generators are typically not qualified, there is no guarantee that their output satisfies the system requirements, or is even safe. Here we present an approach to systematically derive safety cases that argue along the...

متن کامل

On Proving Safety Properties by Integrating Static Analysis, Theorem Proving and Abstraction

We present a new approach for proving safety properties of reactive systems, based on tight interaction between static analysis, theorem proving and abstraction techniques. The method incrementally constructs a proof or nds a counterexample. Every step consists of applying one of the techniques and makes constructive use of information obtained from failures in previous steps. The amount of use...

متن کامل

A short introduction to two approaches in formal verification of security protocols: model checking and theorem proving

In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...

متن کامل

Formal Reliability Analysis using Higher-Order Logic Theorem Proving

Formal Reliability Analysis using Higher-Order Logic Theorem Proving Naeem Ahmad Abbasi, Ph. D. Concordia University, 2012 Traditional techniques used in the reliability analysis of engineering systems have limitations. Paper-and-pencil based analysis is prone to human error and simulation based techniques cannot be computationally one hundred percent accurate. An alternative to these two tradi...

متن کامل

How Mathematicians Prove Theorems 1

This paper analyzes how mathematicians prove theorems. The analysis is based upon several empirical sources such as reports of mathematicians and mathematical proofs by analogy. In order to combine the strength of traditional automated theorem provers with human-like capabilities, the questions arise: Which problem solving strategies are appropriate? Which representations have to be employed? A...

متن کامل

Correct and User-Friendly Implementations of Transformation Systems1

We present an approach to integrate several existing tools and methods to a technical framework for correctly developing and executing program transformations. The resulting systems enable program derivations in a user-friendly way. We illustrate the approach by proving and implementing the transformation Global Search on the basis of the tactical theorem prover Isabelle. A graphical user-inter...

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2001