Titlebook: Logics of Programs; Workshop, Yorktown H Dexter Kozen Conference proceedings 1982 Springer-Verlag Berlin Heidelberg 1982 algorithms.concurr

我不死扛

mortuary

裤子

,Hoare’s Logic is incomplete when it does not have to be,If Hoare‘s Logic, HL(.), is complete on a structure ., then the set PC(.) of all asserted programs true over . is recursive in the first order theory of ., Th(.). We show that this implication cannot be reversed.

忙碌

A formalism for reasoning about fair termination,Fair termination can be expressed, hence reasoned about, in Park‘s monotone μ-calculus, and the fair weakest precondition operator for boolean guarded do-loops is expressed.

推崇

AMEND

Arroyo

不理会

aristocracy

groggy

0302-9743 Overview: 978-3-540-11212-9978-3-540-39047-3Series ISSN 0302-9743 Series E-ISSN 1611-3349