2432 search results - page 127 / 487 » Cryptographic logical relations |
123
click to vote
IWPSE
2003
IEEE
15 years 6 months ago
2003
IEEE
The dependencies and interrelations between classes and modules affect the maintainability of object-oriented systems. It is therefore important to capture weaknesses of the softw...
96
Voted
CADE
2001
Springer
16 years 29 days ago
2001
Springer
In this paper, we present a syntax-directed termination and reduction checker for higher-order logic programs. The reduction checker verifies parametric higher-order subterm orderi...
92
Voted
FSEN
2007
Springer
15 years 6 months ago
2007
Springer
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be the proof of congruence and, related to this, enhancements of the bisimul...
113
Voted
ILP
1997
Springer
15 years 4 months ago
1997
Springer
Abstract. We present a logical approach to graph theoretical learning that is based on using alphabetic substitutions for modelling graph morphisms. A classi ed graph is represente...
105
Voted
FPL
2008
Springer
15 years 2 months ago
2008
Springer
This paper describes an analytical model, based principally on Rent's Rule, that relates logic architectural parameters to the area efficiency of an FPGA. In particular, the ...