397 search results - page 45 / 80 » Optimizing Modular Logic Languages |
ESOP
2004
Springer
15 years 3 months ago
2004
Springer
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
DOCENG
2009
ACM
15 years 4 months ago
2009
ACM
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
173
click to vote
POPL
2007
ACM
15 years 10 months ago
2007
ACM
This work presents a framework for fusing flow analysis and theorem proving called logic-flow analysis (LFA). The framework itthe reduced product of two abstract interpretations: ...
122
click to vote
DLOG
2011
14 years 1 months ago
2011
W3C currently extends the SPARQL query language with so-called entailment regimes, which define how queries are evaluated using logical entailment relations. We describe a sound a...
182
click to vote
POPL
2004
ACM
15 years 10 months ago
2004
ACM
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...