3663 search results - page 321 / 733 » Problems in the ontology of computer programs |
217
click to vote
HASKELL
2009
ACM
16 years 1 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
170
click to vote
PODC
2005
ACM
16 years 9 days ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
202
click to vote
SAC
2000
ACM
15 years 11 months ago
2000
ACM
Object-oriented modeling and design is a way of solving problems using models based upon real-world concepts. In this paradigm, the fundamental construct is the object, an entity ...
280
click to vote
TOPLAS
2008
15 years 6 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
150
click to vote
ICSE
2003
IEEE-ACM
16 years 6 months ago
2003
IEEE-ACM
Testing of polymorphism in object-oriented software may require coverage of all possible bindings of receiver classes and target methods at call sites. Tools that measure this cove...