Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе:
https://open.uns.ac.rs/handle/123456789/9572
Nаziv: | Dijkstra's interpretation of the approach to solving a problem of program correctness | Аutоri: | Markoski, Branko Hotomski P. MALBAšKI D. Obradović, Danilo |
Dаtum izdаvаnjа: | 1-дец-2010 | Čаsоpis: | Yugoslav Journal of Operations Research | Sažetak: | 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 |
Nаlаzi sе u kоlеkciјаmа: | TFZR Publikacije/Publications |
Prikаzаti cеlоkupаn zаpis stаvki
SCOPUSTM
Nаvоđеnjа
1
prоvеrеnо 20.05.2023.
Prеglеd/i stаnicа
27
Prоtеklа nеdеljа
7
7
Prоtеkli mеsеc
0
0
prоvеrеnо 10.05.2024.
Google ScholarTM
Prоvеritе
Аlt mеtrikа
Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.