828 search results - page 3 / 166 » Bounded Hairpin Completion |
TPDS
1998
13 years 7 months ago
1998
—The way the processes in a parallel program are scheduled on the processors of a multiprocessor system affects the performance significantly. Finding a schedule of processes to ...
DLOG
2010
13 years 5 months ago
2010
The least common subsumer (lcs) w.r.t general EL-TBoxes does not need to exists in general due to cyclic axioms. In this paper we present an algorithm for computing role-depth boun...
PLDI
2009
ACM
14 years 8 months ago
2009
ACM
The serious bugs and security vulnerabilities facilitated by C/C++'s lack of bounds checking are well known, yet C and C++ remain in widespread use. Unfortunately, C's a...
IGPL
2011
13 years 2 months ago
2011
In this note we present a completion for the variety of bounded distributive quasi lattices, and, inspired by a well-known idea of L.L. Maksimova [14], we apply this result in prov...
CAV
2005
Springer
14 years 1 months ago
2005
Springer
Bounded model checking is an efficient method for finding bugs in system designs. The major drawback of the basic method is that it cannot prove properties, only disprove them. R...