Unbounded-Thread Program Verification using Thread-State Equations

Athanasiou, Konstantinos; Liu, Peizun; Wahl, Thomas

doi:10.1007/978-3-319-40229-1_35

Cited by 19 publications

(25 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For instance, in an approach proposed by the authors [7], which has recently been refined by Geffroy, Leroux and Sutre [9], reachability in continuous Petri nets is used as a pruning criterion inside the classical backward algorithm [10] for deciding coverability in Petri nets. Furthermore, integer over-approximations of VASS and Petri nets have been used as semi-decision procedures for coverability in VASS [11], [12]. In all such application scenarios, those overapproximations have led to decision procedures for coverability problems in VASS and Petri nets that yield an empirically outstanding performance on real-world instances [11], [7], [12], [9].…”

Section: Introductionmentioning

confidence: 99%

“…Furthermore, integer over-approximations of VASS and Petri nets have been used as semi-decision procedures for coverability in VASS [11], [12]. In all such application scenarios, those overapproximations have led to decision procedures for coverability problems in VASS and Petri nets that yield an empirically outstanding performance on real-world instances [11], [7], [12], [9].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Logics for continuous reachability in Petri nets and vector addition systems with states

Blondin

Haase

2017

2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

View full text Add to dashboard Cite

This paper studies sets of rational numbers definable by continuous Petri nets and extensions thereof. First, we identify a polynomial-time decidable fragment of existential FO(Q, +, <) and show that the sets of rationals definable in this fragment coincide with reachability sets of continuous Petri nets. Next, we introduce and study continuous vector addition systems with states (CVASS), which are vector addition systems with states in which counters may hold non-negative rational values, and in which the effect of a transition can be scaled by a positive rational number smaller or equal to one. This class strictly generalizes continuous Petri nets by additionally allowing for discrete control-state information. We prove that reachability sets of CVASS are equivalent to the sets of rational numbers definable in existential FO(Q, +, <) from which we can conclude that reachability in CVASS is NP-complete. Finally, our results explain and yield as corollaries a number of polynomial-time algorithms for decision problems that have recently been studied in the literature. * − → → Q+ (0, 0). Alternatively, M is definable by N if it is a projection of a cross section of R(N †)(0).

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Logics for continuous reachability in Petri nets and vector addition systems with states

Blondin

Haase

2017

2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

View full text Add to dashboard Cite

show abstract

“…To obtain a finer reachability over-approximation, we introduce so-called traps and siphons constraints borrowed from the theory of Petri nets [11,15,16] and successfully applied to a number of analysis problems (see e.g. [5,15,16]). Intuitively, for some subset of transitions U ⊆ T , a U -trap is a set of states P ⊆ Q such that every transition of U that removes an agent from P also moves an agent into P .…”

Section: Strong Consensusmentioning

confidence: 99%

Towards Efficient Verification of Population Protocols

Blondin

Esparza

Jaax

et al. 2017

Proceedings of the ACM Symposium on Principles of Distributed Computing

View full text Add to dashboard Cite

Population protocols are a well established model of computation by anonymous, identical finite state agents. A protocol is well-specified if from every initial configuration, all fair executions reach a common consensus. The central verification question for population protocols is the well-specification problem: deciding if a given protocol is well-specified. Esparza et al. have recently shown that this problem is decidable, but with very high complexity: it is at least as hard as the Petri net reachability problem, which is EXPSPACE-hard, and for which only algorithms of non-primitive recursive complexity are currently known. In this paper we introduce the class WS3 of well-specified strongly-silent protocols and we prove that it is suitable for automatic verification. More precisely, we show that WS3 has the same computational power as general well-specified protocols, and captures standard protocols from the literature. Moreover, we show that the membership problem for WS3 reduces to solving boolean combinations of linear constraints over N. This allowed us to develop the first software able to automatically prove well-specification for all of the infinitely many possible inputs.Comment: 27 pages, 1 figur

show abstract

“…The new approach was based on classical Petri nets analysis techniques, the marking equation and traps [30,31], and utilized an SMT solver to implement the constraint approach. Inspired by Esparza's work, Athanasiou et al [32] introduced an approximate coverability method by using thread state equations and implemented it in a tool named TSE. TSE is very capable on Boolean programs but theoretically incomplete.…”

Section: Related Workmentioning

confidence: 99%

“…Most crowdsourcing programs are described in pthread-style multithreaded ANSI-C. SatAbs is the front-end of TTSCov, which translates the input ANSI-C programs in to TTS. To measure TTSCov's performance, we compare with the state-of-the-art tools: MIST, IIC [21], BFC [11], Petrinizer [29], and TSE [32]. All experiments are performed on an Intel 3.4 GHz Intel, and 16 GB of memory, running Linux OS in 64-bit.…”

Section: Experimental Evaluationmentioning

confidence: 99%

An SAT‐Based Method to Multithreaded Program Verification for Mobile Crowdsourcing Networks

Zhang

Huo

et al. 2018

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

This paper focused on the safety verification of the multithreaded programs for mobile crowdsourcing networks. A novel algorithm was proposed to find a way to apply IC3, which is typically the fastest algorithm for SAT-based finite state model checking, in a very clever manner to solve the safety problem of multithreaded programs. By computing a series of overapproximation reachability, the safety properties can be verified by the SAT-based model checking algorithms. The results show that the new algorithm outperforms all the recently published works, especially on memory consumption (an advantage that comes from IC3).

show abstract

Unbounded-Thread Program Verification using Thread-State Equations

Cited by 19 publications

References 20 publications

Logics for continuous reachability in Petri nets and vector addition systems with states

Logics for continuous reachability in Petri nets and vector addition systems with states

Towards Efficient Verification of Population Protocols

An SAT‐Based Method to Multithreaded Program Verification for Mobile Crowdsourcing Networks

Contact Info

Product

Resources

About