#Logicworks cleanup design verification
#Logicworks cleanup design software
#Logicworks cleanup design code

#Logicworks cleanup design software

These tools range from ‘proof assistants’ that are used by humans to develop detailed correctness arguments about pieces of software to automatic software analysis tools that provide pragmatic and usable advice to software engineers at the time of development. Secondly, the proof theory developed to check software using Separation Logic is based on rules for scaling the reasoning task and has been deployed in numerous tools for formal reasoning about programs.

#Logicworks cleanup design code

This feature mirrors in some ways the dual abstract-physical nature of computer code in general (Turner and Angius 2017).

First, it merges with the scientific-engineering model the programmer uses to understand and build the software. We present two main reasons why Separation Logic works. Footnote 1 We focus on the current form of Separation Logic (for an account of its development history, see O’Hearn ( 2015) and Calcagno et al.

#Logicworks cleanup design verification

We will lay out what makes reasoning about computer resources hard and explain Separation Logic’s special arrangement of properties that enable us to use it effectively in program verification problems. Separation Logic adds a connective to standard logic called ‘and, separately’ that solves a problem of reasoning about the resources a computer program will need when it executes. For philosophers of science, it is an account of the working and reasoning process of field which is not commonly studied. Integrating with model or proof theory alone is not enough. For logicians, it is an example of success by integrating engineering needs into both model theory and proof theory. The result is a case study with multiple uses. Specifically, we follow Separation Logic, a development within theoretical computer science firmly established by O’Hearn and Pym ( 1999), Ishtiaq and O’Hearn ( 2001), and Reynolds ( 2002). This paper focuses on logic as a technology by reflecting on the achievements in verification of computer programs using logics as tools. We provide three contributions: an exploration of the extent of models merging that is necessary for success in computer science an introduction to the technical details of Separation Logic, which can be used for reasoning about other exhaustible resources and an introduction to (a subset of) the problems, process, and results of computer scientists for those outside the field. Furthermore, the history of Separation Logic for analysing programs provides a novel case for philosophers of science of how software engineers and computer scientists develop models and the components of such models. Seeking this intersection of two different senses of model provides a strategy for how computer scientists and logicians may be successful. When this occurs, both the logic and engineering benefit greatly. For these two senses of model-the engineering/conceptual and the logical-to merge in a genuine sense, each must maintain their norms of use from their home disciplines. Separation Logic is an interesting case because of its widespread success in verification tools. Scalability is a central problem, and some would even say the central problem, in appli- cations of logic in computer science. Separation Logic works because it merges the software engineer’s conceptual model of a program’s manipulation of computer memory with the logical model that interprets what sentences in the logic are true, and because it has a proof theory which aids in the crucial problem of scaling the reasoning task. Through the case of the history of Separation Logic, we explore how this assertion is more than idle poetry. One might poetically muse that computers have the essence both of logic and machines.