Sciweavers

641 search results - page 48 / 129
» Formal Reliability Analysis Using Theorem Proving
Sort
View
POPL
2007
ACM
16 years 2 months ago
Variance analyses from invariance analyses
An invariance assertion for a program location is a statement that always holds at during execution of the program. Program invariance analyses infer invariance assertions that ca...
Josh Berdine, Aziem Chawdhary, Byron Cook, Dino Di...
CSFW
1999
IEEE
15 years 6 months ago
A Meta-Notation for Protocol Analysis
Most formal approaches to security protocol analysis are based on a set of assumptions commonly referred to as the "Dolev-Yao model." In this paper, we use a multiset re...
Iliano Cervesato, Nancy A. Durgin, Patrick Lincoln...
ISTA
2004
15 years 3 months ago
Evidential Paradigm and Intelligent Mathematical Text Processing
Abstract: This paper presents the evidential paradigm of computer-supported mathematical assistance in "doing" mathematics and in reasoning activity. At present, the evid...
Alexander V. Lyaletski, Anatoly E. Doroshenko, And...
DGCI
2003
Springer
15 years 7 months ago
Shape Preserving Digitization of Ideal and Blurred Binary Images
In order to make image analysis methods more reliable it is important to analyse to what extend shape information is preserved during image digitization. Most existing approaches t...
Ullrich Köthe, Peer Stelldinger
JUCS
2008
166views more  JUCS 2008»
15 years 2 months ago
ASM Refinement Preserving Invariants
: This paper gives a definition of ASM refinement suitable for the verification that a protocol implements atomic transactions. We used this definition as the basis of the formal v...
Gerhard Schellhorn