632 search results - page 41 / 127 » Combining programming with theorem proving |
142
click to vote
HASKELL
2005
ACM
15 years 7 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...
115
Voted
JELIA
2010
Springer
15 years 8 days ago
2010
Springer
Traditionally, a logic program is built up to reason about atomic first-order formulas. The key idea of parametrized logic programming is that, instead of atomic first-order form...
110
Voted
SIAMCOMP
2010
14 years 8 months ago
2010
An equality template (also equality constraint language) is a relational structure with infinite universe whose relations can be defined by boolean combinations of equalities. We ...
193
click to vote
POPL
2011
ACM
14 years 4 months ago
2011
ACM
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
114
click to vote
ICFEM
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Theorem provers, model checkers, static analyzers, test generators. . . all of these and many other kinds of formal methods tools can contribute to the analysis and devel...