Model-based abductive reasoning in automated software testing

@article{Angius2013ModelbasedAR,
  title={Model-based abductive reasoning in automated software testing},
  author={Nicola Angius},
  journal={Log. J. IGPL},
  year={2013},
  volume={21},
  pages={931-942}
}
  • Nicola Angius
  • Published 1 December 2013
  • Computer Science
  • Log. J. IGPL
Automated software testing using model checking is in this paper epistemologically analysed in order to argue in favour of the model-based abductive reasoning paradigm in the computer science field. Preliminary, it is shown how both deductive and inductive reasoning are insufficient to determine whether a given piece of software is correct with respect to specified behavioural properties. In Automated software testing computational models are algorithmically checked to find paths that satisfy… 
The Problem of Justification of Empirical Hypotheses in Software Testing
This paper takes part in the methodological debate concerning the nature and the justification of hypotheses about computational systems in software engineering by providing an epistemological
Discovering Empirical Theories of Modular Software Systems. An Algebraic Approach
TLDR
It is argued that logic relations must be thereby defined among models representing different modules in a semantic theory of a modular software system, and excluded that scientific structuralism is able to define module relations needed in software modular theories.
Are Heuristics Knowledge–Enhancing? Abduction, Models, and Fictions in Science
TLDR
It is argued that, through abductive heuristics, knowledge can be enhanced, even when abduction is not considered an inference to the best explanation in the classical sense of the expression, that is an inference necessarily characterized by an empirical evaluation phase, or inductive phase, as Peirce called it.
Is abduction ignorance-preserving? Conventions, models and fictions in science
TLDR
It is illustrated that through abduction, knowledge can be enhanced, even when abduction is not considered an inference to the best explanation (IBE) in the classical sense of the expression, i.e. an inference necessarily characterized by an empirical evaluation phase, or inductive phase, as Peirce called it.
Computational Idealizations in Software Intensive Science: a Comment on Symons’ and Horner’s paper
This commentary on John Symons’ and Jack Horner’s paper, besides sharing its main argument, challenges the authors’ statement that there is no effective method to evaluate software-intensive systems
Computational Idealizations in Software Intensive Science . A Comment on Symons ’ & Horner ’ s paper . ( Draft )
This commentary on John Symons’ and Jack Horner’s paper, besides sharing its main argument, challenges the authors’ statement that there is no effective method to evaluate software intensive systems
Infringing Software Property Rights: Ontological, Methodological, and Ethical Questions
This paper contributes to the computer ethics debate on software ownership protection by examining the ontological, methodological, and ethical problems related to property right infringement that
An experience selecting quality features of apps for people with disabilities using abductive approach to explanatory theory generation
TLDR
A first attempt to improve the MARS tool, aiming to provide specialists relevant data, reducing noise effects, accomplishing better predictive results to enhance their investigations and offers a concise quality assessment of disability-related apps.
...
...

References

SHOWING 1-10 OF 38 REFERENCES
Automated Software Testing Using Model-Checking
TLDR
This paper describes an approach to verify the execution traces created by monitoring statements during white-box testing using a model checker as a semantic tableau and organize multiple execution traces into distinct equivalence partitions based on requirements specifi cations written in linear temporal logic (LTL).
Abstraction and Idealization in the Formal Verification of Software Systems
TLDR
Questions concerning the epistemological status of computer science are answered from the point of view of the formal verification framework and the need to maximize incompatible properties is at the basis of both Abstraction Refinement, the process of generating a cascade of computational models to achieve a balance between simplicity and informativeness, and the Multiple Model Idealization approach in biology.
Model Checking
TLDR
Model checking is applied concurrently with system design, and particularly in its early stages when systems are modelled at a high level of abstraction, because the payoff of finding bugs at that stage is highest whereas the costs are low.
Abstraction Refinement for Large Scale Model Checking
TLDR
Analytical and experimental studies in this thesis are the key to applying model checking to large systems and propose two new algorithms to improve their inside the two basic decision procedures.
Principles of model checking
TLDR
Principles of Model Checking offers a comprehensive introduction to model checking that is not only a text suitable for classroom use but also a valuable reference for researchers and practitioners in the field.
Data flow testing as model checking
TLDR
A model checking-based approach to dataflow testing is presented using CTL as temporal logic and SMV as model checker and the capability of model checkers to construct witnesses and counterexamples allows test generation to be fully automatic.
Control and data abstraction: the cornerstones of practical formal verification
  • Y. Kesten, A. Pnueli
  • Computer Science
    International Journal on Software Tools for Technology Transfer
  • 2000
TLDR
The technical contributions contained in this paper are a full formulation of abstraction when applied to a system with both weak and strong fairness requirements and to a general temporal formula, and a presentation of a compositional framework for shared variables and its application for forming network invariants.
Model-Based and Manipulative Abduction in Science
TLDR
The concept of manipulative abduction is devoted to capture the role of action in many interesting situations: action provides otherwise unavailable information that enables the agent to solve problems by starting and performing a suitable abductive process of generation or selection of hypotheses.
Computers, Justification, and Mathematical Knowledge
The original proof of the four-color theorem by Appel and Haken sparked a controversy when Tymoczko used it to argue that the justification provided by unsurveyable proofs carried out by computers
Automating Software Testing Using Program Analysis
TLDR
Three new tools from Microsoft combine techniques from static program analysis, dynamic analysis, model checking, and automated constraint solving while targeting different application domains.
...
...