233 search results - page 9 / 47 » Specifying, Programming and Verifying with Equational Logic |
FSKD
2005
Springer
14 years 26 days ago
2005
Springer
Incremental checkpointing is an cost-efficient fault tolerant technique for long running programs such as genetic algorithms. In this paper, we derive the equations for the writing...
POPL
2006
ACM
14 years 7 months ago
2006
ACM
Functional programmers often reason about programs as if they were written in a total language, expecting the results to carry over to non-total (partial) languages. We justify su...
FSEN
2009
Springer
14 years 2 months ago
2009
Springer
We introduce a Hoare logic for higher-order functional languages with control operators such as callcc. The key idea is to build the assertion language and proof rules around an e...
POPL
2007
ACM
14 years 7 months ago
2007
ACM
This paper contributes to the development of techniques for the modular proof of programs that include concurrent algorithms. We present a proof of a non-blocking concurrent algor...
CADE
2007
Springer
14 years 7 months ago
2007
Springer
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...