Citations of work:

Timothy Colburn & Gary Shute (2007). Abstraction in Computer Science.

10 found
Are we missing citations?

PhilPapers citations & references are currently in beta testing. We expect to add many more in the future.

Meanwhile, you can use our bibliography tool to import references for this or another work.

Or you can directly add citations for the above work:

Search for work by author name and title
Add directly by record ID

  1.  4
    Grounds for Trust: Essential Epistemic Opacity and Computational Reliabilism.Juan M. Durán & Nico Formanek - 2018 - Minds and Machines 28 (4):645-666.
    Several philosophical issues in connection with computer simulations rely on the assumption that results of simulations are trustworthy. Examples of these include the debate on the experimental role of computer simulations :483–496, 2009; Morrison in Philos Stud 143:33–57, 2009), the nature of computer data Computer simulations and the changing face of scientific experimentation, Cambridge Scholars Publishing, Barcelona, 2013; Humphreys, in: Durán, Arnold Computer simulations and the changing face of scientific experimentation, Cambridge Scholars Publishing, Barcelona, 2013), and the explanatory power of (...)
    Direct download (2 more)  
    Export citation  
  2.  13
    Explaining Engineered Computing Systems’ Behaviour: The Role of Abstraction and Idealization.Nicola Angius & Guglielmo Tamburrini - 2017 - Philosophy and Technology 30 (2):239-258.
    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 (...)
    Direct download (3 more)  
    Export citation  
    Bookmark   1 citation  
  3.  99
    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, (...)
    Direct download (3 more)  
    Export citation  
    Bookmark   9 citations  
  4.  48
    Programming Languages as Technical Artifacts.Raymond Turner - 2014 - Philosophy and Technology 27 (3):377-397.
    Taken at face value, a programming language is defined by a formal grammar. But, clearly, there is more to it. By themselves, the naked strings of the language do not determine when a program is correct relative to some specification. For this, the constructs of the language must be given some semantic content. Moreover, to be employed to generate physical computations, a programming language must have a physical implementation. How are we to conceptualize this complex package? Ontologically, what kind of (...)
    Direct download (5 more)  
    Export citation  
    Bookmark   3 citations  
  5.  33
    On Floridi's Method of Levels of Abstraction.Jan van Leeuwen - 2014 - Minds and Machines 24 (1):5-17.
    ion is arguably one of the most important methods in modern science in analysing and understanding complex phenomena. In his book The Philosophy of Information, Floridi (The philosophy of information. Oxford University Press, Oxford, 2011) presents the method of levels of abstraction as the main method of the Philosophy of Information. His discussion of abstraction as a method seems inspired by the formal methods and frameworks of computer science, in which abstraction is operationalised extensively in programming languages and design methodologies. (...)
    Direct download (4 more)  
    Export citation  
    Bookmark   1 citation  
  6.  38
    Scientific Theories of Computational Systems in Model Checking.Nicola Angius & Guglielmo Tamburrini - 2011 - Minds and Machines 21 (2):323-336.
    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 (...)
    Direct download (15 more)  
    Export citation  
    Bookmark   4 citations  
  7.  62
    Decoupling as a Fundamental Value of Computer Science.Timothy Colburn & Gary Shute - 2011 - Minds and Machines 21 (2):241-259.
    Computer science is an engineering science whose objective is to determine how to best control interactions among computational objects. We argue that it is a fundamental computer science value to design computational objects so that the dependencies required by their interactions do not result in couplings, since coupling inhibits change. The nature of knowledge in any science is revealed by how concepts in that science change through paradigm shifts, so we analyze classic paradigm shifts in both natural and computer science (...)
    Direct download (16 more)  
    Export citation  
    Bookmark   1 citation  
  8.  30
    Objects and Processes in Mathematical Practice.Uwe Riss - 2011 - Foundations of Science 16 (4):337-351.
    In this paper it is argued that the fundamental difference of the formal and the informal position in the philosophy of mathematics results from the collision of an object and a process centric perspective towards mathematics. This collision can be overcome by means of dialectical analysis, which shows that both perspectives essentially depend on each other. This is illustrated by the example of mathematical proof and its formal and informal nature. A short overview of the employed materialist dialectical approach is (...)
    Direct download (6 more)  
    Export citation  
  9.  62
    Abstraction, Law, and Freedom in Computer Science.Timothy Colburn & Gary Shute - 2010 - Metaphilosophy 41 (3):345-364.
    Abstract: Laws of computer science are prescriptive in nature but can have descriptive analogs in the physical sciences. Here, we describe a law of conservation of information in network programming, and various laws of computational motion (invariants) for programming in general, along with their pedagogical utility. Invariants specify constraints on objects in abstract computational worlds, so we describe language and data abstraction employed by software developers and compare them to Floridi's concept of levels of abstraction. We also consider Floridi's structural (...)
    Direct download (6 more)  
    Export citation  
    Bookmark   1 citation  
  10.  47
    The Philosophy of Computer Science: Introduction to the Special Issue. [REVIEW]Raymond Turner - 2007 - Minds and Machines 17 (2):129-133.