322 search results - page 29 / 65 » Combinations of Abstract Domains for Logic Programming |
135
Voted
JFPLC
2000
15 years 5 months ago
2000
ABSTRACT. This paper focuses on the assignment of meaning to some nonterminating SLD derivations in logic programming. Several approaches have been developped by considering infini...
147
click to vote
SAS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We present our experience of combining, in a realistic setting, a static analyzer with a statistical analysis. This combination is in order to reduce the inevitable false...
143
click to vote
FOSSACS
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. This paper develops a highly expressive semantic framework for program refinement that supports both temporal reasoning and reasoning about the knowledge of a single agen...
128
Voted
FOSSACS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicati...
140
Voted
SIGSOFT
2006
ACM
16 years 4 months ago
2006
ACM
We consider the problem if a given program satisfies a specified safety property. Interesting programs have infinite state spaces, with inputs ranging over infinite domains, and f...