Sciweavers

139 search results - page 7 / 28
» Modular difference logic is hard
Sort
View
FPGA
2001
ACM
162views FPGA» more  FPGA 2001»
15 years 2 months ago
Reprogrammable network packet processing on the field programmable port extender (FPX)
A prototype platform has been developed that allows processing of packets at the edge of a multi-gigabit-per-second network switch. This system, the Field Programmable Port Extend...
John W. Lockwood, Naji Naufel, Jonathan S. Turner,...
PLDI
2009
ACM
15 years 4 months ago
On PDG-based noninterference and its modular proof
We present the first machine-checked correctness proof for information flow control (IFC) based on program dependence graphs (PDGs). IFC based on slicing and PDGs is flow-sensi...
Daniel Wasserrab, Denis Lohner, Gregor Snelting
KI
2008
Springer
14 years 9 months ago
Shallow Models for Non-iterative Modal Logics
Abstract. Modal logics see a wide variety of applications in artificial intelligence, e.g. in reasoning about knowledge, belief, uncertainty, agency, defaults, and relevance. From ...
Lutz Schröder, Dirk Pattinson
CEC
2009
IEEE
15 years 4 months ago
Self modifying Cartesian Genetic Programming: Parity
— Self Modifying CGP (SMCGP) is a developmental form of Cartesian Genetic Programming(CGP). It differs from CGP by including primitive functions which modify the program. Beginni...
Simon Harding, Julian Francis Miller, Wolfgang Ban...
FPL
2010
Springer
180views Hardware» more  FPL 2010»
14 years 7 months ago
A Karatsuba-Based Montgomery Multiplier
Abstract--Modular multiplication of long integers is an important building block for cryptographic algorithms. Although several FPGA accelerators have been proposed for large modul...
Gary Chun Tak Chow, Ken Eguro, Wayne Luk, Philip L...