Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 8 of 8 for “"Partial Order Reduction"”.
-
Partial Order Reduction for Planning
Partial Order Reduction: POR) is a technique that reduces the search space by recognizing interchangeable orders between actions and expanding only a subset of all possible orders during the search. It has been extensively studied in model checking and has proven to be an enabling technique for …
-
Systematic testing for actor programs
… and the key source of non-determinism is the order in which messages are delivered to and processed by the actors. As a result, errors may occur in actor programs due to the incorrect interleaving of messages, conflicting constraints on what messages can be delivered, or errors in the …
-
Explicit-State Model Checking of Concurrent x86-64 Assembly
… of concurrent x86-64 assembly programs, via Partial Order Reduction (POR). xavier{} presents a realistic platform for systematically exploring and analyzing the state-space of concurrent x86 assembly programs, with the aim of detecting bugs via assertion failures in mainstream programs. …
-
Compositional analysis of networked cyber-physical systems: safety and privacy
… action sequences (or traces). We develop a partial order reduction method for computing the reach set for these systems. Our approach uses the observation that some action pairs are approximately independent, such that executing these actions in any order results in states that are close to …
-
Directed search for the verification of communication protocols
… <br>explore the state space of a system in order to establish whether or <br>not it behaves correctly. The main drawback of such methods is the state explosion problem. The size of the state space can grow <br>exponentially in the number of components of the system, especially in …
-
Dynamic Invariant Generation for Concurrent Programs
We propose a fully automated and dynamic method for generating likely invariants from multithreaded programs and then leveraging these invariants to infer atomic regions and diagnose concurrency errors in the software code. Although existing methods for dynamic invariant generation perform …
-
Practical verification of network planes
… suite of optimizations including state hashing, partial order reduction, and policy-based pruning, Plankton successfully verifies policies in industrial-scale networks quickly and compactly, at times reaching a 10000× speedup compared to the state of the art. Then, we discuss how the model …
-
Efficient testing of actor programs with non-deterministic behaviors
… asynchronous messages, and depending on the order in which they receive messages, they may exhibit different behaviors. This non-determinism brings significant challenges in testing techniques; to make sure that an actor program is correct, conceptually all possible interleavings of message …