632 search results - page 35 / 127 » Combining programming with theorem proving |
231
click to vote
APLAS
2011
ACM
14 years 7 months ago
2011
ACM
The well-known third list homomorphism theorem states that if a function h is both an instance of foldr and foldl, it is a list homomorphism. Plenty of previous works devoted to co...
185
Voted
COMPSAC
1999
IEEE
15 years 11 months ago
1999
IEEE
The use of formal methods has been growing steadily and there have been a number of successful applications of formal methods in a range of application areas. It seems agreed that...
162
click to vote
ENTCS
2008
15 years 7 months ago
2008
We present a generic congruence closure algorithm for deciding ground formulas in the combination of the theory of equality with uninterpreted symbols and an arbitrary built-in so...
200
Voted
PPOPP
2003
ACM
16 years 22 days ago
2003
ACM
We present a new method for dynamically detecting potential data races in multithreaded programs. Our method improves on the state of the art in accuracy, in usability, and in ove...
168
click to vote
CSL
1994
Springer
15 years 11 months ago
1994
Springer
We prove the completeness of the combination of ordered resolution and factoring for a large class of non-liftable orderings, without the need for any additional rules like satura...