Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/9572
Title: | Dijkstra's interpretation of the approach to solving a problem of program correctness | Authors: | Markoski, Branko Hotomski P. MALBAšKI D. Obradović, Danilo |
Issue Date: | 1-Dec-2010 | Journal: | Yugoslav Journal of Operations Research | Abstract: | Proving the program correctness and designing the correct programs are two connected theoretical problems, which are ofgreat practical importance. The first is solved within program analysis, and the second one in program synthesis, although intertwining of these two processes is often due to connection between the analysis and synthesis of programs. Nevertheless, having in mind the automated methods of proving correctness and methods of automatic program synthesis, the difference is easy to tell. This paper presents denotative interpretation of programming calculation explaining semantics by formulae φand ψ, in such a way that they canbe used for defining state sets for program P. | URI: | https://open.uns.ac.rs/handle/123456789/9572 | ISSN: | 3540243 | DOI: | 10.2298/YJOR1002229M |
Appears in Collections: | TFZR Publikacije/Publications |
Show full item record
SCOPUSTM
Citations
1
checked on May 20, 2023
Page view(s)
27
Last Week
7
7
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.