Sciweavers

27 search results - page 4 / 6
» Handling Polymorphism in Automated Deduction
Sort
View
MCMASTER
1993
15 years 3 months ago
A Taste of Rewrite Systems
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
Nachum Dershowitz
IANDC
2008
150views more  IANDC 2008»
14 years 11 months ago
Hierarchical combination of intruder theories
Recently automated deduction tools have proved to be very effective for detecting attacks on cryptographic protocols. These analysis can be improved, for finding more subtle weakn...
Yannick Chevalier, Michaël Rusinowitch
LICS
2003
IEEE
15 years 4 months ago
An NP Decision Procedure for Protocol Insecurity with XOR
We provide a method for deciding the insecurity of cryptographic protocols in presence of the standard Dolev-Yao intruder (with a finite number of sessions) extended with so-call...
Yannick Chevalier, Ralf Küsters, Michaël...
IDA
2003
Springer
15 years 4 months ago
A Logical Formalisation of the Fellegi-Holt Method of Data Cleaning
The Fellegi-Holt method automatically “corrects” data that fail some predefined requirements. Computer implementations of the method were used in many national statistics bure...
Agnes Boskovitz, Rajeev Goré, Markus Heglan...
IJSEKE
2006
122views more  IJSEKE 2006»
14 years 11 months ago
A Tool to Automatically Map Implementation-based Testing Techniques to Classes
hibiting the characteristics of abstraction, encapsulation, genericity, inheritance, polymorphism, concurrency and exception handling. To address the difficulty of testing the feat...
Peter J. Clarke, Junhua Ding, Djuradj Babich, Bria...