Sciweavers

365 search results - page 48 / 73
» Using Types as Approximations for Type Checking Prolog Progr...
Sort
View
IFL
2005
Springer
15 years 7 months ago
Polytypic Syntax Tree Operations
Polytypic functional programming has the advantage that it can derive code for generic functions automatically. However, it is not clear whether it is useful for anything other tha...
Arjen van Weelden, Sjaak Smetsers, Rinus Plasmeije...
176
Voted
POPL
2000
ACM
15 years 6 months ago
Enforcing Trace Properties by Program Transformation
We propose an automatic method to enforce trace properties on programs. The programmer specifies the property separately from the program; a program transformer takes the program...
Thomas Colcombet, Pascal Fradet
96
Voted
PLDI
2000
ACM
15 years 6 months ago
Field analysis: getting useful and low-cost interprocedural information
We present a new limited form of interprocedural analysis called field analysis that can be used by a compiler to reduce the costs of modern language features such as objectorien...
Sanjay Ghemawat, Keith H. Randall, Daniel J. Scale...
APLAS
2010
ACM
15 years 2 months ago
Typechecking Higher-Order Security Libraries
Abstract. We propose a flexible method for verifying the security of ML programs that use cryptography and recursive data structures. Our main applications are X.509 certificate ch...
Karthikeyan Bhargavan, Cédric Fournet, Nata...
128
Voted
TSE
1998
114views more  TSE 1998»
15 years 1 months ago
KLAIM: A Kernel Language for Agents Interaction and Mobility
—We investigate the issue of designing a kernel programming language for mobile computing and describe KLAIM, a language that supports a programming paradigm where processes, lik...
Rocco De Nicola, Gian Luigi Ferrari, Rosario Pugli...