6554 search results - page 909 / 1311 » Constraint Logic Programming |
146
click to vote
ENTCS
2006
15 years 6 months ago
2006
The goal of this paper is to translate (fragments of) the quantified discrete duration calculus QDDC, proposed by P. Pandya, into symbolic acceptors with counters. Acceptors are w...
225
click to vote
ENTCS
2006
15 years 6 months ago
2006
We present a runtime verification framework for Java programs. Properties can be specified in Linear-time Temporal Logic (LTL) over AspectJ pointcuts. These properties are checked...
177
click to vote
ENTCS
2007
15 years 6 months ago
2007
Many modern program verifiers translate the program to be verified and its specification into a simple intermediate representation and then compute verification conditions on ...
168
click to vote
DAM
2002
15 years 6 months ago
2002
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...
165
click to vote
CAP
2010
15 years 1 months ago
2010
How much of existing computer algebra libraries is amenable to automatic parallelization? This is a difficult topic, yet of practical importance in the era of commodity multicore ...