Sciweavers

1445 search results - page 34 / 289
» Uniformly Hard Languages
Sort
View
IAW
2003
IEEE
14 years 1 months ago
Insecure Programming: How Culpable is a Language's Syntax?
— Vulnerabilities in software stem from poorly written code. Inadvertent errors may creep in due to programmers not being aware of the security implications of their code. Writin...
Ramkumar Chinchani, Anusha Iyer, Bharat Jayaraman,...
POPL
1997
ACM
13 years 12 months 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
POPL
2000
ACM
13 years 11 months ago
Generalized Certificate Revocation
We introduce a language for creating and manipulating certificates, that is, digitally signed data based on public key cryptography, and a system for revoking certificates. Our ap...
Carl A. Gunter, Trevor Jim
APPROX
2010
Springer
154views Algorithms» more  APPROX 2010»
13 years 9 months ago
The Checkpoint Problem
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
EDM
2009
116views Data Mining» more  EDM 2009»
13 years 5 months ago
Dimensions of Difficulty in Translating Natural Language into First-Order Logic
In this paper, we present a study of a large corpus of student logic exercises in which we explore the relationship between two distinct measures of difficulty: the proportion of s...
Dave Barker-Plummer, Richard Cox, Robert Dale