Sciweavers

923 search results - page 9 / 185
» Proving the value of formal methods
Sort
View
SEFM
2007
IEEE
15 years 6 months ago
Automatically Proving Concurrent Programs Correct
of abstract interpretations in formal methods It is always very satisfying to hear about a theory, in the case at hand it is the theory of abstract interpretations, that explains i...
Byron Cook
ESORICS
2007
Springer
15 years 3 months ago
Efficient Proving for Practical Distributed Access-Control Systems
We present a new technique for generating a formal proof that an access request satisfies accesscontrol policy, for use in logic-based access-control frameworks. Our approach is t...
Lujo Bauer, Scott Garriss, Michael K. Reiter
IFL
2003
Springer
15 years 5 months ago
Correctness of Non-determinism Analyses in a Parallel-Functional Language
The presence of non-determinism in the parallel-functional language Eden creates some problems. Several non-determinism analyses have been developed to determine when an Eden expre...
Clara Segura, Ricardo Pena
QSIC
2003
IEEE
15 years 5 months ago
A Note on Test Oracles and Semantics of Algebraic Specifications
Algebraic testing is an automated software testing method based on algebraic formal specifications. It tests if a program correctly implements an algebraic specification by checki...
Hong Zhu
VMCAI
2010
Springer
15 years 6 months ago
An Analysis of Permutations in Arrays
This paper is concerned with the synthesis of invariants in programs with arrays. More specifically, we consider properties concerning array contents up to a permutation. For inst...
Valentin Perrelle, Nicolas Halbwachs