76 search results - page 5 / 16 » Using Datalog and Boolean Equation Systems for Program Analy... |
104
click to vote
CSCLP
2004
Springer
15 years 3 months ago
2004
Springer
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
ICASSP
2009
IEEE
15 years 1 months ago
2009
IEEE
In this paper, we solve the problem of detecting the entries of a sparse finite-alphabet signal from a limited amount of data, for instance obtained by compressive sampling. While...
CSMR
2004
IEEE
15 years 1 months ago
2004
IEEE
Automatic analysis of programs with preprocessing directives and conditional compilation is challenging. The difficulties range from parsing to program understanding. Symbolic eva...
PPDP
2001
Springer
15 years 2 months ago
2001
Springer
We introduce a new system of trust analysis for concurrent and distributed systems using the π-calculus[13, 14, 15] as a modelling tool. A Type system using boolean annotations g...
CAV
2008
Springer
14 years 11 months ago
2008
Springer
This paper addresses the analysis of concurrent programs with shared memory. Such an analysis is undecidable in the presence of multiple procedures. One approach used in recent wor...