2687 search results - page 147 / 538 » Formal Analysis of PKCS |
149
Voted
SAS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Linear-relations analysis of transition systems discovers linear invariant relationships among the variables of the system. These relationships help establish important s...
153
click to vote
SAS
2009
Springer
16 years 4 months ago
2009
Springer
In this paper we present a new shape analysis algorithm. The key distinguishing aspect of our algorithm is that it is completely compositional, bottom-up and non-iterative. We pres...
116
click to vote
SAS
2007
Springer
15 years 10 months ago
2007
Springer
In static analysis, the semantics of the program is expressed as a set ions. The equations are solved iteratively over some abstract domain. If ract domain is distributive and sati...
120
click to vote
SAS
2005
Springer
15 years 9 months ago
2005
Springer
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms...
133
click to vote
FM
2001
Springer
15 years 8 months ago
2001
Springer
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...