Author:
Konikowska Beata,Tarlecki Andrzej,Blikle Andrzej
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Simple consequence relations. Report ECS-LFCS-87-30, Laboratory for Foundations of Computer Science, University of Edinburgh, June 1987.
2. Barringer, H., Cheng, J.H., Jones, C.B. A logic covering undefinedness in program proofs. Acta Informatica 21(1984), 251–269.
3. Beth, E.W. The Foundations of Mathematics. North-Holland 1959.
4. Blikle, A. On the development of correct specified programs. IEEE Transactions on Software Engineering SE-7 (1981), 251–169.
5. Blikle, A. The clean termination of iterative programs. Acta Informatica 16(1981), 199–217.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Runtime Annotation Checking with Frama-C: The E-ACSL Plug-in;Computer Science Foundations and Applied Logic;2024
2. The e-ACSL perspective on runtime assertion checking;Proceedings of the 5th ACM International Workshop on Verification and mOnitoring at Runtime EXecution;2021-07-11
3. A Semantic Analysis of Logics That Cope with Partial Terms;Abstract State Machines, Alloy, B, VDM, and Z;2012
4. Well defined B;Lecture Notes in Computer Science;1998
5. A typed logic of partial functions reconstructed classically;Acta Informatica;1994-05