1445 search results - page 116 / 289 » Abstract Interpretation of Logic Programs |
168
click to vote
MKM
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Formal verification of numerical programs is notoriously difficult. On the one hand, there exist automatic tools specialized in floatingpoint arithmetic, such as Gappa...
240
click to vote
POPL
2007
ACM
16 years 3 months ago
2007
ACM
We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate...
123
Voted
LPNMR
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We describe a new software, pbmodels, that uses pseudo-boolean constraint solvers (PB solvers) to compute stable models of logic programs with weight atoms. To this end, ...
126
Voted
APLAS
2007
ACM
15 years 7 months ago
2007
ACM
Abstract. We present a formal framework for syntax directed probabilistic program analysis. Our focus is on probabilistic pointer analysis. We show how to obtain probabilistic poin...
114
click to vote
POPL
2010
ACM
15 years 10 months ago
2010
ACM
ion-Guided Synthesis of Synchronization Martin Vechev IBM Research Eran Yahav IBM Research Greta Yorsh IBM Research We present a novel framework for automatic inference of effici...