Reachability Assume-Guarantee
暂无分享,去创建一个
[1] Kenneth L. McMillan. Compositional Systems and Methods , 2000 .
[2] Shing-Chi Cheung,et al. Checking subsystem safety properties in compositional reachability analysis , 1996, Proceedings of IEEE 18th International Conference on Software Engineering.
[3] Shing-Chi Cheung,et al. Checking safety properties using compositional reachability analysis , 1999, TSEM.
[4] Thomas A. Henzinger,et al. Interface automata , 2001, ESEC/FSE-9.
[5] Rajeev Alur,et al. Symbolic Compositional Verification by Learning Assumptions , 2005, CAV.
[6] Corina S. Pasareanu,et al. Refining Interface Alphabets for Compositional Verification , 2007, TACAS.
[7] Corina S. Pasareanu,et al. Assume-Guarantee Verification for Interface Automata , 2008, FM.
[8] Amir Pnueli,et al. In Transition From Global to Modular Temporal Reasoning about Programs , 1989, Logics and Models of Concurrent Systems.
[9] Martín Abadi,et al. Conjoining specifications , 1995, TOPL.
[10] Corina S. Pasareanu,et al. Learning Assumptions for Compositional Verification , 2003, TACAS.
[11] Shing-Chi Cheung,et al. Verification of liveness properties using compositional reachability analysis , 1997, ESEC '97/FSE-5.
[12] Ronald L. Rivest,et al. Inference of finite automata using homing sequences , 1989, STOC '89.
[13] Dana Angluin,et al. Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..