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. (shrink)

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 analysis of Software Testing, the practice of observing the programs’ executions to examine whether they fulfil software requirements. Property specifications articulating such requirements are shown to involve falsifiable hypotheses about software systems that are evaluated by means of tests which are likely to falsify those hypotheses. Software Reliability metrics, used to measure the growth of (...) probability that given failures will occur at specified times as new executions are observed, is shown to involve a Bayesian confirmation of falsifiable hypotheses on programs. Coverage criteria, used to select those input values with which the system under test is to be launched, are understood as theory-laden principles guiding software tests, here compared to scientific experiments. Redundant computations, fault seeding models and formal methods used in software engineering to evaluate test results are taken to be instantiations of some epistemological strategies used in scientific experiments to distinguish between valid and non-valid experimental outcomes. The final part of the paper explores the problem, advanced in the context of the philosophy of technology, of defining the epistemological status of software engineering by conceiving it as a scientifically attested technology. (shrink)

Model checking, a prominent formal method used to predict and explain the behaviour of software and hardware systems, is examined on the basis of reflective work in the philosophy of science concerning the ontology of scientific theories and model-based reasoning. The empirical theories of computational systems that model checking techniques enable one to build are identified, in the light of the semantic conception of scientific theories, with families of models that are interconnected by simulation relations. And the mappings between these (...) scientific theories and computational systems in their scope are analyzed in terms of suitable specializations of the notions of model of experiment and model of data. Furthermore, the extensively mechanized character of model-based reasoning in model checking is highlighted by a comparison with proof procedures adopted by other formal methods in computer science. Finally, potential epistemic benefits flowing from the application of model checking in other areas of scientific inquiry are emphasized in the context of computer simulation studies of biological information processing. (shrink)

Questions concerning the epistemological status of computer science are, in this paper, answered from the point of view of the formal verification framework. State space reduction techniques adopted to simplify computational models in model checking are analysed in terms of Aristotelian abstractions and Galilean idealizations characterizing the inquiry of empirical systems. Methodological considerations drawn here are employed to argue in favour of the scientific understanding of computer science as a discipline. Specifically, reduced models gained by Dataion are acknowledged as Aristotelian (...) abstractions that include only data which are sufficient to examine the interested executions. The present study highlights how 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. Finally, fairness constraints, imposed to computational models to allow fair behaviours only, are defined as ceteris paribus conditions under which temporal formulas, formalizing software requirements, acquire the status of law-like statements about the software systems executions. (shrink)

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 should come prior to any legal discussion. The ontological problem consists in determining precisely what it is for a computer program to be a copy of another one, a largely neglected problem in computer ethics. The methodological problem is defined as the difficulty of deciding whether a given software system is a copy of another (...) system. And the ethical problem corresponds to establishing when a copy constitutes, or does not constitute, a property right infringement. The ontological problem is solved on the logical analysis of abstract machines, and the latter are argued to be the appropriate level of abstraction for software at which the methodological and the ethical problems can be successfully addressed. (shrink)

This paper provides a review of Raymond Turner’s book Computational Artefacts. Towards a Philosophy of Computer Science. Focus is made on the definition of program correctness as the twofold problem of evaluating whether both the symbolic program and the physical implementation satisfy a set of specifications. The review stresses how these are not two separate problems. First, it is highlighted how formal proofs of correctness need to rely on the analysis of physical computational processes. Secondly, it is underlined how software (...) testing requires considering the formal relations holding between the specifications and the symbolic program. Such a mutual dependency between formal and empirical program verification methods is finally shown to influence the debate on the epistemological status of computer science. (shrink)

This paper addresses the methodological problem of analysing what it is to explain observed behaviours of engineered computing systems, focusing on the crucial role that abstraction and idealization play in explanations of both correct and incorrect BECS. First, it is argued that an understanding of explanatory requests about observed miscomputations crucially involves reference to the rich background afforded by hierarchies of functional specifications. Second, many explanations concerning incorrect BECS are found to abstract away from descriptions of physical components and processes (...) of computing systems that one finds below the logic circuit and gate layer of functional specification hierarchies. Third, model-based explanations of both correct and incorrect BECS that are provided in the framework of formal verification methods often involve idealizations. Moreover, a distinction between restrictive and permissive idealizations is introduced and their roles in BECS explanations are analysed. (shrink)

The Epistemology Of Computer Simulation has developed as an epistemological and methodological analysis of simulative sciences using quantitative computational models to represent and predict empirical phenomena of interest. In this paper, Executable Cell Biology and Agent-Based Modelling are examined to show how one may take advantage of qualitative computational models to evaluate reachability properties of reactive systems. In contrast to the thesis, advanced by EOCS, that computational models are not adequate representations of the simulated empirical systems, it is shown how (...) the representational adequacy of qualitative models is essential to evaluate reachability properties. Justification theory, if not playing an essential role in EOCS, is exhibited to be involved in the process of advancing and corroborating model-based hypotheses about empirical systems in ECB and ABM. Finally, the practice of evaluating model-based hypothesis by testing the simulated systems is shown to constitute an argument in favour of the thesis that computer simulations in ECB and ABM can be put on a par with scientific experiments. (shrink)

The Stanford Encyclopedia of Philosophy is an open access, dynamic reference work designed to organize professional philosophers so that they can write, edit, and maintain a reference work in philosophy that is responsive to new research. From its inception, the SEP was designed so that each entry is maintained and kept up to date by an expert or group of experts in the field. All entries and substantive updates are refereed by the members of a distinguished Editorial Board before they (...) are made public. (shrink)

This paper introduces the _Global Philosophy_ symposium on Giuseppe Primiero’s book _On the Foundations of Computing_ (2020). The collection gathers commentaries and responses of the author with the aim of engaging with some open questions in the philosophy of computer science. Firstly, this paper introduces the central themes addressed in Primiero’s book; secondly, it highlights some of the main critiques from commentators in order to, finally, pinpoint some conceptual challenges indicating future directions for the philosophy of computer science.

This paper is concerned with the construction of theories of software systems yielding adequate predictions of their target systems’ computations. It is first argued that mathematical theories of programs are not able to provide predictions that are consistent with observed executions. Empirical theories of software systems are here introduced semantically, in terms of a hierarchy of computational models that are supplied by formal methods and testing techniques in computer science. Both deductive top-down and inductive bottom-up approaches in the discovery of (...) semantic software theories are refused to argue in favour of the abductive process of hypothesising and refining models at each level in the hierarchy, until they become satisfactorily predictive. Empirical theories of computational systems are required to be modular, as modular are most software verification and testing activities. We argue that logic relations must be thereby defined among models representing different modules in a semantic theory of a modular software system. We exclude that scientific structuralism is able to define module relations needed in software modular theories. The algebraic Theory of Institutions is finally introduced to specify the logic structure of modular semantic theories of computational systems. (shrink)

This paper sheds light on the shift that is taking place from the practice of ‘coding’, namely developing programs as conventional in the software community, to the practice of ‘curing’, an activity that has emerged in the last few years in Deep Learning (DL) and that amounts to curing the data regime to which a DL model is exposed during training. Initially, the curing paradigm is illustrated by means of a study-case on autonomous vehicles. Subsequently, the shift from coding to (...) curing is analysed taking into consideration the epistemological notions, central in the philosophy of computer science, of function, implementation, and correctness. First, it is illustrated how, in the curing paradigm, the functions performed by the trained model depend much more on dataset curation rather than on the model algorithms which, in contrast with the coding paradigm, do not comply with requested specifications. Second, it is highlighted how DL models cannot be considered implementations according to any of the available definitions of implementation that follow an intentional theory of functions. Finally, it is argued that DL models cannot be evaluated in terms of their correctness but rather in their experimental computational validity. (shrink)

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 as a distinguishing feature of software intensive science. It is underlined here how analogous methodological limitations characterise the evaluations of empirical systems in non-software intensive sciences. The authors’ claim that formal methods establish the correctness of computational models rather than of the represented programme is here compared with the empirical adequacy problem typifying (...) the model-based reasoning approach in physics, and the remark that testing all the paths of a software-intensive system is unfeasible is related to the enumerative induction problem in the justification of empirical law-like hypotheses in non-software intensive sciences. (shrink)

This paper offers a review of Giuseppe Primero’s (2020) book “On the foundations of computing”_._ Mathematical, engineering, and experimental foundations of the science of computing are examined under the light of the notions of formal, physical, and experimental computational validity provided by the author. It is challenged the thesis that experimental computational validity can be defined only for the algorithmic method and not for the software development process. The notions of computational hypothesis and computational experiment provided by Primiero (2020) are (...) extended to the case of software development. Finally, it is highlighted how the hypothetical-deductive method is involved in the practice of using models to corroborate computational hypotheses in software testing. As a concluding remark, it is underlined how defining experimental computational validity in the context of software development offers a sound experimental foundation to the science of computing. (shrink)

Vol. presents a method for critically evaluating relevance in arguments based on case studies & a new relevance theory incorporating techniques of argumentation theory, logic & artificiaI intelligence. For scholars/students in argumentation & rhetoric.

When making decisions, humans can observe many kinds of information about others' activities, but their effects on performance are not well understood. We investigated social learning strategies using a simple problem-solving task in which participants search a complex space, and each can view and imitate others' solutions. Results showed that participants combined multiple sources of information to guide learning, including payoffs of peers' solutions, popularity of solution elements among peers, similarity of peers' solutions to their own, and relative payoffs from (...) individual exploration. Furthermore, performance was positively associated with imitation rates at both the individual and group levels. When peers' payoffs were hidden, popularity and similarity biases reversed, participants searched more broadly and randomly, and both quality and equity of exploration suffered. We conclude that when peers' solutions can be effectively compared, imitation does not simply permit scrounging, but it can also facilitate propagation of good solutions for further cumulative exploration. (shrink)

A "slippery slope argument" is a type of argument in which a first step is taken and a series of inextricable consequences follow, ultimately leading to a disastrous outcome. Many textbooks on informal logic and critical thinking treat the slippery slope argument as a fallacy. Walton argues that used correctly in some cases, they can be a reasonable type of argument to shift a burden of proof in a critical discussion, while in other cases they are used incorrectly. Walton identifies (...) and analyzes four types of slippery slope argument. Walton presents guidelines that show how each type of slippery slope argument can be used correctly or incorrectly, using over fifty case studies of argumentation on controversial issues. These include abortion, medical research on human embryos, euthanasia, the decriminalization of marijuana, pornography, and censorship, and banning of American flag burning. (shrink)

This collection of essays, which includes a revised version of a famous article on the "male lesbian," addresses such issues as race, gender, and sexuality, and explores the body as a physical, psychological, and cultural construct.

Vice crimes, crimes prohibited in part because they are viewed as morally corrupting, engage legal theorists because they reveal importantly contrasting views between liberals and virtue-centered theorists on the very limits of legitimate state action. Yet advocates and opponents alike focus on the role law can play in suppressing personal vice; the role of law is seen as suppressing licentiousness, sloth, greed etc. The most powerful advocates of the position that the law must nurture good character often draw on Aristotelian (...) theories of virtue to ground the connection between law and virtue. While Aristotle believed that law and character were linked, it is ironic to note that he did not argue for the position evidenced in our vice laws that law was likely to succeed in instilling virtue. Indeed, Aristotle thought the project of using law to instill private virtue was nearly certain to fail. Aristotle’s deep concern was not for the way law protected private virtue within each person but the way law had to protect civic virtue between citizens. This article argues that even from its foundations, the project of vice crimes as moral instruction is misconceived. The use of law for overly instrumental or narrow reasons opens law and legal institutions to abuse and factionalism. Lawyers, judges and others specially connected to law must first and foremost aim at addressing “legal vices,” vices internal to the institutions of law. Particularly, increasing factionalism and instrumentalism which disconnects law from the pursuit of the common good threatens our civic bonds. Most importantly, where civic bonds are disrupted, citizens have no reason to remain law abiding. The striking lesson, captured both in ancient philosophy and modern history, is that when legal vices grow unchecked and factions use the law to pursue narrow interests, ultimately law abidingness is corrupted and interest groups harm themselves as much as others. (shrink)

Science provides us with representations of atoms, elementary particles, polymers, populations, genetic trees, economies, rational decisions, aeroplanes, earthquakes, forest fires, irrigation systems, and the world’s climate. It's through these representations that we learn about the world. This entry explores various different accounts of scientific representation, with a particular focus on how scientific models represent their target systems. As philosophers of science are increasingly acknowledging the importance, if not the primacy, of scientific models as representational units of science, it's important to (...) stress that how they represent plays a fundamental role in how we are to answer other questions in the philosophy of science (e.g. the scientific realism debate). This entry begins by disentangling ‘the’ problem of scientific representation, before critically evaluating the current options available in the literature. (shrink)

The so-called ergodic hierarchy (EH) is a central part of ergodic theory. It is a hierarchy of properties that dynamical systems can possess. Its five levels are egrodicity, weak mixing, strong mixing, Kolomogorov, and Bernoulli. Although EH is a mathematical theory, its concepts have been widely used in the foundations of statistical physics, accounts of randomness, and discussions about the nature of chaos. We introduce EH and discuss its applications in these fields.

EDITORS' INTRODUCTION B he Vedas tell of a conversation between a young man, Shvetaketu, and his father concerning what the son had learned in his education ...

This article draws attention to the origins, forms, and implications of “toxic discourse” as a genre central to the understanding of the public sphere in business in society.RachelCarson'sSilentSpringis used as a pivotal cultural document establishing “toxic discourse” as an ongoing form of moral narrative rooted in the rationality of counterpublics. Toxic discourse is framed within a center/periphery model in which toxic discourse gains salience in periods of economic dislocation and uncertainty. In these periods, toxic discourse draws together those on the (...) periphery or counterpublics who otherwise would not unite in their opposition to the center. The article critically examines how stakeholder theory, despite making sense of the public sphere for agents of organizations, glosses counterpublics and relegates toxic discourse, as evident in the “Occupy Movement,” to the ephemeral role of temporary, disruptive protest groups with very little of substance to communicate. (shrink)

Mathematical pluralism can take one of three forms: (1) every consistent mathematical theory consists of truths about its own domain of individuals and relations; (2) every mathematical theory, consistent or inconsistent, consists of truths about its own (possibly uninteresting) domain of individuals and relations; and (3) the principal philosophies of mathematics are each based upon an insight or truth about the nature of mathematics that can be validated. (1) includes the multiverse approach to set theory. (2) helps us to understand (...) the significance of the distinguished non‐logical individual and relation terms of even inconsistent theories. (3) is a metaphilosophical form of mathematical pluralism and hasn't been discussed in the literature. In what follows, I show how the analysis of theoretical mathematics in object theory exhibits all three forms of mathematical pluralism. (shrink)

Many different and contradictory claims have been made about the political dimensions (or lack thereof) of the ancient Chinese text known as the Zhuangzi 莊子. The two main positions on this topic set the parameters of the debate. One interprets the Zhuangzi to be apathetic toward political participation, focusing on individual survival instead. The other emphasizes the text’s defiant streak and locates a deliberately subversive force within it. A third position redirects the focus of the debate to an important aspect (...) of the Zhuangzi, recognizing that the text intentionally embraces ambiguity and multivocality, and investigates the political implications of this characteristic of the text. This article further explores the Zhuangzi’s engagement with notions of social and political indeterminacy, but through the lens of role performance. Attending to the text’s portrayal of various social actors’ engagement with established roles reveals a different kind of polysemic stance that lies in the intricate dynamics between societal expectations and individual actions. The article employs these examples to examine a type of role enactment that I contend muddies the line between the place of power and the place of resistance. (shrink)

인간의 이성적 의식과 법의 관계를 밝히고 법의 해석 과 판단에 인간의 의식이 어떻게 작용하는가를 고찰 한 저술. 제1부에서는 법의 형이상학적인 측면에서 법의 실체, 그리스의 법, 데카르트의 법, 로크와 법, 칸트와 법, 헤겔과 법, 아담스미스의 법의 경제, 중국의 도덕과 법사상을 다루었다. 제2부에서는 심리학적 분석으로 헌법의 심리학적 해석, 법의 판결절차, 증거법, 형법과 죄, 청소년과 가족법, 조세법, 플라톤의 법, 칸트의 도덕론의 경험적 확인, 헤겔의 자아와 노동법, 법의 4차원에 대해 다뤘다.