Sciweavers

598 search results - page 46 / 120
» Procedure Based Program Compression
Sort
View
ICFP
2009
ACM
14 years 10 months ago
Effective interactive proofs for higher-order imperative programs
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...
Adam J. Chlipala, J. Gregory Malecha, Greg Morrise...
ICFP
2003
ACM
14 years 9 months ago
Iterative-free program analysis
Program analysis is the heart of modern compilers. Most control flow analyses are reduced to the problem of finding a fixed point in a certain transition system, and such fixed po...
Mizuhito Ogawa, Zhenjiang Hu, Isao Sasano
LPKR
1997
Springer
14 years 1 months ago
Knowledge Representation with Logic Programs
In this overview we show how Knowledge Representation (KR) can be done with the help of generalized logic programs. We start by introducing the core of PROLOG, which is based on de...
Gerhard Brewka, Jürgen Dix
LPAR
2010
Springer
13 years 7 months ago
Interpolating Quantifier-Free Presburger Arithmetic
Craig interpolation has become a key ingredient in many symbolic model checkers, serving as an approximative replacement for expensive quantifier elimination. In this paper, we foc...
Daniel Kroening, Jérôme Leroux, Phili...
CAV
2008
Springer
96views Hardware» more  CAV 2008»
13 years 11 months ago
Implied Set Closure and Its Application to Memory Consistency Verification
Hangal et. al. [3] have developed a procedure to check if an instance of the execution of a shared memory multiprocessor program, is consistent with the Total Store Order (TSO) mem...
Surender Baswana, Shashank K. Mehta, Vishal Powar