A Framework for State-Space Exploration of Java-Based Actor Programs

Lauterburg, Steven; Dotta, Mirco; Marinov, Darko; Agha, Gul

doi:10.1109/ase.2009.88

Cited by 41 publications

(67 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We implemented TransDPOR in Basset [17], a tool for the systematic testing of actor programs written in the Scala programming language [12] or the ActorFoundry library for Java [21]. Our TransDPOR code is publicly available with Basset at http://mir.cs.illinois.edu/basset.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

TransDPOR: A Novel Dynamic Partial-Order Reduction Technique for Testing Actor Programs

Tasharofi

Karmani

Lauterburg

et al. 2012

Formal Techniques for Distributed Systems

Self Cite

111

View full text Add to dashboard Cite

Abstract. To detect hard-to-find concurrency bugs, current tools systematically explore all possible interleavings of the transitions in a program. Unfortunately, concurrent programs have a large number of possible interleavings due to nondeterminism. Speeding up such tools requires pruning the state space explored. Partial-order reduction (POR) techniques can substantially prune the number of explored interleavings. These techniques require defining a dependency relation on transitions in the program, and exploit independency among certain transitions to prune the state space. We observe that actor systems, a prevalent class of programs where computation entities communicate by exchanging messages, exhibit a dependency relation among co-enabled transitions with an interesting property: transitivity. This paper introduces a novel dynamic POR technique, TransDPOR, that exploits the transitivity of the dependency relation in actor systems. Empirical results show that leveraging transitivity speeds up exploration by up to two orders of magnitude compared to existing POR techniques.

show abstract

Section: Introductionmentioning

confidence: 99%

“…To compare TransDPOR and DPOR, we implemented TransDPOR in the Basset tool [17]. Basset provides an extensible environment for testing Java-based actor programs written in the Scala Actors library [12] or ActorFoundry [21].…”

mentioning

confidence: 99%

TransDPOR: A Novel Dynamic Partial-Order Reduction Technique for Testing Actor Programs

Tasharofi

Karmani

Lauterburg

et al. 2012

Formal Techniques for Distributed Systems

Self Cite

111

View full text Add to dashboard Cite

show abstract

“…POR techniques use persistent/stubborn sets [15,45] or sleep sets [16] to selectively search the space of reachable states of the concurrent system in a provably complete manner. Dynamic POR [12] and its variants [23,24,32,42] including the recently proposed optimal one [1] significantly improve upon the earlier works by constructing these sets dynamically. Dynamic POR for restrictions of MPI programs where synchronous moves are sufficient have also been explored in [32,40,41].…”

Section: Related Workmentioning

confidence: 84%

Natural proofs for asynchronous programs using almost-synchronous reductions

Desai

Garg

Madhusudan

2014

Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages &Amp; Applications

View full text Add to dashboard Cite

We consider the problem of provably verifying that an asynchronous message-passing system satisfies its local assertions. We present a novel reduction scheme for asynchronous event-driven programs that finds almost-synchronous invariants-invariants consisting of global states where message buffers are close to empty. The reduction finds almostsynchronous invariants and simultaneously argues that they cover all local states. We show that asynchronous programs often have almost-synchronous invariants and that we can exploit this to build natural proofs that they are correct. We implement our reduction strategy, which is sound and complete, and show that it is more effective in proving programs correct as well as more efficient in finding bugs in several programs, compared to current search strategies which almost always diverge. The high point of our experiments is that our technique can prove the Windows Phone USB Driver written in P [9] correct for the responsiveness property, which was hitherto not provable using state-of-the-art model-checkers.

show abstract

“…JPF offers a powerful extension mechanism that allows one to verify programs in many domains. Basset [18] is one such extension currently under development that verifies programs that utilize the actor model of concurrency. This extension has a large suite of JUnit tests that often break as both JPF and Basset improve.…”

Section: A Case Studiesmentioning

confidence: 99%

ReAssert: Suggesting Repairs for Broken Unit Tests

Daniel

Jagannath

Dig

et al. 2009

2009 IEEE/ACM International Conference on Automated Software Engineering

Self Cite

View full text Add to dashboard Cite

Abstract-Developers often change software in ways that cause tests to fail. When this occurs, developers must determine whether failures are caused by errors in the code under test or in the test code itself. In the latter case, developers must repair failing tests or remove them from the test suite. Reparing tests is time consuming but beneficial, since removing tests reduces a test suite's ability to detect regressions. Fortunately, simple program transformations can repair many failing tests automatically.We present ReAssert, a novel technique and tool that suggests repairs to failing tests' code which cause the tests to pass. Examples include replacing literal values in tests, changing assertion methods, or replacing one assertion with several. If the developer chooses to apply the repairs, ReAssert modifies the code automatically. Our experiments show that ReAssert can repair many common test failures and that its suggested repairs correspond to developers' expectations.

show abstract

A Framework for State-Space Exploration of Java-Based Actor Programs

Cited by 41 publications

References 25 publications

TransDPOR: A Novel Dynamic Partial-Order Reduction Technique for Testing Actor Programs

TransDPOR: A Novel Dynamic Partial-Order Reduction Technique for Testing Actor Programs

Natural proofs for asynchronous programs using almost-synchronous reductions

ReAssert: Suggesting Repairs for Broken Unit Tests

Contact Info

Product

Resources

About