Ant — A Testing Environment for Nondeterministic Parallel Programs

2002 ◽  
pp. 125-132
Author(s):  
Dieter Kranzlmüller ◽  
Martin Maurer ◽  
Markus Löberbauer ◽  
Christian Schaubschläger ◽  
Jens Volkert
2020 ◽  
Vol 4 (POPL) ◽  
pp. 1-32 ◽  
Author(s):  
Sam Westrick ◽  
Rohan Yadav ◽  
Matthew Fluet ◽  
Umut A. Acar
Keyword(s):  

2014 ◽  
Vol 49 (6) ◽  
pp. 15-25 ◽  
Author(s):  
Rishi Surendran ◽  
Raghavan Raman ◽  
Swarat Chaudhuri ◽  
John Mellor-Crummey ◽  
Vivek Sarkar
Keyword(s):  

Author(s):  
S. Blom ◽  
S. Darabi ◽  
M. Huisman ◽  
M. Safari

AbstractA commonly used approach to develop deterministic parallel programs is to augment a sequential program with compiler directives that indicate which program blocks may potentially be executed in parallel. This paper develops a verification technique to reason about such compiler directives, in particular to show that they do not change the behaviour of the program. Moreover, the verification technique is tool-supported and can be combined with proving functional correctness of the program. To develop our verification technique, we propose a simple intermediate representation (syntax and semantics) that captures the main forms of deterministic parallel programs. This language distinguishes three kinds of basic blocks: parallel, vectorised and sequential blocks, which can be composed using three different composition operators: sequential, parallel and fusion composition. We show how a widely used subset of OpenMP can be encoded into this intermediate representation. Our verification technique builds on the notion of iteration contract to specify the behaviour of basic blocks; we show that if iteration contracts are manually specified for single blocks, then that is sufficient to automatically reason about data race freedom of the composed program. Moreover, we also show that it is sufficient to establish functional correctness on a linearised version of the original program to conclude functional correctness of the parallel program. Finally, we exemplify our approach on an example OpenMP program, and we discuss how tool support is provided.


Cybersecurity ◽  
2021 ◽  
Vol 4 (1) ◽  
Author(s):  
Yu Zhang ◽  
Wei Huo ◽  
Kunpeng Jian ◽  
Ji Shi ◽  
Longquan Liu ◽  
...  

AbstractSOHO (small office/home office) routers provide services for end devices to connect to the Internet, playing an important role in cyberspace. Unfortunately, security vulnerabilities pervasively exist in these routers, especially in the web server modules, greatly endangering end users. To discover these vulnerabilities, fuzzing web server modules of SOHO routers is the most popular solution. However, its effectiveness is limited due to the lack of input specification, lack of routers’ internal running states, and lack of testing environment recovery mechanisms. Moreover, existing works for device fuzzing are more likely to detect memory corruption vulnerabilities.In this paper, we propose a solution ESRFuzzer to address these issues. It is a fully automated fuzzing framework for testing physical SOHO devices. It continuously and effectively generates test cases by leveraging two input semantic models, i.e., KEY-VALUE data model and CONF-READ communication model, and automatically recovers the testing environment with power management. It also coordinates diversified mutation rules with multiple monitoring mechanisms to trigger multi-type vulnerabilities. With the guidance of the two semantic models, ESRFuzzer can work in two ways: general mode fuzzing and D-CONF mode fuzzing. General mode fuzzing can discover both issues which occur in the CONF and READ operation, while D-CONF mode fuzzing focus on the READ-op issues especially missed by general mode fuzzing.We ran ESRFuzzer on 10 popular routers across five vendors. In total, it discovered 136 unique issues, 120 of which have been confirmed as 0-day vulnerabilities we found. As an improvement of SRFuzzer, ESRFuzzer have discovered 35 previous undiscovered READ-op issues that belong to three vulnerability types, and 23 of them have been confirmed as 0-day vulnerabilities by vendors. The experimental results show that ESRFuzzer outperforms state-of-the-art solutions in terms of types and number of vulnerabilities found.


2014 ◽  
Vol 49 (8) ◽  
pp. 389-390
Author(s):  
Kunal Agrawal ◽  
Jeremy T. Fineman ◽  
Brendan Sheridan ◽  
Jim Sukha ◽  
Robert Utterback

1993 ◽  
Vol 28 (8) ◽  
pp. 99-108 ◽  
Author(s):  
Michael Philippsen ◽  
Ernst A. Heinz ◽  
Paul Lukowicz
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document