237 search results - page 43 / 48 » On the decidability and complexity of reasoning about only k... |
APLAS
2010
ACM
13 years 6 months ago
2010
ACM
We consider programming language aspects of algorithms that operate on data too large to fit into memory. In previous work we have introduced IntML, a functional programming langu...
COCO
2004
Springer
14 years 22 days ago
2004
Springer
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
POPL
2008
ACM
14 years 7 months ago
2008
ACM
Machine-checked proofs of properties of programming languages have become a critical need, both for increased confidence in large and complex designs and as a foundation for techn...
OOPSLA
2007
Springer
14 years 1 months ago
2007
Springer
In runtime monitoring, a programmer specifies a piece of code to execute when a trace of events occurs during program execution. Previous and related work has shown that runtime m...
GIS
1999
ACM
13 years 11 months ago
1999
ACM
In urban areas, city noises represent today a great problem. They are real nuisances for city-dwellers. Noises are caused by traffic, road works, factories, and also by people. So...