2540 search results - page 169 / 508 » Abstract Logics as Dialgebras |
152
click to vote
TPHOL
2003
IEEE
15 years 11 months ago
2003
IEEE
Abstract. We show that certain input-output relations, termed inductive invariants are of central importance for termination proofs of algorithms defined by nested recursion. Indu...
191
click to vote
ERLANG
2003
ACM
15 years 11 months ago
2003
ACM
In this paper, some experiences of using the concurrent functional language Erlang to implement a classical vertical application, a risk management information system, are present...
152
click to vote
AIIA
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Efficiency of the first-order logic proof procedure is a major issue when deduction systems are to be used in real environments, both on their own and as a component of ...
185
click to vote
ASP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Ordered Choice Logic Programming (OCLP) allows for preferencebased decision-making with multiple alternatives and without the burden of any form of negation. This complet...
222
click to vote
CHES
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In this paper a compact FPGA architecture for the AES algorithm with 128-bit key targeted for low-cost embedded applications is presented. Encryption, decryption and key ...