Sciweavers

546 search results - page 62 / 110
» Parametric Program Slicing
Sort
View
POPL
1997
ACM
14 years 21 days ago
First-class Polymorphism with Type Inference
Languages like ML and Haskell encourage the view of values as first-class entities that can be passed as arguments or results of functions, or stored as components of data struct...
Mark P. Jones
ICALP
2010
Springer
13 years 8 months ago
What Is a Pure Functional?
Abstract. Given an ML function f : (int->int)->int how can we rigorously specify that f is pure, i.e., produces no side-effects other than those arising from calling its func...
Martin Hofmann, Aleksandr Karbyshev, Helmut Seidl
IPL
2010
81views more  IPL 2010»
13 years 7 months ago
An alternative characterization of weak order dependence
Control dependence forms the basis for many program analyses, such as program slicing. Recent work on control dependence analysis has led to new definitions of dependence that cat...
Torben Amtoft, Kelly Androutsopoulos, David Clark,...
SPAA
2010
ACM
14 years 1 months ago
Transactions in the jungle
Transactional memory (TM) has shown potential to simplify the task of writing concurrent programs. Inspired by classical work on databases, formal definitions of the semantics of...
Rachid Guerraoui, Thomas A. Henzinger, Michal Kapa...
ACSAC
2006
IEEE
14 years 8 days ago
Data Sandboxing: A Technique for Enforcing Confidentiality Policies
When an application reads private / sensitive information and subsequently communicates on an output channel such as a public file or a network connection, how can we ensure that ...
Tejas Khatiwala, Raj Swaminathan, V. N. Venkatakri...