2687 search results - page 311 / 538 » Formal Analysis of PKCS |
155
click to vote
IPL
2007
15 years 6 months ago
2007
We present a characterization of first-order functional programs which are quasiterminating w.r.t. the symbolic execution mechanism of needed narrowing, i.e., computations in the...
182
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
A mix network by Wikstrom fails in correctness, provable privacy and soundness. Its claimed advantages in security and efficiency are compromised. The analysis in this paper illus...
189
click to vote
RE
2010
Springer
15 years 1 months ago
2010
Springer
An approach is suggested for arguing that a system is dependable. The key idea is to structure the system so that critical requirements are localized in small, reliable subsets of ...
169
Voted
TLDI
2005
ACM
16 years 5 days ago
2005
ACM
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
172
click to vote
ENTCS
2002
15 years 6 months ago
2002
Abstract: Alias analysis for Fortran is less complicated than for programming languages with pointers but many real Fortran programs violate the standard: a formal parameter or a c...