Automated Error-Detection and Repair for Compositional Software Specifications

作者: Dalal Alrajeh , Robert Craven

DOI: 10.1007/978-3-319-10431-7_9

关键词:

摘要: The complexity of error diagnosis in requirements specifications, already high, is increased when refer to various system components, on whose interaction the system’s aims depend. Further, finding causes error, and ways overcoming them, cannot easily be achieved without a systematic methodology. This has led researchers explore combined use verification machine-learning support automated software analysis repair. However, existing approaches have been limited by using formalisms which modularity compositionality explicitly expressed. In this paper we overcome limitation. We define translation from representative process algebra, Finite State Processes, into action language \(\mathcal{C}+\). enables forms not supported previous methods. then logic-programming equivalent \(\mathcal{C}+\), apply inductive logic programming for learning repairs components while ensuring no new errors are introduced interactions with other maintained. These two phases iterated until correct specification reached, enabling rigorous scalable repair component-based specifications.

参考文章(30)
K. Etessami, Analysis of Recursive Game Graphs Using Data Flow Equations verification model checking and abstract interpretation. pp. 282- 296 ,(2004) , 10.1007/978-3-540-24622-0_23
German E. Sibay, Sebastián Uchitel, Victor Braberman, Jeff Kramer, Distribution of Modal Transition Systems formal methods. pp. 403- 417 ,(2012) , 10.1007/978-3-642-32759-9_33
Edmund Clarke, Daniel Kroening, Joël Ouaknine, Ofer Strichman, Completeness and Complexity of Bounded Model Checking verification model checking and abstract interpretation. ,vol. 2937, pp. 85- 96 ,(2004) , 10.1007/978-3-540-24622-0_9
Vladimir Lifschitz, Michael Gelfond, The stable model semantics for logic programming international conference on lightning protection. pp. 1070- 1080 ,(1988)
Keith L. Clark, Negation as failure Logic and Data Bases. pp. 311- 325 ,(1987) , 10.1007/978-1-4684-3384-5_11
Fides Aarts, Faranak Heidarian, Harco Kuppens, Petur Olsen, Frits Vaandrager, Automata Learning through Counterexample Guided Abstraction Refinement formal methods. pp. 10- 27 ,(2012) , 10.1007/978-3-642-32759-9_4
Stephen Muggleton, Luc de Raedt, Inductive Logic Programming : Theory and Methods Journal of Logic Programming. ,vol. 19, pp. 629- 679 ,(1994) , 10.1016/0743-1066(94)90035-3
Robert M. Keller, Formal verification of parallel programs Communications of The ACM. ,vol. 19, pp. 371- 384 ,(1976) , 10.1145/360248.360251
R. V. Borges, Artur d'Avila Garcez, L. C. Lamb, Learning and Representing Temporal Knowledge in Recurrent Networks IEEE Transactions on Neural Networks. ,vol. 22, pp. 2409- 2421 ,(2011) , 10.1109/TNN.2011.2170180