54 research outputs found
Modeling and Testing Implementations of Protocols with Complex Messages
This paper presents a new language called APSL for formally describing
protocols to facilitate automated testing. Many real world communication
protocols exchange messages whose structures are not trivial, e.g. they may
consist of multiple and nested fields, some could be optional, and some may
have values that depend on other fields. To properly test implementations of
such a protocol, it is not sufficient to only explore different orders of
sending and receiving messages. We also need to investigate if the
implementation indeed produces correctly formatted messages, and if it responds
correctly when it receives different variations of every message type. APSL's
main contribution is its sublanguage that is expressive enough to describe
complex message formats, both text-based and binary. As an example, this paper
also presents a case study where APSL is used to model and test a subset of
Courier IMAP email server
Aplib: Tactical Programming of Intelligent Agents
This paper presents aplib, a Java library for programming intelligent agents,
featuring BDI and multi agency, but adding on top of it a novel layer of
tactical programming inspired by the domain of theorem proving. Aplib is also
implemented in such a way to provide the fluency of a Domain Specific Language
(DSL). Compared to dedicated BDI agent programming languages such as JASON,
2APL, or GOAL,aplib's embedded DSL approach does mean that \aplib\ programmers
will still be limited by Java syntax, but on other hand they get all the
advantages that Java programmers get: rich language features (object
orientation, static type checking, -expression, libraries, etc), a
whole array of development tools, integration with other technologies, large
community, etc
Highly Relevant Routing Recommendation Systems for Handling Few Data Using MDL Principle and Embedded Relevance Boosting Factors
A route recommendation system can provide better recommendation if it also
takes collected user reviews into account, e.g. places that generally get
positive reviews may be preferred. However, to classify sentiment, many
classification algorithms existing today suffer in handling small data items
such as short written reviews. In this paper we propose a model for a strongly
relevant route recommendation system that is based on an MDL-based (Minimum
Description Length) sentiment classification and show that such a system is
capable of handling small data items (short user reviews). Another highlight of
the model is the inclusion of a set of boosting factors in the relevance
calculation to improve the relevance in any recommendation system that
implements the model.Comment: ACM SIGIR 2018 Workshop on Learning from Limited or Noisy Data for
Information Retrieval (LND4IR'18), July 12, 2018, Ann Arbor, Michigan, USA, 8
pages, 9 figure
Wiki-MetaSemantik: A Wikipedia-derived Query Expansion Approach based on Network Properties
This paper discusses the use of Wikipedia for building semantic ontologies to
do Query Expansion (QE) in order to improve the search results of search
engines. In this technique, selecting related Wikipedia concepts becomes
important. We propose the use of network properties (degree, closeness, and
pageRank) to build an ontology graph of user query concepts which is derived
directly from Wikipedia structures. The resulting expansion system is called
Wiki-MetaSemantik. We tested this system against other online thesauruses and
ontology based QE in both individual and meta-search engines setups. Despite
that our system has to build a Wikipedia ontology graph in order to do its
work, the technique turns out to work very fast (1:281) compared to another
ontology QE baseline (Wikipedia Persian ontology QE). It has thus the potential
to be utilized online. Furthermore, it shows significant improvement in
accuracy. Wiki-MetaSemantik also shows better performance in a meta-search
engine (MSE) set up rather than in an individual search engine set up
An Agent-based Architecture for AI-Enhanced Automated Testing for XR Systems, a Short Paper
This short paper presents an architectural overview of an agent-based
framework called iv4XR for automated testing that is currently under
development by an H2020 project with the same name. The framework's intended
main use case of is testing the family of Extended Reality (XR) based systems
(e.g. 3D games, VR sytems, AR systems), though the approach can indeed be
adapted to target other types of interactive systems. The framework is unique
in that it is an agent-based system. Agents are inherently reactive, and
therefore are arguably a natural match to deal with interactive systems.
Moreover, it is also a natural vessel for mounting and combining different AI
capabilities, e.g. reasoning, navigation, and learning
An Online Agent-Based Search Approach in Automated Computer Game Testing with Model Construction
The complexity of computer games is ever increasing. In this setup, guiding an automated test algorithm to find a solution to solve a testing task in a game's huge interaction space is very challenging. Having a model of a system to automatically generate test cases would have a strong impact on the effectiveness and efficiency of the algorithm. However, manually constructing a model turns out to be expensive and time-consuming. In this study, we propose an online agent-based search approach to solve common testing tasks when testing computer games that also constructs a model of the system on-the-fly based on the given task, which is then exploited to solve the task. To demonstrate the efficiency of our approach, a case study is conducted using a game called Lab Recruits
Having Fun in Learning Formal Specifications
There are many benefits in providing formal specifications for our software.
However, teaching students to do this is not always easy as courses on formal
methods are often experienced as dry by students. This paper presents a game
called FormalZ that teachers can use to introduce some variation in their
class. Students can have some fun in playing the game and, while doing so, also
learn the basics of writing formal specifications in the form of pre- and
post-conditions. Unlike existing software engineering themed education games
such as Pex and Code Defenders, FormalZ takes the deep gamification approach
where playing gets a more central role in order to generate more engagement.
This short paper presents our work in progress: the first implementation of
FormalZ along with the result of a preliminary users' evaluation. This
implementation is functionally complete and tested, but the polishing of its
user interface is still future work
Formalizing UNITY with HOL
T HIS paper has been written for the IPA workshop in Egmond aan Zee, 16-20 october 1995. Despite its size, it is intended as an introduction ---a quick tour--- to the technology of mechanical verification and the formal design of distributed algorithms, and is not intended to be complete. Nevertheless it will provide the necessary information for the reader to understand the topics. For further reading on the topics, the reader can try the introduction book to HOL [GM93] and the book of UNITY [CM88]. Most of this paper is taken from my Ph.D. thesis. If the reader is interested in further technical details, my thesis is available through ftp at: ftp.cs.ruu.nl in directory pub/RUU/CS/phdtheses/Prasetya Chapter 1 Introduction T HE role of distributed programs has become increasingly important as more and more people hook their computers together, either locally or world-wide. The technology of computer networks advances rapidly and so is its availability. Today, it is no longer a lux..
Aplib: Tactical Programming of Intelligent Agents
This paper presents aplib, a Java library for programming intelligent agents, featuring BDI and multi agency, but adding on top of it a novel layer of tactical programming inspired by the domain of theorem proving. Aplib is also implemented in such a way to provide the fluency of a Domain Specific Language (DSL). Compared to dedicated BDI agent programming languages such as JASON, 2APL, or GOAL,aplib's embedded DSL approach does mean that \aplib\ programmers will still be limited by Java syntax, but on other hand they get all the advantages that Java programmers get: rich language features (object orientation, static type checking, -expression, libraries, etc), a whole array of development tools, integration with other technologies, large community, etc
- …