1023 search results - page 115 / 205 » A Formal Method for Program Slicing |
127
click to vote
FMCAD
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We relate two well-studied methodologies in deductive verification of operationally modeled sequential programs, namely the use of inductive invariants and clock functio...
118
click to vote
KR
2004
Springer
15 years 7 months ago
2004
Springer
Disjunction is generally considered to add expressive power to logic programs under the stable model semantics, which have become a popular programming paradigm for knowledge repr...
147
click to vote
GECCO
2010
Springer
15 years 6 months ago
2010
Springer
Evolutionary methods have been used to repair programs automatically, with promising results. However, the fitness function used to achieve these results was based on a few simpl...
214
click to vote
ICFP
2009
ACM
16 years 2 months ago
2009
ACM
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
130
click to vote
AFP
2004
Springer
15 years 7 months ago
2004
Springer
Abstraction and application, tupling and projection: these provide the ‘software engineering’ superstructure for programs, and our familiar type systems ensure that these opera...