272 search results - page 37 / 55 » Programming languages capturing complexity classes |
DBPL
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. We propose a framework in which query sizes can be estimated from arbitrary statistical assertions on the data. In its most general form, a statistical assertion states t...
ICALP
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
ECBS
2006
IEEE
14 years 3 months ago
2006
IEEE
For complex systems that are reusing intellectual property components, functional and compositional design correctness are an important part of the design process. Common system l...
SIGADA
2001
Springer
14 years 2 months ago
2001
Springer
Automatic software testing is gradually becoming accepted practice in the software industry. The shrinking development cycle and higher expectation of software quality are forcing...
POPL
2010
ACM
14 years 7 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)...