Partitioning the Threads of a Mobile System
J\'er\^ome Feret
TL;DR
This paper introduces a static analysis method that partitions threads in mobile systems to facilitate property verification, using an abstract interpretation approach to count threads efficiently.
Contribution
It presents a novel polynomial-time static analysis technique for thread partitioning in mobile systems, aiding in property proofs.
Findings
Efficient thread counting via static analysis.
Partitioning improves property verification.
Polynomial-time analysis method.
Abstract
In this paper, we show how thread partitioning helps in proving properties of mobile systems. Thread partitioning consists in gathering the threads of a mobile system into several classes. The partitioning criterion is left as a parameter of both the mobility model and the properties we are interested in. Then, we design a polynomial time abstract interpretation-based static analysis that counts the number of threads inside each partition class.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFormal Methods in Verification · Real-Time Systems Scheduling · Logic, programming, and type systems