3931 search results - page 110 / 787 » Separation logic and abstraction |
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...
108
click to vote
AGP
2003
IEEE
15 years 3 months ago
2003
IEEE
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
CADE
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. In this paper we present an extensional higher-order resolution calculus that is complete relative to Henkin model semantics. The treatment of the extensionality principl...
ICALP
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. We prove that the boundedness problem for monadic secondorder logic over the class of all finite words is decidable.
FSKD
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. The na