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/15319
Nаziv: | Resolution methods in proving the program correctness | Аutоri: | Markoski, Branko Hotomski P. Malbaški D. Obradović, D |
Dаtum izdаvаnjа: | 1-јан-2007 | Čаsоpis: | Yugoslav Journal of Operations Research | Sažetak: | Program testing determines whether its behavior matches the specification, and also how it behaves in different exploitation conditions. Proving of program correctness is reduced to finding a proof for assertion that given sequence of formulas represents derivation within a formal theory of special predicted calculus. A well-known variant of this conception is described: correctness based on programming logic rules. It is shown that programming logic rules may be used in automatic resolution procedure. Illustrative examples are given, realized in prolog-like LP-language (with no restrictions to Horn's clauses and without the final failure). Basic information on LP-language are also given. It has been shown how a Pascal-program is being executed in LP-system proffer. | URI: | https://open.uns.ac.rs/handle/123456789/15319 | ISSN: | 3540243 | DOI: | 10.2298/YJOR0702275M |
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о 06.05.2023.
Prеglеd/i stаnicа
26
Prоtеklа nеdеljа
12
12
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.