307 search results - page 59 / 62 » Reasoning with Axioms: Theory and Practice |
ITNG
2007
IEEE
15 years 3 months ago
2007
IEEE
Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...
ML
2006
ACM
15 years 3 months ago
2006
ACM
Existing ML-like languages guarantee type-safety, ensuring memty and protecting the invariants of abstract types, but only within single executions of single programs. Distributed...
ACMICEC
2004
ACM
15 years 2 months ago
2004
ACM
Electronic voting has become one of the most popular activities over the Internet. Security and privacy are always regarded as crucial factors in electronic voting system design. ...
PLDI
2003
ACM
15 years 2 months ago
2003
ACM
In prior work [15] we studied a language construct restrict that allows programmers to specify that certain pointers are not aliased to other pointers used within a lexical scope....
EUROCRYPT
2003
Springer
15 years 2 months ago
2003
Springer
In spite of a relatively large number of publications about breaking Enigma by the Allies before and during the World War II, this subject remains relatively unknown not only to th...