Mutation Operators for the Goal Agent Language

Savarimuthu, Sharmila; Winikoff, Michael

doi:10.1007/978-3-642-45343-4_14

Cited by 8 publications

(9 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Here we compare them in terms of multi-agent systems, by two examples showing that the semantic mutation operators for GOAL as shown in Table 8(b) can simulate some faults that cannot be captured by the traditional mutation operators for GOAL which are derived by Savarimuthu and Winikoff [18]. The RSO semantic mutation operator for GOAL can change the action rule selection order from "linear" to "linearall", which is similar to the change from else-if to if.…”

Section: ! Related Work and Conclusionmentioning

confidence: 99%

See 1 more Smart Citation

Semantic Mutation Testing for Multi-agent Systems

Alexander

2015

Engineering Multi-Agent Systems

View full text Add to dashboard Cite

Abstract. This paper introduces semantic mutation testing (SMT) into multiagent systems. SMT is a test assessment technique that makes changes to the interpretation of a program and then examines whether a given test set has the ability to detect each change to the original interpretation. These changes represent possible misunderstandings of how the program is interpreted. SMT can also be used to assess robustness to and reliability of semantic changes. This paper applies SMT to three rule-based agent programming languages, namely Jason, GOAL and 2APL, provides several contexts in which SMT for these languages is useful, and proposes three sets of semantic mutation operators (i.e., rules to make semantic changes) for these languages respectively, and a systematic approach to derivation of semantic mutation operators for rule-based agent languages. This paper then shows, through preliminary evaluation of our semantic mutation operators for Jason, that SMT has some potential to assess tests, robustness to and reliability of semantic changes.

show abstract

Section: ! Related Work and Conclusionmentioning

confidence: 99%

“…These changes represent potential small slips. Work on traditional mutation testing for MASs includes [1,10,[16][17][18].…”

Section: Introductionmentioning

confidence: 99%

Semantic Mutation Testing for Multi-agent Systems

Alexander

2015

Engineering Multi-Agent Systems

View full text Add to dashboard Cite

show abstract

“…Savarimuthu and Winikoff [7] applied the guidewords of HAZOP (Hazard and Operability Study) into the syntax of AgentSpeak, to systematically derive a set of mutation operators for AgentSpeak. Now we build on their work: we propose mutation operators for an implementation of AgentSpeak called Jason [14], which implements AgentSpeakÕs operational semantics and extends AgentSpeak with various features useful for practical agent implementation.…”

Section: Mutation Operators For Jasonmentioning

confidence: 99%

“…Saifan and Wahsheh [6] propose and classify a set of mutation operators for JADE mobile agents. Similarly, Savarimuthu and Winikoff [7,8] systematically derive a set of mutation operators for the AgentSpeak BDI agent language and another set for GOAL agent language. None of the above papers on MASspecific mutation operators, however, actually implement and evaluate their operators except [8].…”

Section: Introductionmentioning

confidence: 99%

Mutation Testing for Jason Agents

Alexander

Clark

2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Most multi-agent system (MAS) testing techniques lack empirical evidence of their effectiveness. Since finding tests that can reveal a large proportion of possible faults are a key goal in testing, we need techniques to assess the fault detection ability of test sets for MAS. Mutation testing offers a direct and powerful way to do this: it generates faulty versions of the program following mutation operators then checks if the tests can distinguish the original program from those versions. In this paper, we propose a set of mutation operators for the Jason agent-oriented programming language, and then introduce a mutation testing system for individual Jason agents that implements some of our proposed mutation operators. We use our implemented mutation operators to assess the tests for a small Jason system, and show that the tests that meet a combination of existing coverage criteria do not kill all mutants.

show abstract

“…Others have recently applied mutation analysis to the measurement of test suite effectiveness for web sites [28], [29], [30]. Mutation testing has additionally been applied in other diverse domains such as mobile software agents (e.g., [31], [32]) and security policies (e.g., [33], [34]). Like these examples of related work, this paper considers mutation testing for a new domain-in this case, relational database schemas.…”

Section: Related Workmentioning

confidence: 99%