20 search results - page 3 / 4 » Static Analysis of CLP Programs over Numeric Domains |
SAS
2009
Springer
14 years 5 months ago
2009
Springer
Polyhedra: An Abstract Domain to Infer Interval Linear Relationships Liqian Chen1,2 , Antoine Min?e2,3 , Ji Wang1 , and Patrick Cousot2,4 1 National Laboratory for Parallel and Dis...
ASAP
1996
IEEE
13 years 9 months ago
1996
IEEE
The Alpha language, based on systems of affine recurrence equations over polyhedral domains, allows the expression of complex algorithms as hierarchical, parameterized structures ...
SAC
2010
ACM
14 years 4 days ago
2010
ACM
Program bugs remain a major challenge for software developers and various tools have been proposed to help with their localization and elimination. Most present-day tools are base...
CAV
2006
Springer
13 years 9 months ago
2006
Springer
We introduce calling context graphs and various static and theorem proving based analyses that together provide a powerful method for proving termination of programs written in fea...
SAS
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. The capability calculus is a framework for statically reasoning about program resources such as deallocatable memory regions. Fractional capabilities, originally proposed...