55 search results - page 8 / 11 » Automatic induction proofs of data-structures in imperative ... |
ENTCS
2008
14 years 9 months ago
2008
As an extension to Floyd-Hoare logic, separation logic has been used to facilitate reasoning about imperative programs manipulating shared mutable data structures. Recently, it ha...
99
Voted
PEPM
1992
ACM
15 years 1 months ago
1992
ACM
A partial evaluator is an automatic program transformation tool. Given as input a general program and part of its input, it can produce a specialized version. If the partial evalu...
104
click to vote
ISSAC
2004
Springer
15 years 2 months ago
2004
Springer
In [17], an abstract framework for automatically generating loop invariants of imperative programs was proposed. This framework was then instantiated for the language of conjuncti...
JUCS
2006
14 years 9 months ago
2006
Abstract: We present a novel approach to the verification of functional-logic programs. For our verification purposes, equational reasoning is not valid due to the presence of non-...
APLAS
2005
ACM
15 years 3 months ago
2005
ACM
Interpretation interpretation is a theory of effective abstraction and/or approximation of discrete mathematical structures as found in the semantics of programming languages, mod...