183 search results - page 25 / 37 » Applied Logic without Psychologism |
198
click to vote
CADE
2005
Springer
16 years 6 months ago
2005
Springer
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
174
click to vote
ICPP
2007
IEEE
16 years 8 hour ago
2007
IEEE
A self-organizing peer-to-peer system is built upon an application level overlay, whose topology is independent of underlying physical network. A well-routed message path in such ...
146
click to vote
TCC
2007
Springer
15 years 11 months ago
2007
Springer
We prove a computational soundness theorem for symmetric-key encryption protocols that can be used to analyze security against adaptively corrupting adversaries (that is, adversar...
136
click to vote
WILF
2007
Springer
15 years 11 months ago
2007
Springer
The standard approach to information entropy applied to partitions of a universe is equivalently formulated as the entropy of the corresponding crisp identity resolutions, interpre...
158
click to vote
APSEC
2006
IEEE
15 years 11 months ago
2006
IEEE
Testing for time-related behaviors of PLC software is important and should be performed carefully. We propose a structural testing technique on Function Block Diagram(FBD) network...