393 search results - page 45 / 79 » Probabilistic Description Logic Programs |
88
Voted
LCPC
2001
Springer
15 years 5 months ago
2001
Springer
Information gathered by the existing pointer analysis techniques can be classified as must aliases or definitely-points-to relationships, which hold for all executions, and may a...
103
click to vote
AGP
2003
IEEE
15 years 5 months ago
2003
IEEE
In ordered logic programs, i.e. partially ordered sets of clauses where smaller rules carry more preference, inconsistencies, which appear as conflicts between applicable rules, a...
DAC
1998
ACM
16 years 1 months ago
1998
ACM
Abstract-Our strategy for automatic generation of functional vectors is based on exercising selected paths in the given hardware description language (HDL) model. The HDL model des...
117
Voted
TPHOL
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract. We present a comprehensive set of tactics that make it practical to use separation logic in a proof assistant. These tactics enable the verification of partial correctne...
116
Voted
ICALP
2009
Springer
16 years 24 days ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...