Zobrazeno 1 - 10
of 59
pro vyhledávání: '"Eric C. R. Hehner"'
Autor:
Eric C. R. Hehner
Publikováno v:
SN Computer Science. 1
The Halting Problem is a version of the Liar's Paradox. We examine specifications for dependence on the agent that performs them. We look at the consequences for the Church–Turing thesis and for the Halting Problem.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::224d9e64a7db3b925f12c5045a3b2a1b
https://doi.org/10.1007/s42979-020-00318-5
https://doi.org/10.1007/s42979-020-00318-5
Autor:
Eric C. R. Hehner
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 282, Iss Proc. Refine 2018, Pp 1-9 (2018)
Refine@FM
Refine@FM
We present a theory of lazy imperative timing.
Comment: In Proceedings Refine 2018, arXiv:1810.08739
Comment: In Proceedings Refine 2018, arXiv:1810.08739
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6f9b5327449d13eddfa82b43af97c1b9
Autor:
Eric C. R. Hehner
Publikováno v:
Present and Ulterior Software Engineering ISBN: 9783319674247
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fbf14f193941698a29d9bbd6e2183a92
https://doi.org/10.1007/978-3-319-67425-4_14
https://doi.org/10.1007/978-3-319-67425-4_14
Autor:
Eric C. R. Hehner
Publikováno v:
Present and Ulterior Software Engineering ISBN: 9783319674247
Present and Ulterior Software Engineering
Present and Ulterior Software Engineering
Whether the meaning of a procedure is given by its specification or by its implementation has consequences for scalability of analysis, for localization of errors, for loop semantics, for program translation, and even for the halting problem.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2e5f2668649749def85e7299e3e1c6f0
https://doi.org/10.1007/978-3-319-67425-4_2
https://doi.org/10.1007/978-3-319-67425-4_2
Autor:
C. A. R. Hoare, Eric C. R. Hehner
A previous paper by Hoare gives axioms and proof rules for communicating processes that provide a calculus of total correctness. This paper gives explicit definitions of communicating processes as predicates. The former axioms and proof rules become
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2733020a71ff677b7bb04ac309941fbb
https://ora.ox.ac.uk/objects/uuid:37adc8ee-39c8-46e1-a553-6fe2038d594c
https://ora.ox.ac.uk/objects/uuid:37adc8ee-39c8-46e1-a553-6fe2038d594c
Autor:
Eric C. R. Hehner
Publikováno v:
Formal Aspects of Computing. 23:391-419
This paper draws together four perspectives that contribute to a new understanding of probability and solving problems involving probability. The first is the Subjective Bayesian perspective that probability is affected by one’s knowledge, and that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::da5a85ab31113594ad00d53efa1bd06c
https://doi.org/10.1007/s00165-010-0157-0
https://doi.org/10.1007/s00165-010-0157-0
Autor:
Eric C. R. Hehner, Anya Tafliovich
Publikováno v:
Electronic Notes in Theoretical Computer Science. 253(3):99-118
This work develops a formal framework for specifying, implementing, and analysing quantum communication protocols. We provide tools for developing simple proofs and analysing programs which involve communication, both via quantum channels and exhibit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ba2f47b683d1173b1ab47479f27ef571
Autor:
Eric C. R. Hehner
Publikováno v:
Information Processing Letters. 79:33-38
We consider what natural language explanations are required to present a formalism. We desire to be as complete as possible, leaving nothing implicit, and yet to keep the natural language to a minimum, moving as quickly as possible away from informal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6677dc5daa11d96d17c9b17eca40a03c
https://doi.org/10.1016/s0020-0190(00)00163-0
https://doi.org/10.1016/s0020-0190(00)00163-0
Autor:
Eric C. R. Hehner
Publikováno v:
Formal Aspects of Computing. 10:290-306
Time and space limitations can be specified, and proven, in exactly the same way as functionality. Proofs of time bounds, both implementation-independent and real-time, and of space requirements, both worst-case and average-case, are given in complet
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1898bc86da2133be2835c477ee95c5e6
https://doi.org/10.1007/s001650050017
https://doi.org/10.1007/s001650050017
Autor:
Eric C. R. Hehner
Publikováno v:
Verified Software: Theories, Tools, Experiments ISBN: 9783540691471
This paper argues that specified blocks have every advantage over the combination of assertions, preconditions, postconditions, invariants, and variants, both for verifying programs, and for program development. They are simpler, more general, easier
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f68e4be7c917049c5fde35b9650c1bb6
https://doi.org/10.1007/978-3-540-69149-5_41
https://doi.org/10.1007/978-3-540-69149-5_41