50 search results - page 8 / 10 » Strict Sequential P-completeness |
PDPTA
2003
13 years 9 months ago
2003
We present a novel approach to parallel Boolean satisfiability (SAT) checking. A distinctive feature of our parallel SAT checker is that it incorporates all essential heuristics ...
ENTCS
2006
13 years 7 months ago
2006
Parkinson, Bornat, and Calcagno recently introduced a logic for partial correctness in which program variables are treated as resource, generalizing earlier work based on separati...
TC
2008
13 years 7 months ago
2008
The Chinese remainder theorem (CRT) and the mixed-radix conversion (MRC) are two classic theorems used to convert a residue number to its binary correspondence for a given moduli s...
AML
1998
13 years 7 months ago
1998
The paper builds on both a simply typed term system PRω and a computation model on Scott domains via so-called parallel typed while programs (PTWP). The former provides a notion ...
ICCAD
1996
IEEE
13 years 11 months ago
1996
IEEE
We give a denotational framework (a "meta model") within which certain properties of models of computation can be understood and compared. It describes concurrent proces...