Deadlock adalah masalah serius dalam sistem operasi komputer yang terjadi ketika dua atau lebih proses saling menunggu sumber daya yang sedang digunakan oleh proses lain sehingga eksekusi proses terhenti. Artikel ini membahas pemahaman... more
Konkurensi adalah salah satu konsep fundamental dalam sistem operasi yang berperan penting dalam mengelola efisiensi dan pemanfaatan sumber daya sistem. Konsep ini memungkinkan beberapa proses atau thread berjalan secara bersamaan, baik... more
Concurrent executions are highly nondeterminisitic Rare thread interleavings result in Heisenbugs Difficult to find, reproduce, and debug Observing the bug can "fix" it Adding a print statement can change the scheduling behavior... more
< p>Automatic detection of access control violations in software applications is a challenging problem. Insecure Direct Object Reference (IDOR) is among top-ranked vulnerabilities, which violates access control policies and cannot be yet... more
Parallel execution of multiple threads of a web application will result in server-side races if the web application is not synchronized correctly. Server-side race is susceptible to flaws in the relation between the server and the... more
This report focuses on the execution of multithreaded programs and finding bugs and errors in those programs. Testing is done to determine if the code written runs correctly or not. The report also covers comparison of traditional testing... more
Shared-memory parallel programs are hard to get right. A major challenge is that language and hardware memory models allow unexpected, erroneous behaviors for executions containing data races. Researchers have introduced dynamic analyses... more
We address the problem of testing and debugging concurrent, distributed Erlang applications. In concurrent programs, race conditions are a common class of bugs and are very hard to find in practice. Traditional unit testing is normally... more
This paper presents a visualization tool that provides the overall information of process synchronization based on the event services in ARINC-653 applications. The tool visualizes logical synchronization among processes and race... more
This paper presents a visualization tool that provides the overall information of process synchronization based on the event services in ARINC-653 applications. The tool visualizes logical synchronization among processes and race... more
Detecting races is important for debugging sharedmemory parallel programs, because the races result in unintended nondeterministic executions of the programs. Previous on-they techniques to detect races in programs with inter-thread... more
Atomicity is a key correctness property that allows programmers to reason about code regions in isolation. However, programs often fail to enforce atomicity correctly, leading to atomicity violations that are difficult to detect. Dynamic... more
This paper presents a dynamic detector, called Race-653 that locates atomicity races in ARINC-653 applications using an on-the-fly analysis technique. Race-653 consists of 653-Monitor and 653-Detector modules. The 653-Monitor collects... more
The ARINC-653 standard architecture for flight software specifies an application executive which furnishes an application programming interface and defines a hierarchical framework which provides health management for error detection and... more
Absrrucr-This paper addresses the issue of QoS path management in IP networks. We describe a proposal aimed at allowing management through the RSVP 131 protocol of paths selected by a QoS routing algorithm such as those of I1 1,161. The... more
Absrrucr-This paper addresses the issue of QoS path management in IP networks. We describe a proposal aimed at allowing management through the RSVP 131 protocol of paths selected by a QoS routing algorithm such as those of I1 1,161. The... more
Testing of concurrent programs is difficult since the scheduling nondeterminism requires one to test a huge number of different thread interleavings. Moreover, a simple repetition of test executions will typically examine similar... more
Testing of concurrent programs is difficult since the scheduling nondeterminism requires one to test a huge number of different thread interleavings. Moreover, a simple repetition of test executions will typically examine similar... more
Testing of concurrent programs is difficult since the scheduling non-determinism requires one to test a huge number of different thread interleavings. Moreover, a simple repetition of test executions will typically examine similar... more
Programmers often have to spend a significant amount of time inspecting the software code and execution traces to identify the cause of a bug. For a multithreaded program, debugging is even more challenging due to the subtle interactions... more
This paper proposes some new complexity metrics for distributed programs. The metrics are defined bas e d on graph-the o ret i c a 1 rep r e s e n t a t i o ns fo r multiple control flows, multiple data flows, and various p r i m a r y p... more
Absrrucr-This paper addresses the issue of QoS path management in IP networks. We describe a proposal aimed at allowing management through the RSVP 131 protocol of paths selected by a QoS routing algorithm such as those of I1 1,161. The... more
Differential CMOS logic family has potential advantages over the standard static CMOS logic family implemented using NAND/NOR logic. These circuits tend to be faster and require fewer transistors. In this paper, various static and dynamic... more
It is possible to enhance our understanding of what has happened on a computer system by using forensic techniques that do not require prediction of the nature of the attack, the skill of the attacker, or the details of the system... more
Differential CMOS logic family has potential advantages over the standard static CMOS logic family implemented using NAND/NOR logic. These circuits tend to be faster and require fewer transistors. In this paper, various static and dynamic... more
One of the fundamental problems encountered when debugging a parallel program is determining the potential race conditions in the program. A race condition exists when multiple tasks access shared data in an unconstrained order and at... more
this paper.A trace specifies a total ordering of the events performed by the program. For ourpurposes, the trace reflects only one of the orders in which the events could have occurred.A more restrictive definition that is difficult to... more
The paper proposes a novel algorithm called AtomRace for a dynamic detection of data races. Data races are detected as a special case of atomicity violations on atomic sections specially dened to span just particular read/write... more
Testing of concurrent software is difficult due to the nondeterminism present in scheduling of concurrent threads. Existing testing approaches tackle this problem either using a modified scheduler which allows to systematically explore... more
The paper proposes a novel algorithm called AtomRace for a dynamic detection of data races. Data races are detected as a special case of atomicity violations on atomic sections specially dened to span just particular read/write... more
A federation community is a group of federations working together to achieve a common goal. With a federation community, a large-scale simulation can be built using existing simulation federations. The federation community network can... more
MPVisualizer (Message Passing Visualizer) is a tool for the monitoring and debugging of message passing parallel applications with three components: the trace/replay mechanism, the graphical user interface and a central component, called... more
We aim to improve reliability of multithreaded programs by proposing a dynamic detector that detects potentially erroneous program executions and their causes. We design and evaluate a Serializability Violation Detector (SVD) that has two... more
In real world multithreaded programming we faces deadlocks. The present theme just provide warning scenarios , which may or may not be real deadlock . To overcome, the problem we use ASN algorithm so that they contain a number of 15... more
A noise maker is a tool that seeds a concurrent program with conditional synchronization primitives (such as yield()) for the purpose of increasing the likelihood that a bug manifest itself. This work explores the theory and practice of... more
Finding bugs due to race conditions in multi-threaded programs is difficult, mainly because there are many possible interleavings, any of which may contain a fault. In this work we present a methodology for testing multi-threaded programs... more
One of the fundamental problems encountered when debugging a parallel program is determining the potential race conditions in the program. A race condition exists when multiple tasks access shared data in an unconstrained order and at... more
One of the fundamental problems encountered when debugging a parallel program is determining the race conditions in the program. This paper presents a tool for automatically detecting data races in parallel programs by analyzing program... more
this paper.A trace specifies a total ordering of the events performed by the program. For ourpurposes, the trace reflects only one of the orders in which the events could have occurred.A more restrictive definition that is difficult to... more
A noise maker is a tool that seeds a concurrent program with conditional synchronization primitives (such as yield()) for the purpose of increasing the likelihood that a bug manifest itself. This work explores the theory and practice of... more
Concurrency bugs are becoming increasingly important due to the prevalence of concurrent programs. A fundamental problem of concurrent program bug detection and testing is that the interleaving space is too large to be thoroughly... more
Multicore hardware is making concurrent programs pervasive. Unfortunately, concurrent programs are prone to bugs. Among different types of concurrency bugs, atomicity violation bugs are common and important. Existing techniques to detect... more
This paper presents a visualization tool that provides the overall information of process synchronization based on the event services in ARINC-653 applications. The tool visualizes logical synchronization among processes and race... more
This paper presents a dynamic detector, called Race-653 that locates atomicity races in ARINC-653 applications using an on-the-fly analysis technique. Race-653 consists of 653-Monitor and 653-Detector modules. The 653-Monitor collects... more