2687 search results - page 125 / 538 » Formal Analysis of PKCS |
143
click to vote
ISOLA
2010
Springer
15 years 2 months ago
2010
Springer
Automatic bug finding with static analysis requires precise tracking of different memory object values. This paper describes a memory modeling method for static analysis of C pro...
136
click to vote
SAS
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
138
click to vote
FM
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We present a software tool platform which facilitates security and performance analysis of systems which starts and ends with UML model descriptions. A UML project is pre...
137
click to vote
SAS
1999
Springer
15 years 8 months ago
1999
Springer
We define an operational semantics for the Signal language and design an analysis which allows to verify properties pertaining to the relation between values of the numeric and bo...
120
Voted
FM
2008
Springer
15 years 5 months ago
2008
Springer
In [?], a practical algorithm for precise interval analysis is provided for which, however, no non-trivial upper complexity bound is known. Here, we present a lower bound by showin...