FLAVERS: A finite state verification technique for software systems

نویسندگان
چکیده

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

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

منابع مشابه

FLAVERS: A finite state verification technique for software systems

Software systems are increasing in size and complexity and, subsequently, are becoming ever more difficult to validate. Finite state verification (FSV) has been gaining credibility and attention as an alternative to testing and to formal verification approaches based on theorem proving. There has recently been a great deal of excitement about the potential for FSV approaches to prove properties...

متن کامل

Verification tools for finite-state concurrent systems

K e y w o r d s : automatic verification, temporal logic, model checking, binary decision diagrams

متن کامل

Comparing Finite-State Verification Techniques for Concurrent Software

Finite-state verification provides software developers with a powerful tool to detect errors. Many different analysis techniques have been proposed and implemented, and the limited amount of empirical data available shows that the performance of these techniques varies enormously from system to system. Before this technology can be transferred from research to practice, the community must provi...

متن کامل

Automatic Verification of Finite-State Concurrent Systems

School of Computer Science Carnegie Mellon University Pittsburgh, Pennsylvania 15213-3891, USA e-mail [email protected] Logical errors in finite-state concurrent systems such as sequential circuit designs and communication protocols are an important problem for computer scientists. They can delay getting a new product on the market or cause the failure of some critical device that is already in us...

متن کامل

Shallow Finite State Verification

We consider the problem of verifying finite state properties of shallow programs; i.e., programs where pointers from program variables to heap-allocated objects are allowed, but where heap-allocated objects may not themselves contain pointers. We prove a number of results relating the complexity of such verification problems to the nature of the finite state machine used to specify the property...

متن کامل

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


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

ژورنال

عنوان ژورنال: IBM Systems Journal

سال: 2002

ISSN: 0018-8670

DOI: 10.1147/sj.411.0140