7988 search results - page 1095 / 1598 » A Useful Undecidable Theory |
208
Voted
MMMACNS
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Many design flaws and incorrect analyses of cryptographic protoAppeared in the Proceedings of the First International Workshop on Mathematical Methods, Models and Archit...
188
click to vote
PPDP
2001
Springer
15 years 11 months ago
2001
Springer
This paper describes an implementation of narrowing, an essential component of implementations of modern functional logic languages. These implementations rely on narrowing, in pa...
185
click to vote
SAS
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
168
click to vote
APSEC
2000
IEEE
15 years 11 months ago
2000
IEEE
It has been recognised that formal methods are useful as a modelling tool in requirements engineering. Specification languages such as Z permit the precise and unambiguous modell...
181
click to vote
DEXAW
2000
IEEE
15 years 11 months ago
2000
IEEE
Given their simple nature, the success of keyword based retrieval systems is astonishing. Although these methods seemingly only process words (and their word counts), they rely on...