Sökning: "Java Pathfinder"
Hittade 5 uppsatser innehållade orden Java Pathfinder.
1. Trace Visualization with Java Pathfinder using Theia Trace Viewer
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : Java Pathfinder (JPF) is a tool to debug Java-based software running multiple threads or processes, with a textual output that be may hard to understand. Recent development introduced the possibility to generate a trace from JPF and visualize it in Trace Compass (TC), a general-purpose trace viewing application. LÄS MER
2. Execution Trace Visualization for Java Pathfinder using Trace Compass
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : Multi-threading is commonly applied in modern computer programs, bringing many conveniences but also causing concurrency issues. Among the various error debugging tools, Java Pathfinder (JPF) can detect latent errors of multithreaded Java programs through model checking. LÄS MER
3. Executive Summaries in Software Model Checking
Master-uppsats, KTH/Teoretisk datalogi, TCSSammanfattning : Model checking is a technique used to verify whether a model meets a given specification by exhaustively and automatically checking each reachable state in the model. It is a well-developed technique, but it suffers from some issues, perhaps most importantly the state space explosion problem. LÄS MER
4. Configuring Java Pathfinder for concurrent Java programs
Kandidat-uppsats, KTH/Skolan för datavetenskap och kommunikation (CSC)Sammanfattning : Software verification is a field of computer science dedicated to guar- antee that a program runs according to a formalized specification. Of various kinds of verification techniques model checking tries all possi- ble states of a program and makes sure each state satisfies a set of for- malized properties. LÄS MER
5. Theoretical Comparison of Partial Order Reduction: Java Pathfinder vs. Moonwalker
Kandidat-uppsats, KTH/Skolan för datavetenskap och kommunikation (CSC)Sammanfattning : A problem in modern model checkers is the state explosion problem. Many methods exists to reduce the problem whereas partial order reduction is one of the most common methods. The partial order reduction is designed to reduce states that are not relevant for concurrency bugs by making transitions through non-relevant states. LÄS MER