272 search results - page 40 / 55 » Programming languages capturing complexity classes |
ECOOP
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. Our research group has analyzed many industrial, frameworkbased applications. In these applications, simple functionality often requires excessive runtime activity. It is...
POPL
2006
ACM
14 years 10 months ago
2006
ACM
The TCP/IP protocols and Sockets API underlie much of modern computation, but their semantics have historically been very complex and ill-defined. The real standard is the de fact...
POPL
2006
ACM
14 years 10 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
ICALP
1997
Springer
14 years 1 months ago
1997
Springer
In the 1980's, Bennett introduced computational depth as a formal measure of the amount of computational history that is evident in an object's structure. In particular,...
ICALP
2009
Springer
14 years 10 months ago
2009
Springer
The IEEE standardized Property Specification Language, PSL for short, extends the well-known linear-time temporal logic LTL with so-called semi-extended regular expressions. PSL an...