3515 search results - page 411 / 703 » On the semantics of Strategy Logic |
188
click to vote
RTA
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. For narrowing to be an efficient evaluation mechanism, several lazy narrowing strategies have been proposed, although typically for the restricted case of left-linear con...
186
click to vote
PPDP
2001
Springer
16 years 1 days ago
2001
Springer
We define a transformation from a left-linear constructor-based conditional rewrite system into an overlapping inductively sequential rewrite system. This transformation is sound...
201
click to vote
ENTCS
2007
15 years 7 months ago
2007
The rewrite-based approach to satisfiability modulo theories consists of using generic theorem-proving strategies for first-order logic with equality. If one can prove that an i...
361
click to vote
POPL
2004
ACM
16 years 8 months ago
2004
ACM
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
227
click to vote
ICTAC
2010
Springer
15 years 5 months ago
2010
Springer
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...