632 search results - page 45 / 127 » Proving Invariants of Functional Programs |
130
click to vote
HASKELL
2005
ACM
15 years 6 months ago
2005
ACM
Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to use them to prove the correctness of functional p...
208
click to vote
POPL
2007
ACM
16 years 27 days ago
2007
ACM
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
OOPSLA
2005
Springer
15 years 6 months ago
2005
Springer
A number of effective error detection tools have been built in recent years to check if a program conforms to certain design rules. An important class of design rules deals with s...
110
Voted
IFL
2007
Springer
15 years 6 months ago
2007
Springer
Existing contract checkers for data structures force programmers to choose between poor alternatives. Contracts are either built into the functions that construct the data structur...
91
Voted
CEC
2009
IEEE
15 years 7 months ago
2009
IEEE
— Self Modifying CGP (SMCGP) is a developmental form of Cartesian Genetic Programming(CGP). It differs from CGP by including primitive functions which modify the program. Beginni...