4340 search results - page 273 / 868 » Formal Methods and Cryptography |
153
click to vote
RTA
1987
Springer
15 years 9 months ago
1987
Springer
We present completion methods for rewriting modulo a congruence, generalizing previous methods by Peterson and Stickel (1981) and Jouannaud and Kirchner (1986). We formalize our me...
164
click to vote
FMCAD
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we present a complete method for verifying properties expressed in the temporal logic CTL. In contrast to the majority of verification methods presented in recent yea...
194
click to vote
FMCAD
2008
Springer
15 years 7 months ago
2008
Springer
We present a method for verifying information flow properties of software programs using inductive assertions and theorem proving. Given a program annotated with information flow a...
217
click to vote
TKDE
2012
13 years 8 months ago
2012
—Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...
187
click to vote
CCS
2005
ACM
15 years 11 months ago
2005
ACM
The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex real-l...