Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Olfa Mraihi"'
Publikováno v:
EPiC Series in Computing.
Invariant assertions play an important role in the analysis and documentation of while loops of imperative programs. Invariant functions and invariant relations are alternative analysis tools that are distinct from invariant assertions but are relate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6c200a444cd5b657f85b07be372cc983
https://doi.org/10.29007/zhz4
https://doi.org/10.29007/zhz4
Publikováno v:
Science of Computer Programming. 78:1212-1239
Invariant assertions play an important role in the analysis and documentation of while loops of imperative programs. Invariant functions and invariant relations are alternative analysis tools that are distinct from invariant assertions but are relate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2216b6927befde92e758df32b906fda0
https://doi.org/10.1016/j.scico.2012.05.006
https://doi.org/10.1016/j.scico.2012.05.006
Publikováno v:
Journal of Symbolic Computation. 48:1-36
Whereas the analysis of loops in imperative programs is, justifiably, dominated by the concept of invariant assertion, we submit a related but different concept, of invariant relation, and show how it can be used to analyze diverse aspects of a while
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2e0543edb5ea75c3216702d0e8818523
https://doi.org/10.1016/j.jsc.2012.04.001
https://doi.org/10.1016/j.jsc.2012.04.001
Publikováno v:
Innovations in Systems and Software Engineering. 8:195-212
The increasing criticality of software applications, the increasing size and complexity of such applications, and the increasing reliance of software engineering paradigms on third party software assets combine to place a high premium on the ability
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8872f037252a02a7e39ae6c25c57882c
https://doi.org/10.1007/s11334-012-0189-0
https://doi.org/10.1007/s11334-012-0189-0
Publikováno v:
The Journal of Logic and Algebraic Programming. 81(5):606-622
Ever since their introduction by Hoare in 1969, invariant assertions have, justifiably, played a key role in the analysis of while loops. In this paper, we discuss a distinct but related concept, viz invariant relations, and show how these can be use
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::82c99e0fb9c76d0d87412664799ba055
Publikováno v:
Electronic Workshops in Computing.
Since their introduction more than four decades ago, invariant assertions have, justifiably, dominated the analysis of while loops, and have been the focus of sustained research interest in the seventies and eighties, and renewed interest in the last
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::024d9c5c65da98c29b2459de1f23571a
https://doi.org/10.14236/ewic/vecos2011.9
https://doi.org/10.14236/ewic/vecos2011.9
Publikováno v:
Theoretical Aspects of Computing – ICTAC 2011 ISBN: 9783642232824
ICTAC
ICTAC
Weakest preconditions were introduced by Dijkstra as a tool to define the semantics of programming constructs, and thereby as a means to prove the correctness of programs; the dual concept of strongest postcondition was introduced subsequently as an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a71471f16c395462b9ff25e0a77bedef
https://doi.org/10.1007/978-3-642-23283-1_13
https://doi.org/10.1007/978-3-642-23283-1_13
Publikováno v:
ICSE (2)
In this short paper we discuss the design, implementation and operation of an automated tool that computes the function of while loops written in C-like programming languages.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1084a78f98cf479a09ce9935797b984f
https://doi.org/10.1145/1810295.1810369
https://doi.org/10.1145/1810295.1810369
Publikováno v:
Relations and Kleene Algebra in Computer Science ISBN: 9783642046384
RelMiCS
RelMiCS
Despite much progress in the design of programming languages, the vast majority of software being written and deployed nowadays remains written in languages where iteration is the main inductive construct, and the main source of algorithmic complexit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::80cd66e7538369f4ef19e4b41838f095
https://doi.org/10.1007/978-3-642-04639-1_17
https://doi.org/10.1007/978-3-642-04639-1_17
Publikováno v:
International Journal of Critical Computer-Based Systems. 5:78
Traditionally, invariant assertions are used to verify the partial correctness of while loops with respect to pre/post specifications. In this paper we discuss a related but distinct concept, namely invariant relations, and show how invariant relatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::787dddb74239a599cd360cfec1c7f034
https://doi.org/10.1504/ijccbs.2014.059596
https://doi.org/10.1504/ijccbs.2014.059596