Sciweavers

3185 search results - page 202 / 637
» Domain and language evaluation results
Sort
View
FM
2009
Springer
104views Formal Methods» more  FM 2009»
16 years 1 months ago
A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis
Abstract. We present a new domain for analyzing must-equalities between address expressions. The domain is a smooth combination of Herbrand and affine equalities which enables us t...
Helmut Seidl, Vesal Vojdani, Varmo Vene
CP
2007
Springer
16 years 25 days ago
Boosting Probabilistic Choice Operators
Probabilistic Choice Operators (PCOs) are convenient tools to model uncertainty in CP. They are useful to implement randomized algorithms and stochastic processes in the concurrent...
Matthieu Petit, Arnaud Gotlieb
TPLP
2002
69views more  TPLP 2002»
15 years 6 months ago
Soundness, idempotence and commutativity of set-sharing
It is important that practical data-flow analyzers are backed by reliably proven theoretical Abstract interpretation provides a sound mathematical framework and necessary properti...
Patricia M. Hill, Roberto Bagnara, Enea Zaffanella
ANLP
2000
92views more  ANLP 2000»
15 years 8 months ago
Tagging Sentence Boundaries
In this paper we tackle sentence boundary disambiguation through a part-of-speech (POS) tagging framework. We describe necessary changes in text tokenization and the implementatio...
Andrei Mikheev
ECOOP
1999
Springer
15 years 11 months ago
Dynamic Query-Based Debugging
Program errors are hard to find because of the cause-effect gap between the time when an error occurs and the time when the error becomes apparent to the programmer. Although debu...
Raimondas Lencevicius, Urs Hölzle, Ambuj K. S...