2607 search results - page 214 / 522 » Complete Functional Synthesis |
130
click to vote
ICNC
2005
Springer
15 years 9 months ago
2005
Springer
In completeness theories of multiple-valued logic, the characterization of Sheffer functions is an important problem，and the solution can be reduced to determining the minimal co...
140
click to vote
FSE
2010
Springer
15 years 9 months ago
2010
Springer
In this paper we analyze the security of systems based on modular additions, rotations, and XORs (ARX systems). We provide both theoretical support for their security and practical...
135
click to vote
CRYPTO
2000
Springer
15 years 8 months ago
2000
Springer
We put forward a new model for understanding the security of symmetric-key primitives, such as block ciphers. The model captures the fact that many such primitives often consist of...
291
click to vote
LICS
1994
IEEE
15 years 8 months ago
1994
IEEE
Higher-order narrowing is a general method for higher-order equational reasoning and serves for instance as the foundation for the integration of functional and logic programming. ...
107
click to vote
LFP
1992
15 years 5 months ago
1992
We propose a syntactic approach to performing fixed point computation on finite domains. Finding fixed points in finite domains for monotonic functions is an essential task when c...