Sciweavers

77 search results - page 8 / 16
» Keeping Bits Safe: How Hard Can It Be
Sort
View
ANLP
1992
109views more  ANLP 1992»
13 years 8 months ago
The Acquisition of Lexical Knowledge from Combined Machine-Readable Dictionary Sources
This paper is concerned with the question of how to extract lexical knowledge from MachineReadable Dictionaries (MRDs) within a lexical database which integrates a lexicon develop...
Antonio Sanfilippo, Victor Poznanski
ECOOP
2008
Springer
13 years 9 months ago
Computing Stack Maps with Interfaces
Abstract. Lightweight bytecode verification uses stack maps to annotate Java bytecode programs with type information in order to reduce the verification to type checking. This pape...
Frédéric Besson, Thomas P. Jensen, T...
ACSAC
2010
IEEE
13 years 5 months ago
Fast and practical instruction-set randomization for commodity systems
Instruction-set randomization (ISR) is a technique based on randomizing the "language" understood by a system to protect it from code-injection attacks. Such attacks wer...
Georgios Portokalidis, Angelos D. Keromytis
ECRTS
2010
IEEE
13 years 8 months ago
Making DRAM Refresh Predictable
Embedded control systems with hard real-time constraints require that deadlines are met at all times or the system may malfunction with potentially catastrophic consequences. Sched...
Balasubramanya Bhat, Frank Mueller
TSC
2008
144views more  TSC 2008»
13 years 7 months ago
Probabilistic QoS and Soft Contracts for Transaction-Based Web Services Orchestrations
Service level agreements (SLAs), or contracts, have an important role in web services. These contracts define the obligations and rights between the provider of a web service and i...
Sidney Rosario, Albert Benveniste, Stefan Haar, Cl...