Nicola Angius

Dr. Nicola Angius

orcid

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 March 2013 in Logic Journal of the IGPL
Verified
Journal Article
Closed access
PDF file
NANicola Angius
Nicola Angius
Automated Software Testing (AST) using Model Checking is in this article epistemologically analysed in order to argue in favour of a model-based reasoning paradigm in computer science. Preliminarily, 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. Models algorithmically checked in Model Checking to select executions to be observed in Software Testing are acknowledged as analogical models which establish isomorphic relations with the target system's data set. Analogical models developed in AST are presented as abductive models providing hypothetical explanations to observed executions. The model assumption—algorithmic check—software testing process is understood as the abduction—deduction—induction process defining the selective abduction and turned to isolate a set of model-based hypotheses concerning the target system behaviours. A manipulative abduction process is finally recognized in the practice of adapting, abstracting and refining models that do not provide successful predictions.

1 March 2014 in Philosophy & Technology
Verified
Journal Article
Closed access
PDF file
NANicola Angius
Nicola Angius

26 March 2018 in Journal of Logic and Computation
Verified
Journal Article
Closed access
PDF file
NANicola Angius
Nicola Angius
Giuseppe PrimieroGiuseppe Primiero
Giuseppe Primiero
Defining identity for entities is a long-standing logical problem in philosophy, and it has resurfaced in current investigations within the philosophy of technology. The problem has not yet been explored for the philosophy of information and of computer science in particular. This paper provides a logical analysis of identity and copy for computational artefacts. Identity is here understood as the relation holding between an instance of a computational artefact and itself. By contrast, the copy relation holds between two distinct computational artefacts. We distinguish among exact, inexact and approximate copies. We use process algebra to provide suitable formal definitions of these relations, using in particular the notion of bisimulation to define identity and exact copies, and simulation for inexact and approximate copies. Equivalence is unproblematic for identical computational artefacts at each individual time and for inexact copies; we will examine to which extent the formal constraints on identity criteria discussed in the literature are satisfied by our approach. As for inexact and approximate copy, they are intended as a weakening of the identity relation in that equivalence and other constraints on identity are violated. The proposed approach also suggests a computable treatment of identity and copy checking.

5 November 2012 in Minds and Machines
Verified
Journal Article
Closed access
PDF file
NANicola Angius
Nicola Angius

2 February 2011 in Minds and Machines
Verified
Journal Article
Closed access
PDF file
NANicola Angius
Nicola Angius
GTGuglielmo Tamburrini
Guglielmo Tamburrini

5 July 2023 in Philosophy & Technology
Verified
Journal Article
Closed access
PDF file
NANicola Angius
Nicola Angius
Alessio PlebeAlessio Plebe
Alessio Plebe