590 search results - page 36 / 118 » Non-Failure Analysis for Logic Programs |
149
click to vote
SAS
2007
Springer
16 years 1 days ago
2007
Springer
Existing shape analysis algorithms infer descriptions of data structures at program points, starting from a given precondition. We describe an analysis that does not require any pr...
266
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
This article investigates formal properties of a family of semantically sound flow-sensitive type systems for tracking information flow in simple While programs. The family is ind...
166
click to vote
ICFEM
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We present a “memory-model-sensitive” approach to validating correctness properties for multithreaded programs. Our key insight is that by specifying both the inter-t...
154
click to vote
FMCO
2003
Springer
15 years 11 months ago
2003
Springer
In this paper we discuss the question which properties of a formally verified component are preserved when the component is changed due to an adaption to a new use. More specific...
150
click to vote
ICLP
1999
Springer
15 years 10 months ago
1999
Springer
In this work, we develop a binding-time analysis for the logic programming language Mercury. We introduce a precise domain of binding-times, based on the type information available...