Eric C. R. Hehner

Orcid: 0000-0002-0179-0097

Affiliations:
  • University of Toronto, Canada


According to our database1, Eric C. R. Hehner authored at least 50 papers between 1976 and 2020.

Collaborative distances:
  • Dijkstra number2 of two.
  • Erdős number3 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Epimenides, Gödel, Turing: An Eternal Gölden Twist.
SN Comput. Sci., 2020

2018
A Theory of Lazy Imperative Timing.
Proceedings of the Proceedings 18th Refinement Workshop, 2018

2017
What Is a Procedure?
Proceedings of the Present and Ulterior Software Engineering., 2017

2016
A Tale of Two Turing Machines.
CoRR, 2016

Epimenides, Gödel, Turing: an Eternal Gölden Tangle.
CoRR, 2016

Observations on the Halting Problem.
CoRR, 2016

How to Compute Halting.
CoRR, 2016

2011
A probability perspective.
Formal Aspects Comput., 2011

2009
Programming with Quantum Communication.
Proceedings of Seventh Workshop on Quantitative Aspects of Programming Languages, 2009

2007
Programming Telepathy: Implementing Quantum Non-Locality Games.
CoRR, 2007

2006
Retrospective and Prospective for Unifying Theories of Programming.
Proceedings of the Unifying Theories of Programming, First International Symposium, 2006

Quantum Predicative Programming.
Proceedings of the Mathematics of Program Construction, 8th International Conference, 2006

Roadmap for enhanced languages and methods to aid verification.
Proceedings of the Generative Programming and Component Engineering, 2006

2005
Specified Blocks.
Proceedings of the Verified Software: Theories, 2005

2004
Probabilistic Predicative Programming.
Proceedings of the Mathematics of Program Construction, 7th International Conference, 2004

2002
Theories, Implementations, and Transformations.
Proceedings of the ZB 2002: Formal Specification and Development in Z and B, 2002

2001
Variables and scopes considered formally.
Inf. Process. Lett., 2001

1999
Specifications, Programs, and Total Correctness.
Sci. Comput. Program., 1999

Bunches for Object-Oriented, Concurrent, and Real-Time Specification.
Proceedings of the FM'99 - Formal Methods, 1999

Refinement Semantics and Loop Rules.
Proceedings of the FM'99 - Formal Methods, 1999

1998
Formalization of Time and Space.
Formal Aspects Comput., 1998

1996
Boolean Formalism and Explanations.
Proceedings of the Algebraic Methodology and Software Technology, 1996

1993
A Practical Theory of Programming.
Texts and Monographs in Computer Science, Springer, ISBN: 978-1-4419-8596-5, 1993

1992
Logical Specifications for Functional Programs.
Proceedings of the Mathematics of Program Construction, Second International Conference, Oxford, UK, June 29, 1992

1991
What's Wrong With Formal Programming Methods?
Proceedings of the Advances in Computing and Information, 1991

1990
A Practical Theory of Programming.
Sci. Comput. Program., 1990

1989
Real-Time Programming.
Inf. Process. Lett., 1989

Termination is Timing.
Proceedings of the Mathematics of Program Construction, 1989

1988
Termination Conventions and Comparative Semantics.
Acta Informatica, 1988

Erratum: Predicative Methodology.
Acta Informatica, 1988

1986
Predicative Methodology.
Acta Informatica, 1986

1985
The logic of programming.
Prentice Hall International series in computer science, Prentice Hall, ISBN: 978-0-13-539966-8, 1985

1984
Predicative Programming, Part II.
Commun. ACM, 1984

Predicative Programming, Part I.
Commun. ACM, 1984

1983
A More Complete Model of Communicating Processes.
Theor. Comput. Sci., 1983

Programming with Grammars: An Exercise in Methodology-Directed Language Design.
Comput. J., 1983

Teaching formal methods for program development and verification (Panel Session).
Proceedings of the 14th SIGCSE Technical Symposium on Computer Science Education, 1983

1982
Comments on "A Method for Representing Data Items of Unlimites Length in a Computer Memory".
IEEE Trans. Software Eng., 1982

A Methodology for Programming with Concurrency: An Informal Presentation.
Sci. Comput. Program., 1982

1981
An Implementation of P and V.
Inf. Process. Lett., 1981

Bunch Theory: A Simple Set Theory for Computer Science.
Inf. Process. Lett., 1981

A methodolgy for programming with concurrency.
Proceedings of the CONPAR 81: Conference on Analysing Problem Classes and Programming for Parallel Computing, 1981

1980
Corrigendum: A New Representation of the Rational Numbers for Fast Easy Arithmetic.
SIAM J. Comput., 1980

1979
A New Representation of the Rational Numbers for Fast Easy Arithmetic.
SIAM J. Comput., 1979

do Considered od: A Contribution to the Programming Calculus.
Acta Informatica, 1979

1978
On Removing the Machine from the Language.
Acta Informatica, 1978

Exact arithmetic using a variable-length P-ADIC representation.
Proceedings of the 4th IEEE Symposium on Computer Arithmetic, 1978

1977
Information Content of Programs and Operation Encoding.
J. ACM, 1977

Structuring.
Proceedings of the Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, 1977

1976
Special Feature: Computer Design to Minimize Memory Requirements.
Computer, 1976


  Loading...