957 search results - page 71 / 192 » Modular Static Program Analysis |
CASES
2009
ACM
15 years 6 months ago
2009
ACM
Accurate estimation of the tick length of a synchronous program is essential for efficient and predictable implementations that are devoid of timing faults. The techniques to dete...
105
click to vote
LOPSTR
2001
Springer
15 years 4 months ago
2001
Springer
In this paper we define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of prin...
106
click to vote
CSL
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
121
click to vote
ISSTA
2012
ACM
13 years 2 months ago
2012
ACM
We introduce the concept of “residual investigation” for program analysis. A residual investigation is a dynamic check installed as a result of running a static analysis that ...
100
click to vote
AGP
1995
IEEE
15 years 3 months ago
1995
IEEE
The main difficulty in the formalization of a static analysis framework for CC programs is probably related to the correct approximation of the entailment relation between constrai...