Sciweavers

3552 search results - page 99 / 711
» Proof theory in the abstract
Sort
View
CG
2008
Springer
15 years 8 months ago
About the Completeness of Depth-First Proof-Number Search
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
Akihiro Kishimoto, Martin Müller 0003
ICFEM
2004
Springer
15 years 11 months ago
Verifying a File System Implementation
Abstract. We present a correctness proof for a basic file system implementation. This implementation contains key elements of standard Unix file systems such as inodes and fixed...
Konstantine Arkoudas, Karen Zee, Viktor Kuncak, Ma...
ICFEM
2003
Springer
15 years 11 months ago
Formal Proof of a Polychronous Protocol for Loosely Time-Triggered Architectures
The verification of safety critical systems has become an area of increasing importance in computer science. The notion of reactive system has emerged to concentrate on problems r...
Mickaël Kerboeuf, David Nowak, Jean-Pierre Ta...
APSEC
2008
IEEE
16 years 24 days ago
Using Abstraction to Verify Arbitrary Temporal Properties
straction to Verify Arbitrary Temporal Properties Amir Pnueli New York University and Weizmann Institute of Sciences (Emeritus) Perspectives in Concurrency Theory, Chennai, 15 Dece...
Amir Pnueli
POPL
2007
ACM
16 years 6 months ago
Program verification as probabilistic inference
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
Sumit Gulwani, Nebojsa Jojic