55 search results - page 9 / 11 » Automatic induction proofs of data-structures in imperative ... |
162
click to vote
POPL
2006
ACM
15 years 10 months ago
2006
ACM
We describe a novel method for verifying programs that manipulate linked lists, based on two new predicates that characterize reachability of heap cells. These predicates allow re...
ENTCS
2007
14 years 9 months ago
2007
Formal sequentialization is introduced as a rewriting process for the reduction of parallelism and internal communication statements of distributed imperative programs. It constru...
79
Voted
IJAIT
2006
14 years 9 months ago
2006
We present MABLE, a fully implemented programming language for multiagent systems, which is intended to support the automatic verification of such systems via model checking. In a...
88
Voted
POPL
2010
ACM
15 years 7 months ago
2010
ACM
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...
NJC
2006
14 years 9 months ago
2006
Abstract. General purpose theorem provers provide advanced facilities for proving properties about specifications, and may therefore be a valuable tool in formal program developmen...