Infinite-state backward exploration of Boolean broadcast programs

Liu, Peizun; Wahl, Thomas

doi:10.1109/fmcad.2014.6987608

Cited by 10 publications

(10 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…MAPS, MCMT, PFS and UNDIP deal with systems with linear configurations, only. Concerning multithreaded programs, Boom [34] is a tool that applies symbolic algorithms, see, e.g., [21,25,26,20], to verify counter abstractions of multithreaded programs. The algorithms behind the tool go beyond backward search.…”

Section: Related Workmentioning

confidence: 99%

Logic-based Verification of the Distributed Dining Philosophers Protocol

Delzanno

2018

View full text Add to dashboard Cite

We present a logic-based framework for the specification and validation of distributed protocols. Our specification language is a logic-based presentation of update rules for arbitrary graphs. Update rules are specified via conditional rewriting rules defined over a relational language. We focus our attention on unary and binary relations as a way to specify predicates over nodes and edges of a graph. For the considered language, we define assertions that can be applied to specify correctness properties for arbitrary configurations. We apply the language to model the distributed version of the Dining Philosopher Protocol. The protocol is defined for asynchronous processes distributed over a graph with arbitrary topology. We propose then validation methods based on source to source transformations and deductive reasoning. We apply the resulting method to provide a succint correctness proof of the considered case-study.

show abstract

Section: Related Workmentioning

confidence: 99%

Logic-based Verification of the Distributed Dining Philosophers Protocol

Delzanno

2018

View full text Add to dashboard Cite

show abstract

“…The problem with such a translation from B to M is of course the potential blow-up: the nominal state space S of M is exponential in the number of global and local variables. This problem has long been known and has led to sophisticated on-the-fly temporal-logic model checkers such as Spin [17], but also to ad-hoc re-implementations of specific exploration algorithms [8,24]. In the rest of this paper we describe an API that automates the construction of on-the-fly program state explorers.…”

Section: From Boolean Programs To Thread Transition Systemsmentioning

confidence: 99%

“…via weakest preconditions [24]. This idea was presented in [24] for the case of Abdulla's backward search algorithm [1].…”

Section: From Boolean Programs To Thread Transition Systemsmentioning

confidence: 99%

“…On-the-fly techniques for unbounded-thread algorithms applied to Boolean programs are given in tools by Basler et al [8], and by Liu et al [24]. Both are reimplementations of the algorithms they are targeting, which is the Karp-Miller procedure for VASS in the former case, and the backward search algorithm for broadcast Petri nets in the latter.…”

Section: Related Workmentioning

confidence: 99%

“…For these reasons we have added dedicated support for this algorithm to Ijit, in the form of an implementation of the cover preimage operation (1) applied directly to a multi-threaded Boolean program state. The idea for this implementation of (1) is borrowed from [24].…”

Section: B Benchmark Algorithmsmentioning

confidence: 99%

See 2 more Smart Citations

IJIT: An API for Boolean Program Analysis with Just-in-Time Translation

Liu

Wahl

2017

Software Engineering and Formal Methods

Self Cite

View full text Add to dashboard Cite

Exploration algorithms for explicit-state transition systems are a core back-end technology in program verification. They can be applied to programs by generating the transition system on the fly, avoiding an expensive up-front translation. An on-the-fly strategy requires significant modifications to the implementation, into a form that stores states directly as valuations of program variables. Performed manually on a per-algorithm basis, such modifications are laborious and error-prone. In this paper we present the Ijit Application Programming Interface (API), which allows users to automatically transform a given transition system exploration algorithm to one that operates on Boolean programs. The API converts system states temporarily to program states just in time for expansion via image computations, forward or backward. Using our API, we have effortlessly extended various non-trivial (e.g. infinitestate) model checking algorithms to operate on multi-threaded Boolean programs. We demonstrate the ease of use of the API, and present a case study on the impact of the just-in-time translation on these algorithms.

show abstract