143 search results - page 18 / 29 » Fixed-Parameter Complexity of Semantics for Logic Programs |
102
click to vote
PLDI
2012
ACM
12 years 12 months ago
2012
ACM
Existing dynamic race detectors suffer from at least one of the following three limitations: (i) space overhead per memory location grows linearly with the number of parallel thre...
105
click to vote
PPDP
2010
Springer
14 years 8 months ago
2010
Springer
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
101
click to vote
WWW
2003
ACM
15 years 10 months ago
2003
ACM
SweetDeal is a rule-based approach to representation of business contracts that enables software agents to create, evaluate, negotiate, and execute contracts with substantial auto...
ICFP
2005
ACM
15 years 9 months ago
2005
ACM
This paper defines PolyAML, a typed functional, aspect-oriented programming language. The main contribution of PolyAML is the seamless integration of polymorphism, run-time type a...
ICFP
2007
ACM
15 years 9 months ago
2007
ACM
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...