Sciweavers

77 search results - page 9 / 16
» Logical Interpretation: Static Program Analysis Using Theore...
Sort
View
ICLP
2001
Springer
14 years 2 days ago
Higher-Precision Groundness Analysis
Abstract. Groundness analysis of logic programs using Pos-based abstract interpretation is one of the clear success stories of the last decade in the area of logic program analysis...
Michael Codish, Samir Genaim, Harald Sønder...
ICFEM
2005
Springer
14 years 1 months ago
An Evidential Tool Bus
Abstract. Theorem provers, model checkers, static analyzers, test generators. . . all of these and many other kinds of formal methods tools can contribute to the analysis and devel...
John M. Rushby
SEFM
2008
IEEE
14 years 2 months ago
Nullness Analysis in Boolean Form
Attempts to dereference null result in an exception or a segmentation fault. Hence it is important to know those program points where this might occur and prove the others (or the...
Fausto Spoto
PPDP
2001
Springer
14 years 2 days ago
When Do Bounds and Domain Propagation Lead to the Same Search Space?
This paper explores the question of when two propagationbased constraint systems have the same behaviour, in terms of search space. We categorise the behaviour of domain and bound...
Christian Schulte, Peter J. Stuckey
TAP
2010
Springer
145views Hardware» more  TAP 2010»
13 years 5 months ago
QuickSpec: Guessing Formal Specifications Using Testing
We present QuickSpec, a tool that automatically generates algebraic specifications for sets of pure functions. The tool is based on testing, rather than static analysis or theorem ...
Koen Claessen, Nicholas Smallbone, John Hughes