858 search results - page 114 / 172 » Abstract Interpretation Based Verification of Logic Programs |
221
click to vote
POPL
2006
ACM
16 years 3 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...
147
click to vote
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
145
click to vote
TPHOL
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper a general framework for separation logic inside the HOL theorem prover is presented. This framework is based on Abeparation Logic. It contains a model of an abstract,...
140
click to vote
ICTCS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We consider a call-by-value language, with higher-order functions, records, references to values of arbitrary type, and subtyping. We adapt an intrinsic denotational mode...
122
click to vote
AAAI
2004
15 years 4 months ago
2004
In this paper we introduce the language Golog+HTNT I for specifying control using procedural and HTN-based constructs together with deadlines and time restrictions. Our language s...