This category needs an editor. We encourage you to help if you are qualified.
Volunteer, or read more about what this involves.
Related

Contents
15 found
Order:
  1. Isabelle for Philosophers.Ben Blumson - manuscript
    This is an introduction to the Isabelle proof assistant aimed at philosophers and their students.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  2. What Have Google’s Random Quantum Circuit Simulation Experiments Demonstrated about Quantum Supremacy?Jack K. Horner & John Symons - forthcoming - In Hamid R. Arabnia, Leonidas Deligiannidis, Fernando G. Tinetti & Quoc-Nam Tran (eds.), Advances in Software Engineering, Education, and e-Learning. Cham, Switzerland: Springer Nature.
    Quantum computing is of high interest because it promises to perform at least some kinds of computations much faster than classical computers. Arute et al. 2019 (informally, “the Google Quantum Team”) report the results of experiments that purport to demonstrate “quantum supremacy” – the claim that the performance of some quantum computers is better than that of classical computers on some problems. Do these results close the debate over quantum supremacy? We argue that they do not. In the following, we (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  3. On the Mutual Dependence Between Formal Methods and Empirical Testing in Program Verification.Nicola Angius - 2020 - Philosophy and Technology 33 (2):349-355.
    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 (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  4. The Significance of the Curry-Howard Isomorphism.Richard Zach - 2019 - In Gabriele M. Mras, Paul Weingartner & Bernhard Ritter (eds.), Philosophy of Logic and Mathematics. Proceedings of the 41st International Ludwig Wittgenstein Symposium. Berlin: De Gruyter. pp. 313-326.
    The Curry-Howard isomorphism is a proof-theoretic result that establishes a connection between derivations in natural deduction and terms in typed lambda calculus. It is an important proof-theoretic result, but also underlies the development of type systems for programming languages. This fact suggests a potential importance of the result for a philosophy of code.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  5. Ciencia de la computación y filosofía: unidades de análisis del software.Juan Manuel Durán - 2018 - Principia 22 (2):203-227.
    Una imagen muy generalizada a la hora de entender el software de computador es la que lo representa como una “caja negra”: no importa realmente saber qué partes lo componen internamente, sino qué resultados se obtienen de él según ciertos valores de entrada. Al hacer esto, muchos problemas filosóficos son ocultados, negados o simplemente mal entendidos. Este artículo discute tres unidades de análisis del software de computador, esto es, las especificaciones, los algoritmos y los procesos computacionales. El objetivo central es (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  6. On malfunctioning software.Giuseppe Primiero, Nir Fresco & Luciano Floridi - 2015 - Synthese 192 (4):1199-1220.
    Artefacts do not always do what they are supposed to, due to a variety of reasons, including manufacturing problems, poor maintenance, and normal wear-and-tear. Since software is an artefact, it should be subject to malfunctioning in the same sense in which other artefacts can malfunction. Yet, whether software is on a par with other artefacts when it comes to malfunctioning crucially depends on the abstraction used in the analysis. We distinguish between “negative” and “positive” notions of malfunction. A negative malfunction, (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   28 citations  
  7. On the epistemological analysis of modeling and computational error in the mathematical sciences.Nicolas Fillion & Robert M. Corless - 2014 - Synthese 191 (7):1451-1467.
    Interest in the computational aspects of modeling has been steadily growing in philosophy of science. This paper aims to advance the discussion by articulating the way in which modeling and computational errors are related and by explaining the significance of error management strategies for the rational reconstruction of scientific practice. To this end, we first characterize the role and nature of modeling error in relation to a recipe for model construction known as Euler’s recipe. We then describe a general model (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  8. Model-based abductive reasoning in automated software testing.N. Angius - 2013 - Logic Journal of the IGPL 21 (6):931-942.
    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 (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  9. Abstraction and Idealization in the Formal Verification of Software Systems.Nicola Angius - 2013 - Minds and Machines 23 (2):211-226.
    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 (...)
    Remove from this list   Direct download (14 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  10. Validation and Verification in Social Simulation: Patterns and Clarification of Terminology.Nuno David - 2009 - Epistemological Aspects of Computer Simulation in the Social Sciences, EPOS 2006, Revised Selected and Invited Papers, Lecture Notes in Artificial Intelligence, Squazzoni, Flaminio (Ed.) 5466:117-129.
    The terms ‘verification’ and ‘validation’ are widely used in science, both in the natural and the social sciences. They are extensively used in simulation, often associated with the need to evaluate models in different stages of the simulation development process. Frequently, terminological ambiguities arise when researchers conflate, along the simulation development process, the technical meanings of both terms with other meanings found in the philosophy of science and the social sciences. This article considers the problem of verification and validation in (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  11. Simulation as formal and generative social science: the very idea.Nuno David, Jaime Sichman & Helder Coelho - 2007 - In Carlos Gershenson, Diederik Aerts & Bruce Edmonds (eds.), Worldviews, Science, and Us: Philosophy and Complexity. World Scientific. pp. 266--275.
    The formal and empirical-generative perspectives of computation are demonstrated to be inadequate to secure the goals of simulation in the social sciences. Simulation does not resemble formal demonstrations or generative mechanisms that deductively explain how certain models are sufficient to generate emergent macrostructures of interest. The description of scientific practice implies additional epistemic conceptions of scientific knowledge. Three kinds of knowledge that account for a comprehensive description of the discipline were identified: formal, empirical and intentional knowledge. The use of formal (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  12. The Structure and Logic of Interdisciplinary Research in Agent-Based Social Simulation.Nuno David, Maria Marietto, Jaime Sichman & Helder Coelho - 2004 - Journal of Artificial Societies and Social Simulation 7 (3).
    This article reports an exploratory survey of the structure of interdisciplinary research in Agent-Based Social Simulation. One hundred and ninety six researchers participated in the survey completing an on-line questionnaire. The questionnaire had three distinct sections, a classification of research domains, a classification of models, and an inquiry into software requirements for designing simulation platforms. The survey results allowed us to disambiguate the variety of scientific goals and modus operandi of researchers with a reasonable level of detail, and to identify (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  13. Philosophical aspects of program verification.James H. Fetzer - 1991 - Minds and Machines 1 (2):197-216.
    A debate over the theoretical capabilities of formal methods in computer science has raged for more than two years now. The function of this paper is to summarize the key elements of this debate and to respond to important criticisms others have advanced by placing these issues within a broader context of philosophical considerations about the nature of hardware and of software and about the kinds of knowledge that we have the capacity to acquire concerning their performance.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  14. Program verification: the very idea.James H. Fetzer - 1988 - Communications of the Acm 31 (9):1048--1063.
    The notion of program verification appears to trade upon an equivocation. Algorithms, as logical structures, are appropriate subjects for deductive verification. Programs, as causal models of those structures, are not. The success of program verification as a generally applicable and completely reliable method for guaranteeing program performance is not even a theoretical possibility.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   43 citations  
  15. A Quantitative Approach to Measuring Assurance with Uncertainty in Data Provenance.Stephen Bush, Moitra F., Crapo Abha, Barnett Andrew, Dill Bruce & J. Stephen - manuscript
    A data provenance framework is subject to security threats and risks, which increase the uncertainty, or lack of trust, in provenance information. Information assurance is challenged by incomplete information; one cannot exhaustively characterize all threats or all vulnerabilities. One technique that specifically incorporates a probabilistic notion of uncertainty is subjective logic. Subjective logic allows belief and uncertainty, due to incomplete information, to be specified and operated upon in a coherent manner. A mapping from the standard definition of information assurance to (...)
    Remove from this list  
     
    Export citation  
     
    Bookmark