TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Constraint Logic Programming Applied to Model Checking
LOPSTR'99 Selected papers from the 9th International Workshop on Logic Programming Synthesis and Transformation
Model Checking as Constraint Solving
SAS '00 Proceedings of the 7th International Symposium on Static Analysis
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Automatic software model checking via constraint logic
Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
Efficient temporal-logic query checking for presburger systems
Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering
Temporal Logic Query Checking: A Tool for Model Exploration
IEEE Transactions on Software Engineering
Modelling and verification of the LMAC protocol for wireless sensor networks
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
A process calculus for mobile ad hoc networks
COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
Equational reasoning on ad hoc networks
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Static analysis, abstract interpretation and verification in (constraint logic) programming
A 25-year perspective on logic programming
Parameterized verification of ad hoc networks
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
On the power of cliques in the parameterized verification of Ad Hoc networks
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
On the verification of timed ad hoc networks
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Proceedings of the 45th Annual Simulation Symposium
Verification of ad hoc networks with node and communication failures
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
| Hi-index | 0.00 |
A prominent source of complexity in the verification of ad hoc network (AHN) protocols is the fact that the number of network topologies grows exponentially with the square of the number of nodes. To combat this instance explosion problem, we present a query-based verification framework for AHN protocols that utilizes symbolic reachability analysis. Specifically we consider AHN nodes of the form P :I , where P is a process and I is an interface: a set of groups, where each group represents a multicast port. Two processes can communicate if their interfaces share a common group. To achieve a symbolic representation of network topologies, we treat process interfaces as variables and introduce a constraint language for representing topologies. Terms of the language are simply conjunctions of connection and disconnection constraints of the form $conn({\mathcal{J}}_i,{\mathcal{J}}_j)$ and $dconn({\mathcal{J}}_i, {\mathcal{J}}_j)$, where ${\mathcal{J}}_i$ and ${\mathcal{J}}_j$ are interface variables. Our symbolic reachability algorithm explores the symbolic state space of an AHN in breadth-first order, accumulating topology constraints as multicast-transmit and multicast-receive transitions are encountered. We demonstrate the practical utility of our framework by applying it to the problem of detecting unresolved collisions in the LMAC protocol for sensor networks.