๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Correctness verification of real-time programs

โœ Scribed by T Szmuc


Publisher
Elsevier Science
Year
1988
Weight
754 KB
Volume
14
Category
Article
ISSN
0066-4138

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Correctness proofs of CSP programs
โœ N. Soundararajan ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 948 KB
Real-Time Systems || Verification Using
โœ Cheng, Albert M. K. ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley & Sons, Inc. โš– 192 KB ๐Ÿ‘ 2 views

Finite automata and temporal logics have been used extensively to formally verify qualitative properties of concurrent systems. The properties include deadlock-or livelock-freedom, the eventual occurrence of an event, and the satisfaction of a predicate. The need to reason with absolute time is unne