|
Browse All Reviews > Theory Of Computation (F) > Logics And Meanings Of Programs (F.3) > Specifying And Verifying And Reasoning About Programs (F.3.1) > Invariants (F.3.1...)
|
|
|
|
|
|
|
|
|
1-4 of 4
Reviews about "Invariants (F.3.1...)":
|
Date Reviewed |
|
Variant construction from theoretical foundation to applications Zheng J., Springer International Publishing, New York, NY, 2019. 409 pp. Type: Book
This book is a collection of chapters authored primarily by Jeffrey Zheng, who is also the editor. The preface lays out a broad roadmap for expanding vector 0-1 logical systems, highlighting the areas of variant logic, variant measurem...
|
Nov 11 2019 |
|
On the mechanical derivation of loop invariants Chadha R., Plaisted D. Journal of Symbolic Computation 15(5-6): 705-744, 1993. Type: Article
A method for automatically deriving loop invariants for loops in a flowchart program for the purpose of proving the partial correctness of the program is described. In fact, the authors present a method for deriving logical consequence...
|
Mar 1 1995 |
|
Sometime=always+recursionalways on the equivalence of the intermittent and invariant assertions methods for proving properties of programs Cousot P., Cousot R. Acta Informatica 24(1): 1-31, 1987. Type: Article
This paper compares two verification methods for inevitability properties of nondeterministic transition systems, the “always” method and the “sometime” method. These methods are abstractions of ...
|
Nov 1 1988 |
|
Strongest invariant functions: their use in the systematic analysis of while statements Mili A. (ed), Desharnais J., Gagné J. Acta Informatica 22(1): 47-66, 1985. Type: Article
This paper deals with the notion of invariant functions; these are functions that remain unchanged under applications of loop iterations. For example, in: WHILE s < a DO s := s + c (s , a ...
|
Aug 1 1987 |
|
|
|
|
|