Sciweavers

891 search results - page 81 / 179
» Full Abstraction for PCF
Sort
View
ICFP
2008
ACM
14 years 7 months ago
Typed closure conversion preserves observational equivalence
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different languag...
Amal Ahmed, Matthias Blume
FASE
2009
Springer
14 years 2 months ago
Transformation of Type Graphs with Inheritance for Ensuring Security in E-Government Networks
Abstract. E-government services usually process large amounts of confidential data. Therefore, security requirements for the communication between components have to be adhered in...
Frank Hermann, Hartmut Ehrig, Claudia Ermel
IAT
2009
IEEE
14 years 2 months ago
Computing Information Minimal Match Explanations for Logic-Based Matchmaking
Abstract—In semantic matchmaking processes it is often useful, when the obtained match is not full, to provide explanations for the mismatch, to leverage further interaction and/...
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M....
MDM
2009
Springer
118views Communications» more  MDM 2009»
14 years 2 months ago
DigestJoin: Exploiting Fast Random Reads for Flash-Based Joins
Abstract—Flash disks have been an emerging secondary storage media. In particular, there have been portable devices, multimedia players and laptop computers that are configured ...
Yu Li, Sai Tung On, Jianliang Xu, Byron Choi, Haib...
TLCA
2005
Springer
14 years 1 months ago
The Elimination of Nesting in SPCF
We use a fully abstract denotational model to show that nested function calls and recursive definitions can be eliminated from SPCF (a typed functional language with simple non-lo...
James Laird