Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis

@article{Ghilardi2010BackwardRO,
  title={Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis},
  author={Silvio Ghilardi and Silvio Ranise},
  journal={Logical Methods in Computer Science},
  year={2010},
  volume={6}
}
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure and hence conclude the decidability of the safety problem. Although backward reachability is property-directed, it can unnecessarily explore (large) portions of the state space of a system which are not required to verify the safety property under consideration. To avoid this, invariants can be used to dramatically… CONTINUE READING
Highly Cited
This paper has 76 citations. REVIEW CITATIONS
49 Citations
53 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 49 extracted citations

77 Citations

01020'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 77 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…