Weakest precondition semantics for time and concurrency
| Autor: | H. S. M. Zedan, David Scholefield |
|---|---|
| Rok vydání: | 1992 |
| Předmět: |
Programming language
Computer science Concurrency computer.software_genre Computer Science Applications Theoretical Computer Science Precondition Predicate transformer semantics TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Refinement calculus TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS Signal Processing Real-time operating system computer Information Systems |
| Zdroj: | Information Processing Letters. 43:301-308 |
| ISSN: | 0020-0190 |
| DOI: | 10.1016/0020-0190(92)90116-d |
| Popis: | A weakest precondition semantics for a real-time concurrent language is defined. An example in verification is presented, and the use of predicate transformers as the basis of a refinement calculus is also discussed. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|