224 search results - page 15 / 45 » Program Analysis Probably Counts |
LREC
2010
14 years 11 months ago
2010
Broad-coverage language resources which provide prior linguistic knowledge must improve the accuracy and the performance of NLP applications. We are constructing a broad-coverage ...
116
click to vote
CASES
2004
ACM
15 years 3 months ago
2004
ACM
Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditio...
AGP
1995
IEEE
15 years 1 months ago
1995
IEEE
The main difficulty in the formalization of a static analysis framework for CC programs is probably related to the correct approximation of the entailment relation between constrai...
SPIN
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...
75
Voted
APLAS
2007
ACM
15 years 1 months ago
2007
ACM
This paper studies types and probabilistic bisimulations for a timed -calculus as an effective tool for a compositional analysis of probabilistic distributed behaviour. The types c...