On temporal program verification rules
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1985)
- Volume: 19, Issue: 3, page 261-280
- ISSN: 0988-3754
Access Full Article
topHow to cite
topKröger, F.. "On temporal program verification rules." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 19.3 (1985): 261-280. <http://eudml.org/doc/92233>.
@article{Kröger1985,
author = {Kröger, F.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {program verification rules; proof rules; atnext operator},
language = {eng},
number = {3},
pages = {261-280},
publisher = {EDP-Sciences},
title = {On temporal program verification rules},
url = {http://eudml.org/doc/92233},
volume = {19},
year = {1985},
}
TY - JOUR
AU - Kröger, F.
TI - On temporal program verification rules
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1985
PB - EDP-Sciences
VL - 19
IS - 3
SP - 261
EP - 280
LA - eng
KW - program verification rules; proof rules; atnext operator
UR - http://eudml.org/doc/92233
ER -
References
top- 1. F. KRÖGER, Some new aspects of the temporal logic of concurrent programs, Technical University of Munich, Institute of Informatics, Report I8311 (1983).
- 2. F. KRÖGER, A generalized nexttime operator, JCSS 29, 80-98 (1984). Zbl0551.68032MR761053
- 3. Z. MANNA and A. PNUELI, Verification of concurrent programs : The temporal framework, in : The correctness problem in computer science (R. S. Boyer and J. S. Moore, eds.), International Lecture Series in Computer Science, Academic Press, London 1981.
- 4. Z. MANNA and A. PNUELI, Verification of concurrent programs: Temporal proof principles, in : Logics of programs, Proc. 1981, Springer LNCS 131, 200-252 (1981). Zbl0481.68019MR663759
- 5. Z. MANNA and A. PNUELI, Proving precedence properties : The temporal way, in : Proc. 10th ICALP, Springer LNCS 154, 491-512 (1983). Zbl0528.68008MR727678
- 6. G. L. PETERSON, Myths about the mutual exclusion problem, Information Processing Letters 12, 115-116 (1981). Zbl0474.68031
- 7. A. PNUELI, The temporal semantics of concurrent programs, Theor. Comp. Science 13, 45-60 (1981). Zbl0441.68010MR593863
- 8. H. SCHLINGLOFF, Beweistheoretische Untersuchungen zur temporalen Logik, Diploma thesis, Technical University of Munich, Institute of Informatics (1983).
- 9. P. WOLPER, Temporal logic can be more expressive, Proc. 22nd Symp. on Found. of Comp. Sci., Nashville, TN, 340-348 (1981).
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.