643 search results - page 106 / 129 » Semantic Determinism and Functional Logic Program Properties |
116
click to vote
HASKELL
2009
ACM
15 years 4 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...
PLDI
2012
ACM
12 years 12 months ago
2012
ACM
In this article we present a general method for achieving global static analyzers that are precise, sound, yet also scalable. Our method generalizes the sparse analysis techniques...
AEI
2010
14 years 9 months ago
2010
nizing multiple forms of information and knowledge processing on different levels of abstraction in a structured and principled manner. We propose knowledge processing middleware a...
107
click to vote
FOIKS
2006
Springer
15 years 1 months ago
2006
Springer
It is claimed in [45] that first-order theorem provers are not efficient for reasoning with ontologies based on description logics compared to specialised description logic reasone...
138
Voted
POPL
2012
ACM
13 years 5 months ago
2012
ACM
It is becoming increasingly important for applications to protect sensitive data. With current techniques, the programmer bears the burden of ensuring that the application’s beh...