SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
On a distributed memory machine, hand-coded message passing leads to the most efficient execution, but it is difficult to use. Parallelizing compilers can approach the performance...
Partitioned parallel radix sort is a parallel radix sort that shortens the execution time by modifying the load balanced radix sort which is known one of the fastest internal sort...
Shin-Jae Lee, Minsoo Jeon, Andrew Sohn, Dongseung ...
Abstract— Recently we proposed algorithms for concurrent execution on multiple clusters [9]. In this case, data partitioning is done at two levels; first, the data is distribute...
Chen Yu, Dan C. Marinescu, Howard Jay Siegel, John...
We survey logic-based and automata-based languages and techniques for the speci cation and veri cation of real-time systems. In particular, we discuss three syntactic extensions of...