1313 search results - page 214 / 263 » Prioritized Reasoning in Logic Programming |
74
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Many semantical aspects of programming languages are specified through calculi for constructing proofs: consider, for example, the specification of structured operational semantic...
115
click to vote
CADE
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. We present the first implementation of a theorem prover running on a smart card. The prover is written in Java and implements a dual tableau calculus. Due to the limited ...
170
click to vote
POPL
2009
ACM
15 years 10 months ago
2009
ACM
This paper describes a compositional shape analysis, where each procedure is analyzed independently of its callers. The analysis uses an abstract domain based on a restricted frag...
187
click to vote
POPL
2003
ACM
15 years 10 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
SIGSOFT
2004
ACM
15 years 10 months ago
2004
ACM
Dynamic detection of likely invariants is a program analysis that generalizes over observed values to hypothesize program properties. The reported program properties are a set of ...