Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mauro Santoro

dblp:54/9655 · DBLP profile ↗
← Back
7ranked-venue papers
0as first author
0since 2021 · last 2017
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 7

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
3 papers
Software testing · 43% Program analysis · 28% Software maintenance and evolution · 28%
Databases, data mining, and information retrieval
1 paper
Knowledge graphs · 100%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Program analysis
dynamic analysis
0.312017
GK-Tail+ An Efficient Approach to Learn Software Models · IEEE Trans. Software Eng. 2017
Knowledge graphs › semantic web
linked data
0.212014
Link: exploiting the web of data to generate test inputs · ISSTA 2014
Software testing
test input generation
0.212014
Link: exploiting the web of data to generate test inputs · ISSTA 2014
Software testing
GUI testing
0.112011
AutoBlackTest: a tool for automatic black-box testing · ICSE 2011
Software testing
test generation
0.112011
AutoBlackTest: a tool for automatic black-box testing · ICSE 2011
Knowledge graphs › semantic web
linked open data
0.112014
Link: exploiting the web of data to generate test inputs · ISSTA 2014

Methods — techniques the papers use, named apart from their topics

semantic web · 0.4data linking · 0.4grammar inference · 0.3execution trace analysis · 0.3reinforcement learning · 0.1
YearPublicationVenuePosition
2017 GK-Tail+ An Efficient Approach to Learn Software Models
abstract
Inferring models of program behavior from execution samples can provide useful information about a system, also in the increasingly common case of systems that evolve and adapt in their lifetime, and without requiring large developers' effort. Techniques for learning models of program behavior from execution traces shall address conflicting challenges of recall, specificity and performance: They shall generate models that comprehensively represent the system behavior (recall) while limiting the amount of illegal behaviors that may be erroneously accepted by the model (specificity), and should infer the models within a reasonable time budget to process industrial scale systems (performance). In our early work, we designed GK-tail, an approach that can infer guarded finite state machines that model the behavior of object-oriented programs in terms of sequences of method calls and constraints on the parameter values. GK-tail addresses well two of the three main challenges, since it infers guarded finite state machines with a high level of recall and specificity, but presents severe limitations in terms of performance that reduce its scalability. In this paper, we present GK-tail+, a new approach to infer guarded finite state machines from execution traces of object-oriented programs. GK-tail+ proposes a new set of inference criteria that represent the core element of the inference process: It largely reduces the inference time of GK-tail while producing guarded finite state machines with a comparable level of recall and specificity. Thus, GK-tail+ advances the preliminary results of GK-tail by addressing all the three main challenges of learning models of program behavior from execution traces.
Leonardo Mariani, Mauro Pezzè, Mauro Santoro
IEEE Trans. Software Eng.3
2014 Link: exploiting the web of data to generate test inputs
abstract
Applications that process complex data, such as maps, personal data, book information, travel data, etc., are becoming extremely common. Testing such applications is hard, because they require realistic and coherent test inputs that are expensive to generate manually and difficult to synthesize automatically. So far the research on test case generation techniques has focused mostly on generating test sequences and synthetic test inputs, and has payed little attention to the generation of complex test inputs.
Leonardo Mariani, Mauro Pezzè, Oliviero Riganelli, Mauro Santoro
ISSTA4
2014 Automatic testing of GUI-based applications
abstract
SUMMARY Testing GUI‐based applications is hard and time consuming because it requires exploring a potentially huge execution space by interacting with the graphical interface of the applications. Manual testing can cover only a small subset of the functionality provided by applications with complex interfaces, and thus, automatic techniques are necessary to extensively validate GUI‐based systems. This paper presents AutoBlackTest, a technique to automatically generate test cases at the system level. AutoBlackTest uses reinforcement learning, in particular Q‐learning, to learn how to interact with the application under test and stimulate its functionalities. When used to complement the activity of test designers, AutoBlackTest reuses the information in the available test suites to increase its effectiveness. The empirical results show that AutoBlackTest can sample better than state of the art techniques the behaviour of the application under test and can reveal previously unknown problems by working at the system level and interacting only through the graphical user interface. Copyright © 2014 John Wiley & Sons, Ltd.
Leonardo Mariani, Mauro Pezzè, Oliviero Riganelli, Mauro Santoro
Softw. Test. Verification Reliab.4
2012 Extracting Widget Descriptions from GUIs
Giovanni Becce, Leonardo Mariani, Oliviero Riganelli, Mauro Santoro
FASE4
2012 AutoBlackTest: Automatic Black-Box Testing of Interactive Applications
abstract
Automatic test case generation is a key ingredient of an efficient and cost-effective software verification process. In this paper we focus on testing applications that interact with the users through a GUI, and present AutoBlackTest, a technique to automatically generate test cases at the system level. AutoBlackTest uses reinforcement learning, in particular Q-Learning, to learn how to interact with the application under test and stimulate its functionalities. The empirical results show that AutoBlackTest can execute a relevant portion of the code of the application under test, and can reveal previously unknown problems by working at the system level and interacting only through the GUI.
Leonardo Mariani, Mauro Pezzè, Oliviero Riganelli, Mauro Santoro
ICST4
2012 Learning extended FSA from software: An empirical assessment
David Lo 0001, Leonardo Mariani, Mauro Santoro
J. Syst. Softw.3
2011 AutoBlackTest: a tool for automatic black-box testing
abstract
In this paper we present AutoBlackTest, a tool for the automatic generation of test cases for interactive applications. AutoBlackTest interacts with the application though its GUI, and uses reinforcement learning techniques to understand the interaction modalities and to generate relevant testing scenarios. Early results show that the tool has the potential of automatically discovering bugs and generating useful system and regression test suites.
Leonardo Mariani, Mauro Pezzè, Oliviero Riganelli, Mauro Santoro
ICSE4