An efficient approach to state space management in model checking of complex software systems using machine learning techniques

[1]  David L. Dill,et al.  A New Scheme for Memory-Efficient Probabilistic Verification , 1996, FORTE.

[2]  Vahid Rafe,et al.  MS-ACO: a multi-stage ant colony optimization to refute complex software systems specified through graph transformation , 2018, Soft Comput..

[3]  Somesh Jha,et al.  Exploiting symmetry in temporal logic model checking , 1993, Formal Methods Syst. Des..

[4]  Ganesh Gopalakrishnan,et al.  Random Walk Based Heuristic Algorithms for Distributed Memory Model Checking , 2003, PDMC@CAV.

[5]  Stefan Edelkamp,et al.  Directed explicit-state model checking in the validation of communication protocols , 2004, International Journal on Software Tools for Technology Transfer.

[6]  Hartmut Ehrig,et al.  Handbook of graph grammars and computing by graph transformation: vol. 2: applications, languages, and tools , 1999 .

[7]  Enrique Alba,et al.  Finding safety errors with ACO , 2007, GECCO '07.

[8]  A. Prasad Sistla,et al.  On-the-Fly Model Checking Under Fairness that Exploits Symmetry , 1999, Formal Methods Syst. Des..

[9]  A. Prasad Sistla,et al.  Symmetry and model checking , 1996, Formal Methods Syst. Des..

[10]  Vahid Rafe,et al.  EMCDM: Efficient model checking by data mining for verification of complex software systems specified through architectural styles , 2016, Appl. Soft Comput..

[11]  Thomas G. Dietterich.  An Experimental Comparison of Three Methods for Constructing Ensembles of Decision Trees: Bagging, Boosting, and Randomization , 2000, Machine Learning.

[12]  Maria Luisa Villani,et al.  Ant Colony Optimization for Deadlock Detection in Concurrent Systems , 2011, 2011 IEEE 35th Annual Computer Software and Applications Conference.

[13]  David L. Dill,et al.  Improved probabilistic verification by hash compaction , 1995, CHARME.

[14]  Vahid Rafe,et al.  A meta-heuristic solution for automated refutation of complex software systems specified through graph transformations , 2015, Appl. Soft Comput..

[15]  Vahid Rafe,et al.  Using evolutionary algorithms for reachability analysis of complex software systems specified through graph transformation , 2019, Reliab. Eng. Syst. Saf..

[16]  Dragan Bosnacki,et al.  Partial-order reduction for general state exploring algorithms , 2006, International Journal on Software Tools for Technology Transfer.

[17]  Reiko Heckel,et al.  Compositional Verification of Reactive Systems Specified by Graph Transformation , 1998, FASE.

[18]  Mohsen Rahmani,et al.  A heuristic solution for model checking graph transformation systems , 2014, Appl. Soft Comput..

[19]  Pierre Wolper,et al.  Memory-efficient algorithms for the verification of temporal properties , 1990, Formal Methods Syst. Des..

[20]  Luciano Baresi,et al.  Tutorial Introduction to Graph Transformation: A Software Engineering Perspective , 2002, ICGT.

[21]  Edmund M. Clarke,et al.  Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..

[22]  Alberto Lluch-Lafuente.  Symmetry reduction and heuristic search for error detection in model checking , 2003 .

[23]  Ming T. Liu,et al.  Protocol verification using reachability analysis: the state space explosion problem and relief strategies , 1987, Computer Communication Review.

[24]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD 2000.

[25]  Xavier Crégut,et al.  Automated Failure Analysis in Model Checking Based on Data Mining , 2014, MEDI.

[26]  J. Gaschnig.  Performance measurement and analysis of certain search algorithms. , 1979 .

[27]  Stefan Leue,et al.  Mining Sequential Patterns to Explain Concurrent Counterexamples , 2013, SPIN.

[28]  Hartmut Ehrig,et al.  Graph-Grammars: An Algebraic Approach , 1973, SWAT.

[29]  David L. Dill,et al.  Validation with guided search of the state space , 1998, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175).

[30]  Dimitar Dimitrov,et al.  Stateless model checking of event-driven applications , 2015, OOPSLA.

[31]  Arend Rensink,et al.  Model Checking Dynamic States in GROOVE , 2006, SPIN.

[32]  V. Vapnik,et al.  Bounds on Error Expectation for Support Vector Machines , 2000, Neural Computation.

[33]  Efstathios Stamatatos,et al.  Syntactic N-grams as machine learning features for natural language processing , 2014, Expert Syst. Appl..

[34]  Ramakrishnan Srikant,et al.  Fast algorithms for mining association rules , 1998, VLDB 1998.

[35]  Pierre Wolper,et al.  Reliable Hashing without Collosion Detection , 1993, CAV.

[36]  Majid Nili Ahmadabadi,et al.  Bounded Rational Search for On-the-Fly Model Checking of LTL Properties , 2009, FSEN.

[37]  Vahid Rafe.  Scenario-driven analysis of systems specified through graph transformations , 2013, J. Vis. Lang. Comput..

[38]  Vahid Rafe,et al.  Searching for violation of safety and liveness properties using knowledge discovery in complex systems specified through graph transformations , 2018, Inf. Softw. Technol..