1445 search results - page 138 / 289 » Uniformly Hard Languages |
235
click to vote
POPL
2003
ACM
16 years 4 months ago
2003
ACM
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
146
click to vote
EMSOFT
2007
Springer
15 years 10 months ago
2007
Springer
The emergence of standards for programming real-time systems in Java has encouraged many developers to consider its use for systems previously only built using C, Ada, or assembly...
138
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
240
click to vote
POPL
2008
ACM
16 years 4 months ago
2008
ACM
In language-based security, confidentiality and integrity policies conveniently specify the permitted flows of information between different parts of a program with diverse levels...
150
click to vote
POPL
2010
ACM
16 years 1 months ago
2010
ACM
This paper introduces a new approach to type theory called pure subtype systems. Pure subtype systems differ from traditional approaches to type theory (such as pure type systems)...