Sciweavers

2880 search results - page 296 / 576
» Types are calling conventions
Sort
View
SPC
2005
Springer
16 years 4 days ago
A Theorem Proving Approach to Analysis of Secure Information Flow
Abstract. Most attempts at analysing secure information flow in programs are based on domain-specific logics. Though computationally feahese approaches suffer from the need for ...
Ádám Darvas, Reiner Hähnle, Dav...
GRID
2005
Springer
16 years 3 days ago
Bridging organizational network boundaries on the grid
— The Grid offers significant opportunities for performing wide area distributed computing, allowing multiple organizations to collaborate and build dynamic and flexible virtual ...
Jefferson Tan, David Abramson, Colin Enticott
SIGCSE
2004
ACM
140views Education» more  SIGCSE 2004»
16 years 3 days ago
CS1 assessment using memory diagrams
Understanding the execution of an object-oriented program can be a challenge for a student starting a CS1 course. We believe that a type of diagram that we call a memory diagram c...
Mark A. Holliday, David Luginbuhl
ACISP
2004
Springer
16 years 2 days ago
Weak Property of Malleability in NTRUSign
A new type of signature scheme, called NTRUSign, based on solving the approximately closest vector problem in a NTRU lattice was proposed at CT-RSA’03. However no security proof ...
SungJun Min, Go Yamamoto, Kwangjo Kim
GECCO
2004
Springer
105views Optimization» more  GECCO 2004»
16 years 1 days ago
Softening the Structural Difficulty in Genetic Programming with TAG-Based Representation and Insertion/Deletion Operators
In a series of papers [3-8], Daida et. al. highlighted the difficulties posed to Genetic Programming (GP) by the complexity of the structural search space, and attributed the probl...
Nguyen Xuan Hoai, Robert I. McKay