Sciweavers

529 search results - page 5 / 106
» Simple Random Logic Programs
Sort
View
CSL
2004
Springer
13 years 9 months ago
Towards Mechanized Program Verification with Separation Logic
Using separation logic, this paper presents three Hoare logics (corresponding to different notions of correctness) for the simple While language extended with commands for heap acc...
Tjark Weber
CORR
2010
Springer
96views Education» more  CORR 2010»
13 years 3 months ago
A Simple Correctness Proof for Magic Transformation
The paper presents a simple and concise proof of correctness of the magic transformation. We believe it may provide a useful example of formal reasoning about logic programs. The ...
Wlodzimierz Drabent
ICALP
2004
Springer
13 years 11 months ago
Simple Permutations Mix Well
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask what is the number of compositions needed to achieve a permutatio...
Shlomo Hoory, Avner Magen, Steven Myers, Charles R...
APLAS
2010
ACM
13 years 6 months ago
Automatically Inferring Quantified Loop Invariants by Algorithmic Learning from Simple Templates
Abstract. By combining algorithmic learning, decision procedures, predicate abstraction, and simple templates, we present an automated technique for finding quantified loop invaria...
Soonho Kong, Yungbum Jung, Cristina David, Bow-Yaw...
ICFP
2003
ACM
14 years 5 months ago
FreshML: programming with binders made simple
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
Mark R. Shinwell, Andrew M. Pitts, Murdoch Gabbay