632 search results - page 21 / 127 » Proving Invariants of Functional Programs |
109
Voted
CAV
2012
Springer
13 years 2 months ago
2012
Springer
An algorithmic-learning-based termination analysis technique is presented. The new technique combines transition predicate abstraction, algorithmic learning, and decision procedure...
95
Voted
TIP
2010
14 years 11 months ago
2010
—Processing blurred images is a key problem in many image applications. Existing methods to obtain blur invariants which are invariant with respect to centrally symmetric blur ar...
CSR
2008
Springer
15 years 2 months ago
2008
Springer
A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, ...
90
Voted
ICFEM
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Automated verification of memory safety and functional correctness for heap-manipulating programs has been a challenging task, especially when dealing with complex data ...
85
Voted
APN
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Choosing a good variable order is crucial for making symbolic state-space generation algorithms truly efficient. One such algorithm is the MDD-based Saturation algorithm ...