Subir material

Suba sus trabajos a SEDICI, para mejorar notoriamente su visibilidad e impacto

 

Mostrar el registro sencillo del ítem

dc.date.accessioned 2018-02-26T16:03:00Z
dc.date.available 2018-02-26T16:03:00Z
dc.date.issued 2017
dc.identifier.uri http://sedici.unlp.edu.ar/handle/10915/65163
dc.description.abstract In this paper we present a series of theorems that allow to establish strategies for the calculation of invariant assertions, such as the Dijkstra’s Hk(Post), or the weakest precondition of the loop. A criterion is also shown for calculating the termination condition of a loop. As in the integrals calculus, the strategies proposed here to perform the calculation of an invariant, will depend on the shape of the loop with which it is working, particularly will work with for-type loops with or without early termination due to a sentry. en
dc.language en es
dc.subject Cálculos es
dc.subject invariant assertions en
dc.subject formal program verification en
dc.subject GCL en
dc.subject induction en
dc.title Calculation of Invariants Assertions en
dc.type Objeto de conferencia es
sedici.creator.person Flaviani, Federico es
sedici.subject.materias Ciencias Informáticas es
sedici.description.fulltext true es
mods.originInfo.place Sociedad Argentina de Informática e Investigación Operativa (SADIO) es
sedici.subtype Objeto de conferencia es
sedici.rights.license Creative Commons Attribution-ShareAlike 4.0 International (CC BY-SA 4.0)
sedici.rights.uri http://creativecommons.org/licenses/by-sa/4.0/
sedici.date.exposure 2017-09
sedici.relation.event Simposio Latinoamericano de Teoría Computacional (SLTC) - JAIIO 46 (Córdoba, 2017). es
sedici.description.peerReview peer-review es


Descargar archivos

Thumbnail
Documento completo
Descargar archivo (243.0Kb) - PDF

Este ítem aparece en la(s) siguiente(s) colección(ones)

Creative Commons Attribution-ShareAlike 4.0 International (CC BY-SA 4.0) Excepto donde se diga explícitamente, este item se publica bajo la siguiente licencia Creative Commons Attribution-ShareAlike 4.0 International (CC BY-SA 4.0)