Fair Model Checking with Process Counter Abstraction

Sun, Jun; Liu, Yang; Roychoudhury, Abhik; Liu, Shanshan; Dong, Jin Song

doi:10.1007/978-3-642-05089-3_9

Cited by 25 publications

(17 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…PAT is designed for systematic validation of distributed/concurrent systems using state-of-the-art model checking techniques [25,26]. It can be considered as a framework for manufacturing model-checkers.…”

Section: Discussionmentioning

confidence: 99%

Verification of Orchestration Systems Using Compositional Partial Order Reduction

Tan

Liu

Sun

et al. 2011

Formal Methods and Software Engineering

Self Cite

View full text Add to dashboard Cite

Abstract.Orc is a computation orchestration language which is designed to specify computational services, such as distributed communication and data manipulation, in a concise and elegant way. Four concurrency primitives allow programmers to orchestrate site calls to achieve a goal, while managing timeouts, priorities, and failures. To guarantee the correctness of Orc model, effective verification support is desirable. Orc has a highly concurrent semantics which introduces the problem of state-explosion to search-based verification methods like model checking. In this paper, we present a new method, called Compositional Partial Order Reduction (CPOR), which aims to provide greater state-space reduction than classic partial order reduction methods in the context of hierarchical concurrent processes. Evaluation shows that CPOR is more effective in reducing the state space than classic partial order reduction methods.

show abstract

Section: Discussionmentioning

confidence: 99%

Verification of Orchestration Systems Using Compositional Partial Order Reduction

Tan

Liu

Sun

et al. 2011

Formal Methods and Software Engineering

Self Cite

View full text Add to dashboard Cite

show abstract

“…Rtimer), and handle them accordingly. Furthermore, it is frequent that behaviorally similar processes are run in parallel, thus we can use symmetry reduction or even process counter abstraction [13] to yield a smaller state space for verification. The general idea is grouping behaviorally similar processes while not keeping the process identifer.…”

Section: E Timed Refinementmentioning

confidence: 99%

Towards Verification of a Service Orchestration Language

Tan

2010

2010 Fourth International Conference on Secure Software Integration and Reliability Improvement Companion

View full text Add to dashboard Cite

Recently, Orc is proposed as a powerful yet elegant language for distributed and concurrent programming which provides computational services such as distributed communication and data manipulation via sites. With a few concurrency primitives, programmers are able to orchestrate the invocation of sites to achieve a goal, and meanwhile, manage timeouts, priorities, and failures. To guarantee the correctness of Orc models, effective verification support is desirable. In this work, we present an automatic approach to verify different properties against Orc models using model checking techniques. To further improve the performance, advanced reduction techniques, like partial order reduction, are proposed.

show abstract

“…First, the negation of an LTL formula is converting into an equivalent Büchi automaton; and then accepting strong connected components (SCC) in the synchronous product of the automaton and the model are examined in order to find a counterexample. Notice that the SCC-based algorithm allows us to model check with fairness [27], which often plays an important role in proving liveness properties of WSNs.…”

Section: Implementation and Evaluationmentioning

confidence: 99%

Towards a Model Checker for NesC and Wireless Sensor Networks

Zheng

Sun

Liu

et al. 2011

Formal Methods and Software Engineering

Self Cite

View full text Add to dashboard Cite

Abstract. Wireless sensor networks (WSNs) are expected to run unattendedly for critical tasks. To guarantee the correctness of WSNs is important, but highly nontrivial due to the distributed nature. In this work, we present an automatic approach to directly verify WSNs built with TinyOS applications implemented in the NesC language. To achieve this target, we firstly define a set of formal operational semantics for most of the NesC language constructs for the first time. This allows us to capture the behaviors of sensors using labelled transition systems (LTSs), which are the underlying semantic models of NesC programs. Secondly, WSNs are modeled as the composition of sensors with a network topology. Verifications of individual sensors and WSNs become possible by exploring the corresponding LTSs using techniques like model checking. With substantial engineering efforts, we implement this approach in a toolkit named NesC@PAT, to support verifications of deadlock-freeness, state reachability and temporal properties for WSNs.NesC@PAT has been applied to analyze and verify WSNs, with unknown bugs being detected. To the best of our knowledge, NesC@PAT is the first model checker which takes NesC language as the modeling language and completely preserves the interrupt-driven feature of the TinyOS execution model.

show abstract

Fair Model Checking with Process Counter Abstraction

Cited by 25 publications

References 30 publications

Verification of Orchestration Systems Using Compositional Partial Order Reduction

Verification of Orchestration Systems Using Compositional Partial Order Reduction

Towards Verification of a Service Orchestration Language

Towards a Model Checker for NesC and Wireless Sensor Networks

Contact Info

Product

Resources

About