𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Formal verification of concurrent programs using the Larch prover

✍ Scribed by Chetali, B.

Book ID
117872257
Publisher
IEEE
Year
1998
Tongue
English
Weight
240 KB
Volume
24
Category
Article
ISSN
0098-5589

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Formal verification of tail distribution
Formal verification of tail distribution bounds in the HOL theorem prover
✍ Osman Hasan; SofiΓ¨ne Tahar πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 181 KB

## Abstract Tail distribution bounds play a major role in the estimation of failure probabilities in performance and reliability analysis of systems. They are usually estimated using Markov's and Chebyshev's inequalities, which represent tail distribution bounds for a random variable in terms of it

[Lecture Notes in Computer Science] Form
[Lecture Notes in Computer Science] Formal Methods and Software Engineering Volume 3308 || Multi-prover Verification of C Programs
✍ Davies, Jim; Schulte, Wolfram; Barnett, Mike πŸ“‚ Article πŸ“… 2004 πŸ› Springer Berlin Heidelberg 🌐 German βš– 230 KB

Formal Engineering Methods Are Changing The Way That Software Systems Are - Veloped.withlanguageandtoolsupport,theyarebeingusedforautomaticcode Generation, And For The Automatic Abstraction And Checking Of Implementations. In The Future, They Will Be Used At Every Stage Of Development: Requirements,

Accommodating interference in the formal
Accommodating interference in the formal design of concurrent object-based programs
✍ C. B. Jones πŸ“‚ Article πŸ“… 1996 πŸ› Springer 🌐 English βš– 903 KB

This paper is about formal development methods for concurrent programs. Interference is the bane of the quest for compositional methods for concurrency. Concepts from object-orientod languages are argued to be a promising way of taming interference. Two approaches to development are described which