Sciweavers

122 search results - page 6 / 25
» Computing Properties of Numerical Imperative Programs by Sym...
Sort
View
ESOP
2005
Springer
15 years 3 months ago
Computationally Sound, Automated Proofs for Security Protocols
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches relies on a computational model that considers issues of complexity and ...
Véronique Cortier, Bogdan Warinschi
DCC
2005
IEEE
15 years 9 months ago
Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
Amir Said
75
Voted
COMPSAC
2008
IEEE
15 years 4 months ago
Constraint Reasoning in Path-Oriented Random Testing
Path-oriented Random Testing (PRT) aims at generating a uniformly spread out sequence of random test data that activate a single control flow path within an imperative program. T...
Arnaud Gotlieb, Matthieu Petit
JLP
2007
86views more  JLP 2007»
14 years 9 months ago
Typing noninterference for reactive programs
We propose a type system to enforce the security property of noninterference in a core reactive language, obtained by extending the imperative language of Volpano, Smith and Irvin...
Ana Almeida Matos, Gérard Boudol, Ilaria Ca...
IJHPCA
2002
101views more  IJHPCA 2002»
14 years 9 months ago
SCALA: A Performance System For Scalable Computing
Lack of effective performance-evaluation environments is a major barrier to the broader use of high performance computing. Conventional performance environments are based on profi...
Xian-He Sun, Thomas Fahringer, Mario Pantano