Paper Info
Title
An optimal cut-off algorithm for parameterised refinement checking
Abstract
•The cut-off set problem of a parameterised system is expressed in first-order logic.•An SMT-based semi-algorithm for computing a cut-off set is presented.•The algorithm terminates for topologies expressed in the E*A* fragment of FOL.•Upon termination, the algorithm produces the optimal cut-off set.•The algorithm is applied to the leader election phase of (Byzantine) Raft.
Year
DOI
Venue
2020
10.1016/j.scico.2020.102517
Science of Computer Programming
Keywords
DocType
Volume
Compositional verification,Parameterized systems,Cut-off,Satisfiability modulo theories,Automated verification
Journal
198
ISSN
Citations 
PageRank 
0167-6423
0
0.34
References 
Authors
0
2
Name
Order
Citations
PageRank
Antti Siirtola1445.62
Keijo Heljanko275147.90