One of the natural examples to the power of concurrency is the ability to count to n with log n concurrent processes. In this work we study the cost of counting within weaker types of concurrency, where no cooperation takes place between the concurrent processes, except when time comes to decide whether the input should be accepted. We first study the number of states required for deterministic...

The most critical step for static concurrency analysis of OpenSHMEM is to detect matching unaligned collective synchronization calls within an OpenSHMEM program. Concurrency analysis will be able to detect the regions in the code where two or more OpenSHMEM calls run concurrently and help identify parallel programming errors due to incorrect usage of OpenSHMEM library calls. For the concurrency...

This paper presents a may-happen-in-parallel (MHP) analysis for OO languages based on concurrent objects. In this concurrency model, objects are the concurrency units such that, when a method is invoked on an object o2 from a task executing on object o1, statements of the current task in o1 may run in parallel with those of the (asynchronous) call on o2, and with those of transitively invoked m...

We introduce a new novel emulation by which we show an equivalence between k-Set Consensus and k-concurrency: Any number of processors when given k-Set Consensus can solve wait-free (read-write), any task which can be solved wait-free read-write when concurrency is limited to k, and visa versa. As a result of showing the models equivalent we obtain a generalization of Herlihy’s Universality res...

Fuzz testing, or fuzzing, has become one of the de facto standard techniques for bug finding in software industry. In general, fuzzing provides various inputs to target program with goal discovering un-handled exceptions and crashes. business sectors where time budget is limited, vendors often launch many instances parallel as a common means increasing code coverage. However, most popular tools...