4192 search results - page 497 / 839 » Probabilistic Logic Programming |
266
click to vote
POPL
2009
ACM
16 years 5 months ago
2009
ACM
ibe an abstract interpretation based framework for proving relationships between sizes of memory partitions. Instances of this framework can prove traditional properties such as m...
246
click to vote
POPL
2008
ACM
16 years 4 months ago
2008
ACM
The C language definition leaves the sizes and layouts of types partially unspecified. When a C program makes assumptions about type layout, its semantics is defined only on platf...
137
click to vote
POPL
2010
ACM
16 years 1 months ago
2010
ACM
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
142
click to vote
PEPM
2009
ACM
15 years 9 months ago
2009
ACM
A requirement of any source language is to be rich in features and concise to use by the programmers. As a drawback, it is often too complex to analyse, causing research studies t...
131
click to vote
QEST
2008
IEEE
15 years 11 months ago
2008
IEEE
We present Hintikka games for formulae of the probabilistic temporal logic PCTL and countable labeled Markov chains as models, giving an operational account of the denotational se...