Sciweavers

4257 search results - page 103 / 852
» The Logical Modularity of Programs
Sort
View
CCS
2005
ACM
15 years 8 months ago
A modular correctness proof of IEEE 802.11i and TLS
The IEEE 802.11i wireless networking protocol provides mutual authentication between a network access point and user devices prior to user connectivity. The protocol consists of s...
Changhua He, Mukund Sundararajan, Anupam Datta, An...
135
Voted
CADE
2004
Springer
15 years 8 months ago
Improved Modular Termination Proofs Using Dependency Pairs
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...
René Thiemann, Jürgen Giesl, Peter Sch...
GLVLSI
2007
IEEE
166views VLSI» more  GLVLSI 2007»
15 years 6 months ago
Efficient pipelining for modular multiplication architectures in prime fields
This paper presents a pipelined architecture of a modular Montgomery multiplier, which is suitable to be used in public key coprocessors. Starting from a baseline implementation o...
Nele Mentens, Kazuo Sakiyama, Bart Preneel, Ingrid...
112
Voted
CEC
2009
IEEE
15 years 9 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...
109
Voted
CAV
2010
Springer
157views Hardware» more  CAV 2010»
15 years 6 months ago
Local Verification of Global Invariants in Concurrent Programs
We describe a practical method for reasoning about realistic concurrent programs. Our method allows global two-state invariants that restrict update of shared state. We provide sim...
Ernie Cohen, Michal Moskal, Wolfram Schulte, Steph...