632 search results - page 9 / 127 » Proving Invariants of Functional Programs |
113
click to vote
LOPSTR
2009
Springer
15 years 7 months ago
2009
Springer
In this work, we first consider a goal-oriented extension of the dependency pair framework for proving termination w.r.t. a given set of initial terms. Then, we introduce a new re...
99
Voted
AMAST
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Vx86 is the first static analyzer for sequential Intel x86 assembler code using automated deductive verification. It proves the correctness of assembler code against func...
ENTCS
2007
15 years 8 days ago
2007
Context-sensitive rewriting (CSR) is a restriction of rewriting which forbids reductions on selected arguments of functions. Proving termination of CSR is an interesting problem w...
98
Voted
QSIC
2005
IEEE
15 years 6 months ago
2005
IEEE
Many programs need to access data in a relational database. This is usually done by means of queries written in SQL. Although the language SQL is declarative, certain runtime erro...
ESOP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Many algorithms use concrete data types with some additional invariants. The set of values satisfying the invariants is often a set of representatives for the equivalence...