Sciweavers

1821 search results - page 250 / 365
» Security-Aware Program Transformations
Sort
View
FSTTCS
2008
Springer
15 years 3 months ago
A Hierarchy of Semantics for Non-deterministic Term Rewriting Systems
ABSTRACT. Formalisms involving some degree of nondeterminism are frequent in computer science. In particular, various programming or specification languages are based on term rewr...
Juan Rodríguez-Hortalá
121
Voted
ENTCS
2007
174views more  ENTCS 2007»
15 years 2 months ago
Quantum Patterns and Types for Entanglement and Separability
As a first step toward a notion of quantum data structures, we introduce a typing system for reflecting entanglement and separability. This is presented in the context of classi...
Simon Perdrix
VIROLOGY
2008
121views more  VIROLOGY 2008»
15 years 2 months ago
Constructing malware normalizers using term rewriting
A malware mutation engine is able to transform a malicious program to create a different version of the program. Such mutation engines are used at distribution sites or in self-pro...
Andrew Walenstein, Rachit Mathur, Mohamed R. Chouc...
PC
1998
153views Management» more  PC 1998»
15 years 1 months ago
Compilation Techniques for Out-of-Core Parallel Computations
The difficulty of handling out-of-core data limits the performance of supercomputers as well as the potential of the parallel machines. Since writing an efficient out-of-core ve...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
POPL
2004
ACM
16 years 2 months ago
Free theorems in the presence of seq
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
Janis Voigtländer, Patricia Johann