Deductive software verification

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

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

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

منابع مشابه

Deductive Software Verification

Deductive Software Verification is characterized by three ingredients: first, target programs as well as the properties to be verified are represented as logical formulae that must be proven to be valid; second, validity is proven by deduction in a logic calculus; third, computer assistance is used for proof search and bookkeeping. In contrast to static analysis and model checking it is possibl...

متن کامل

A Deductive Verification Platform for Cryptographic Software

In this paper we describe a deductive verification platform for the CAO language. CAO is a domain-specific language for cryptography. We show that this language presents interesting challenges for formal verification, not only in the rich mathematical type system that it introduces, but also in the cryptography-oriented language constructions that it offers. We describe how we tackle these prob...

متن کامل

Deductive Verification

Clocked transition systems is a computational model for modelling real-time systems. Using this model we are able to use deductive verification for proving properties over our systems.

متن کامل

Automatic Error Localization for Software Using Deductive Verification

Even competent programmers make mistakes. Automatic verification can detect errors, but leaves the frustrating task of finding the erroneous line of code to the user. This paper presents an automatic approach for identifying potential error locations in software. It is based on a deductive verification engine, which detects errors in functions annotated with preand post-conditions. Using an aut...

متن کامل

Deductive Schedulability Verification Methodology of Real-Time Software using both Refinement Verification and Hybrid Automata

Real-time software runs over real-time operating systems, and guaranteeing qualities is difficult. As timing constraints and resource allocations are strict, it is necessary to verify schedulability, safety and liveness properties. In this paper, we formally specify real-time software using hybrid automata and verify its schedulability using both deductive refinement theory and scheduling theor...

متن کامل

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


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

ژورنال

عنوان ژورنال: International Journal on Software Tools for Technology Transfer

سال: 2011

ISSN: 1433-2779,1433-2787

DOI: 10.1007/s10009-011-0211-0