4719 search results - page 225 / 944 » Newtonian program analysis |
152
click to vote
AAAI
2006
15 years 7 months ago
2006
We establish a declarative theory of forgetting for disjunctive logic programs. The suitability of this theory is justified by a number of desirable properties. In particular, one...
155
click to vote
ENDM
2010
15 years 5 months ago
2010
Verifying that a piece of software has no bugs means proving that it has certain desired properties, such as an array index not taking values outside certain Abstract interpretati...
158
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Different from sequential programs, parallel programs possess their own characteristics which are difficult to analyze in the multi-process or multi-thread environment. This paper...
187
click to vote
CORR
2010
Springer
15 years 20 days ago
2010
Springer
Information flow analysis is a powerful technique for reasoning about the sensitive information exposed by a program during its execution. While past work has proposed information...
146
click to vote
TACAS
2010
Springer
16 years 20 days ago
2010
Springer
Abstract. We present Boom, a comprehensive analysis tool for Boolean programs. We focus in this paper on model-checking non-recursive concurrent programs. Boom implements a recent ...