Zobrazeno 1 - 10
of 79
pro vyhledávání: '"Jules, Desharnais"'
Publikováno v:
Logical Methods in Computer Science, Volume 7, Issue 1 (February 11, 2011) lmcs:777
Five algebraic notions of termination are formalised, analysed and compared: wellfoundedness or Noetherity, L\"ob's formula, absence of infinite iteration, absence of divergence and normalisation. The study is based on modal semirings, which are addi
Externí odkaz:
http://arxiv.org/abs/1012.5803
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 209, Iss Proc. Refine 2015, Pp 57-70 (2016)
Relative correctness is the property of a program to be more-correct than another program with respect to a given specification. Among the many properties of relative correctness, that which we found most intriguing is the property that program P' re
Externí odkaz:
https://doaj.org/article/d3bfe84ba52d4770b8c9577aed2f1e58
Publikováno v:
Journal of Logical and Algebraic Methods in Programming. 97:1-29
The condition under which a computation terminates, and the question of whether a computation terminates for a given initial state, have been the focus of much interest since the early days of computing. In this paper we argue that it is advantageous
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::10cde39f5a7d97cb66c06500929f5514
https://doi.org/10.1016/j.jlamp.2018.02.001
https://doi.org/10.1016/j.jlamp.2018.02.001
Publikováno v:
Innovations in Systems and Software Engineering. 13:219-239
Faults are an important concept in the study of system dependability, and most approaches to dependability can be characterized by the way in which they deal with faults (e.g., fault avoidance, fault removal, fault tolerance, fault forecasting). In t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0bc225691eafe0cf989ab23376c2379c
https://doi.org/10.1007/s11334-017-0300-7
https://doi.org/10.1007/s11334-017-0300-7
Publikováno v:
Science of Computer Programming. 138:26-48
Given a specification R, it is common for a candidate program P to be doing more than R requires; this is not necessarily bad, and is often unavoidable, due to programming language constraints or to otherwise sensible design decisions. In this paper,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::385b440e790178029466c3ce34696c5b
https://doi.org/10.1016/j.scico.2016.11.006
https://doi.org/10.1016/j.scico.2016.11.006
Autor:
Bernhard Möller, Jules Desharnais
Publikováno v:
Relational and Algebraic Methods in Computer Science ISBN: 9783030435196
We present an algebra for the classical database operators. Contrary to most approaches we use (inner) join and projection as the basic operators. Theta joins result by representing theta as a database table itself and defining theta-join as a join w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bc2fe95956d6c011cdae7fad83715e0e
https://doi.org/10.1007/978-3-030-43520-2_4
https://doi.org/10.1007/978-3-030-43520-2_4
Publikováno v:
Science of Computer Programming
Science of Computer Programming, Elsevier, 2016, 131, pp.76-93. ⟨10.1016/j.scico.2016.04.011⟩
Science of Computer Programming, Elsevier, 2016, 131, pp.76-93. ⟨10.1016/j.scico.2016.04.011⟩
International audience; We validate the RBAC ANSI 2012 standard using the B method. Numerous problems are identified: logical errors, inconsistencies, ambiguities, typing errors, missing preconditions, invariant violation, inappropriate specification
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a0be4c00c5955e628fa99d5588ff3c52
https://doi.org/10.1016/j.scico.2016.04.011
https://doi.org/10.1016/j.scico.2016.04.011
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 209, Iss Proc. Refine 2015, Pp 57-70 (2016)
Refine@FM
Refine@FM
Relative correctness is the property of a program to be more-correct than another program with respect to a given specification. Among the many properties of relative correctness, that which we found most intriguing is the property that program P' re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4723aa0a7445b2e5bec6a229f9d93e09
https://doaj.org/article/d3bfe84ba52d4770b8c9577aed2f1e58
https://doaj.org/article/d3bfe84ba52d4770b8c9577aed2f1e58
This book constitutes the proceedings of the 17th International Conference on Relational and Algebraic Methods in Computer Science, RAMiCS 2018, held in Groningen, The Netherlands, in October/November 2018. The 21 full papers and 1 invited paper pres
Publikováno v:
Journal of Logical and Algebraic Methods in Programming. 83:154-168
We present a few laws of linear algebra inspired by laws of relation algebra. The linear algebra laws are obtained from the relational ones by replacing union, intersection, composition and converse by the linear algebra operators of addition, Hadama
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6b9453ba1bf8528d306fd4d5272b5e41
https://doi.org/10.1016/j.jlap.2014.02.005
https://doi.org/10.1016/j.jlap.2014.02.005