2687 search results - page 195 / 538 » Formal Analysis of PKCS |
157
Voted
FORMATS
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Probabilistic timed automata are an extension of timed automata with discrete probability distributions. Simulation and bisimulation relations are widely-studied in the c...
141
Voted
POPL
2012
ACM
14 years 4 days ago
2012
ACM
In object-oriented programming, unique permissions to object references are useful for checking correctness properties such as consistency of typestate and noninterference of conc...
144
click to vote
CADE
2007
Springer
16 years 4 months ago
2007
Springer
Abstract. It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. Recently, it ...
155
Voted
ACNS
2007
Springer
15 years 10 months ago
2007
Springer
In 1990, Boyar, Chaum, Damg˚ard and Pedersen introduced convertible undeniable signatures which limit the self-authenticating property of digital signatures but can be converted b...
148
click to vote
AGTIVE
2007
Springer
15 years 10 months ago
2007
Springer
In collaborative ontology engineering, contexts are key to manage the complexity of different dependency types between ontological artefacts. Instead of being frustrated by out-of...