Rely-Guarantee Termination and Cost Analyses of Loops with Concurrent Interleavings

By following a rely-guarantee style of reasoning, we present novel termination and cost analyses for concurrent programs that, in order to prove termination or infer the cost of a considered loop: (1) infer the termination/cost of each loop as if it were a sequential one, imposing assertions on how...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of automated reasoning 2017-06, Vol.59 (1), p.47-85
Hauptverfasser:	Albert, Elvira, Flores-Montoya, Antonio, Genaim, Samir, Martin-Martin, Enrique
Format:	Artikel
Sprache:	eng
Schlagworte:	Applications programs Artificial Intelligence Computer Science Cost analysis Mathematical Logic and Formal Languages Mathematical Logic and Foundations Reasoning Symbolic and Algebraic Manipulation Upper bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!