@article{ITA_1985__19_3_261_0,
author = {Kr\"oger, F.},
title = {On temporal program verification rules},
journal = {RAIRO. Informatique th\'eorique},
pages = {261--280},
year = {1985},
publisher = {EDP Sciences},
volume = {19},
number = {3},
mrnumber = {809759},
zbl = {0563.68007},
language = {en},
url = {https://www.numdam.org/item/ITA_1985__19_3_261_0/}
}
Kröger, F. On temporal program verification rules. RAIRO. Informatique théorique, Tome 19 (1985) no. 3, pp. 261-280. https://www.numdam.org/item/ITA_1985__19_3_261_0/
1. , Some new aspects of the temporal logic of concurrent programs, Technical University of Munich, Institute of Informatics, Report I8311 (1983).
2. , A generalized nexttime operator, JCSS 29, 80-98 (1984). | Zbl | MR
3. and , 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. and , Verification of concurrent programs: Temporal proof principles, in : Logics of programs, Proc. 1981, Springer LNCS 131, 200-252 (1981). | Zbl | MR
5. and , Proving precedence properties : The temporal way, in : Proc. 10th ICALP, Springer LNCS 154, 491-512 (1983). | Zbl | MR
6. , Myths about the mutual exclusion problem, Information Processing Letters 12, 115-116 (1981). | Zbl
7. , The temporal semantics of concurrent programs, Theor. Comp. Science 13, 45-60 (1981). | Zbl | MR
8. , Beweistheoretische Untersuchungen zur temporalen Logik, Diploma thesis, Technical University of Munich, Institute of Informatics (1983).
9. , Temporal logic can be more expressive, Proc. 22nd Symp. on Found. of Comp. Sci., Nashville, TN, 340-348 (1981).





