| Alternate document: Details Search Based Software Engineering (01) Mark Harman King's College London, Strand, London, WC2R 2LS |
C. B. Jones  Home/Search
Context Related
| cs.ncl.ac.uk/research/trs/pape...740.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.ncl.ac.uk/research/trs/pape... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper traces the important steps in the history --up to around 1990-- of research on reasoning about programs. The main focus is on sequential imperative programs but some comments are made on concurrency. Initially, researchers focussed on ways of verifying that a program satifies its specification (or that two programs were equivalent). Over time it has become clear that post facto verification is only practical for small programs and attention turned to verification methods which... (Update)
Context of citations to this paper: More
.... formal methods pedigree, stretching back through Hoare s axioms [5] to the germination of the idea in work by Floyd and even Turing [6]. The adoption of what we will term the assumption effect paradigm in the development of dataflow networks may be traced to Misra and...
...relating inputs to outputs. A correct sequential program should also terminate for all inputs. See [AA78, dB80, Apt81, Apt84, Jon92] for comprehensive coverage of proof techniques for sequential programs. Program efficiency (space and time) has also received tremendous...
Cited by: More
Thinking Tools for the Future of Computing Science - Jones (2000) (Correct)
Formal Methods and the Certification of Critical Systems - Rushby (1993) (Correct)
Theorem Proving in Higher Order Logics - Carreņo, Muņoz, Tahar (2002) (Correct)
Similar documents (at the sentence level):
57.8%: The Early Search for Tractable Ways of Reasoning About Programs - Jones (2003) (Correct)
Active bibliography (related documents): More All
21.5: Formal Methods - Selected Historical References - Jones, McCauley (1992) (Correct)
2.6: The VDM Bibliography - Larsen (1996) (Correct)
0.6: Black tie optional: Modelling programming language concepts - Coleman, Jefferson, Jones (2004) (Correct)
Similar documents based on text: More All
0.1: Main Publications - Jones (Correct)
0.1: Reasoning about Java Classes - Jacobs, van den Berg, Huisman, van.. (1998) (Correct)
0.1: An Executable Course in the Algebraic Semantics of Imperative .. - Malcolm, Goguen (1996) (Correct)
Related documents from co-citation: More All
6: An axiomatic basis for computer programming (context) - Hoare - 1969
5: A Discipline of Programming (context) - Dijkstra - 1976
4: Assigning meanings to programs (context) - Floyd - 1967
BibTeX entry: (Update)
Cliff B. Jones. The search for tractable ways of reasoning about programs. Technical Report UMCS-92-4-4, Department of Computer Science, University of Manchester, 1992. http://citeseer.ist.psu.edu/jones01search.html More
@techreport{ jones92search,
author = "C. B. Jones",
title = "The Search for Tractable Ways of Reasoning about Programs",
number = "UMCS-92-4-4",
year = "1992",
url = "citeseer.ist.psu.edu/jones01search.html" }
Citations (may not include all citations):2732 Communicating sequential processes (context) - Hoare - 1978
2732 Communicating Sequential Processes (context) - Hoare - 1985
1933 Communication and Concurrency (context) - Milner - 1989
1274 Object-oriented Software Construction (context) - Meyer - 1988
906 A structural approach to operational semantics - Plotkin - 1981
716 Parallel Program Design: A Foundation (context) - Chandy, Misra - 1988
689 Systematic Software Development Using VDM - Jones - 1986
652 A Discipline of Programming (context) - Dijkstra - 1976
650 An axiomatic basis for computer programming (context) - Hoare - 1969
634 A machine-oriented logic based on the resolution principle (context) - Robinson - 1965
505 Implementing Mathematics with the Nuprl Proof Development Sy.. - Constable - 1986
492 Smalltalk-80: The Language and its Implementation (context) - Goldberg, Robson - 1983
392 A Computational Logic (context) - Boyer, Moore - 1979
385 A transformation system for developing recursive programs - Burstall, Darlington - 1977
346 Denotational Semantics: The Scott-Strachey Approach to Progr.. (context) - Stoy - 1977
322 volume 78 of Lecture Notes in Computer Science (context) - Gordon, Milner et al. - 1979
322 volume 92 of Lecture Notes in Computer Science (context) - Milner, for et al. - 1980
275 The Science of Programming (context) - Gries - 1981
274 Prentice Hall International (context) - Spivey, Notation et al. - 1989
274 Prentice Hall International (context) - Reynolds, of - 1981
265 Proof of correctness of data representations (context) - Hoare - 1972
239 Monitors: An operating system structuring concept (context) - Hoare - 1974
223 Assigning meanings to programs (context) - Floyd - 1967
218 The mechanical evaluation of expressions (context) - Landin - 1964
210 Cooperating sequential processes (context) - Dijkstra - 1968
208 Axiomatic Proof Techniques for Parallel Programs (context) - Owicki - 1975
208 An axiomatic proof technique for parallel programs (context) - Owicki, Gries - 1976
168 A temporal logic of actions - Lamport - 1990
162 Data types as lattices (context) - Scott
160 Programs with common sense - McCarthy - 1959
141 Predicate Calculus and Program Semantics (context) - Dijkstra, Scholten - 1990
139 Recursive functions of symbolic expressions and their comput.. - McCarthy - 1960
133 Mathematical Theory of Computation (context) - Manna - 1974
128 Logic and Computation: Interactive Proof with Cambridge LCF (context) - Paulson - 1987
127 with an application to the Entscheidungsproblem (context) - Turing, numbers
125 Outline of a mathematical theory of computation (context) - Scott - 1970
114 The temporal semantics of concurrent programs (context) - Pnueli - 1981
114 The temporal semantics of concurrent programs (context) - Pnueli - 1977
112 Initial algebra semantics and continuous algebras (context) - Goguen, Thatcher et al. - 1977
108 Communications of the ACM (context) - Hoare, Partition et al. - 1961
107 Coroutines and networks of parallel processes (context) - Kahn, MacQueen - 1977
95 A basis for a mathematical theory for computation - McCarthy
86 A correspondence between ALGOL-60 and Church's lambda-notati.. (context) - Landin - 1965
85 Kommunikation mit Automaten (context) - Petri - 1962
77 nondeterminacy and formal derivation of programs (context) - Dijkstra - 1975
75 IEEE Transactions on Software Engineering (context) - Misra, Chandy et al. - 1981
72 Go to statement considered harmful (context) - Dijkstra - 1968
71 Structured Programming (context) - Dahl, Dijkstra et al. - 1972
68 Ten years of Hoare's logic: A survey { part (context) - Apt - 1981
65 Hoare logic (context) - Lamport - 1980
64 Communications of the ACM (context) - Kowalski, logic - 1979
62 Issues in the design of a parallel object-oriented language (context) - America - 1989
53 SIMULA 67 common base language (context) - Dahl, Myhrhaug et al. - 1968
52 Programming from Specications (context) - Morgan - 1990
51 The programming language concurrent Pascal (context) - Hansen - 1975
50 Proving properties of programs by structural induction (context) - Burstall
49 Fundamentals of Algebraic Specication 1: Equations and Initi.. (context) - Ehrig, Mahr - 1985
49 Correctness of a compiler for arithmetic expressions - McCarthy, Painter
48 Towards a mathematical science of computation (context) - McCarthy - 1963
45 Prentice-Hall International (context) - Hayes, Case - 1986
44 Algorithmic Language and Program Development (context) - Bauer, ossner - 1982
43 Data Structures = Programs (context) - Wirth - 1976
43 Towards a theory of parallel programming (context) - Hoare - 1972
40 Fixpoint induction and proofs of program properties (context) - Park - 1969
40 Software Development: A Rigorous Approach (context) - Jones - 1980
40 Non-deterministic data types: Models and implementations (context) - Nipkow - 1986
39 the usability of logics which handle partial functions (context) - Cheng, Jones - 1991
39 A system which automatically improves programs (context) - Darlington, Burstall - 1976
38 Concurrency and automata on innite sequences (context) - Park
35 Development Methods for Computer Programs including a Notion.. (context) - Jones - 1981
34 Distributed processes: A concurrent programming concept (context) - Hansen - 1978
33 Social processes and proofs of theorems and programs (context) - DeMillo, Lipton et al. - 1979
33 Mathematical Theory of Program Correctness (context) - de Bakker - 1980
31 Proof of a program: FIND (context) - Hoare - 1971
28 Natural 3-valued logics { characterization and proof theory - Avron - 1991
26 Raven Press (context) - Davis - 1965
24 Procedures and parameters: An axiomatic approach (context) - Hoare - 1971
23 Fundamentals of Algebraic Specication 2: Module Specications.. (context) - Ehrig, Mahr - 1990
23 volume 188 of Lecture Notes in Computer Science (context) - Rozenberg, Petri-nets - 1985
22 Logic and logic programming (context) - Robinson - 1992
21 Program proving as hand simulation with a little induction (context) - Burstall - 1974
20 A survey of mechanical support for formal reasoning (context) - Lindsay - 1988
19 Non-sequential processes (context) - Petri - 1977
19 The humble programmer (context) - Dijkstra - 1972
18 Checking a large routine (context) - Turing - 1949
18 A Specication Language and its Formal Semantics (context) - Spivey - 1988
18 The Vienna Development Method: The Meta-Language (context) - Bj, Jones - 1978
17 Proof rules for the programming language Euclid (context) - London, Guttag et al. - 1978
17 Alan Turing: The Enigma (context) - Hodges
16 Concurrency and Partial Correctness: Proof theories for netw.. (context) - Zwiers - 1988
16 Towards mechanical mathematics (context) - Wang - 1960
16 Formalization of properties of parallel programs (context) - Ashcroft, Manna - 1971
15 Can programming be liberated from the von Neuman style (context) - Backus - 1978
15 Types are not sets (context) - Morris - 1973
15 Prentice Hall International (context) - Hoare, Jones et al. - 1989
14 Mathematical methods for digital systems development (context) - Good, Young - 1991
14 Proof of algorithms by general snapshots (context) - Naur - 1966
13 Consistent and complementary formal theories of the semantic.. (context) - Hoare, Lauer - 1974
12 A constructive approach to the problem of program correctnes.. (context) - Dijkstra - 1968
12 The quest goes on: A survey of proof systems for partial cor.. (context) - Hooman, de Roever - 1986
12 Department of Computer Science (context) - King, Verier et al. - 1969
12 A proof method for cyclic programs (context) - Francez, Pnueli - 1978
12 Existence and description in formal logic (context) - Scott - 1967
12 Two constructive realizations of the block concept and their.. (context) - Lucas - 1968
11 A Semantic Approach to Automatic Program Improvement (context) - Darlington - 1972
11 Formal Language Description Languages for Computer Programmi.. (context) - Steel - 1966
11 volume 252 of Lecture Notes in Computer Science (context) - Bj, Jones et al. - 1987
11 The logic theory machine (context) - Newell, Simon - 1956
11 Prentice Hall International (context) - Bj, Jones et al. - 1982
10 Programming by action clusters (context) - Naur - 1969
10 Program proving: Jumps and functions (context) - Clint, Hoare - 1972
10 The Origins of Digital Computers: Selected Papers (context) - Randell - 1975
10 John von Neumann: Collected Works (context) - Taub - 1963
10 Specication and Transformation of Programs: A Formal Approac.. (context) - Partsch - 1990
10 on three-valued logic (context) - Lukasiewicz, tr et al. - 1920
9 Properties of programs and partial function logic (context) - Manna, McCarthy - 1969
9 Volume II: The Program Transformation System CIP-S (context) - Group, Project - 1987
9 An algebraic denition of simulation between programs (context) - Milner - 1971
8 The equivalence of certain computations (context) - Cooper - 1966
8 Prentice-Hall International (context) - Hehner, of - 1984
8 On formalised computer programs (context) - Luckham, Park et al. - 1970
8 Control predicates are better than dummy variables for reaso.. - Lamport - 1988
8 Programming Methodology: A Collection of Articles by Members.. (context) - Gries - 1978
8 Behavioural Implementation Concepts for Nondeterministic Dat.. (context) - Nipkow
7 Constructing a theory of a data structure as an aid to progr.. (context) - Jones - 1979
7 Formal semantics of programming languages: VDL (context) - Lucas - 1981
7 Correctness preserving program renements: Proof theory and a.. (context) - Back - 1980
7 The mathematical language AUTOMATH { its usage and some of i.. (context) - de Bruijn - 1970
7 Development of Parallel Programs on Shared DataStructures (context) - St - 1990
7 and Achievements (context) - Lucas, Origins - 1987
7 Models for distributed computing (context) - MacQueen - 1979
7 The quest for compositionality: A survey of assertion-based .. (context) - de Roever - 1985
7 An early program proof by Alan Turing (context) - Morris, Jones - 1984
7 Initial algebra semantics (context) - Goguen, Thatcher et al. - 1975
6 Volume I: The Wide Spectrum Language CIP-L (context) - Group, Project - 1985
6 Systematic Programming: An Introduction (context) - Wirth - 1973
6 A logic covering undenedness in program proofs (context) - Barringer, Cheng et al. - 1984
6 Formal development of correct algorithms: an example based o.. (context) - Jones - 1972
6 the semantics of programming languages and software devices (context) - Lucas - 1972
6 Ten years of Hoare's logic: A survey { part II: Nondetermini.. (context) - Apt - 1984
6 Specication and design (context) - Jones - 1983
6 Partial Valued Logic (context) - Blamey - 1980
6 On Ianov's program schemata (context) - Rutledge - 1964
6 Partial-predicate logic in computer science (context) - Hoogewijs - 1987
5 Der Computer: Mein Lebenswerk (context) - Zuse - 1984
5 A formal description of a subset of ALGOL (context) - McCarthy
5 Science of Computer Programming (context) - Tarlecki, of et al. - 1985
5 History of Programming Languages (context) - Wexelblat - 1981
5 A technique for showing that two functions preserve a relati.. (context) - Jones - 1970
5 Logic for computable functions description of a machine impl.. (context) - Milner - 1972
5 Correctness of two compilers for a Lisp subset (context) - London - 1971
5 Can program proving be made practical (context) - Dahl - 1978
5 Formal development of programs (context) - Jones - 1973
5 Equivalence Problems in a Model of Computation (context) - Paterson - 1967
5 Recursion and parameter mechanisms: An axiomatic approach (context) - de Roever - 1974
5 Programming Research Group (context) - Roscoe, Hoare et al. - 1986
4 Formalization in program development (context) - Naur - 1982
4 Revised report on the algorithmic language Algol (context) - Backus, Bauer et al. - 1963
4 Mathematical proofs about computer programs (context) - Cooper - 1967
4 Numerical analysis as an independent science (context) - van Wijngaarden
4 An axiomatic denition of the programming language Pascal (context) - Hoare, Wirth - 1973
4 Concise Survey of Computer Methods (context) - Naur - 1974
4 Correctness in Operating Systems (context) - Lauer - 1972
4 The Specication and Application to Programming of Abstract D.. (context) - Guttag - 1975
4 volume 328 of Lecture Notes in Computer Science (context) - Bloomeld, Marshall et al. - 1988
4 A programming methodology for operating system design (context) - Hansen - 1974
4 Memoirs of a Computer Pioneer (context) - Wilkes - 1985
4 Algorithm Synthesis: A Comparative Study (context) - Steier, Anderson - 1989
4 Experience with inductive assertions for proving programs co.. (context) - London - 1970
4 Technical Report ICSCA-CMP (context) - Good, Cohen et al. - 1978
4 volume 551 of Lecture Notes in Computer Science (context) - Prehn, Toetenel et al. - 1991
4 Theory of program schemata (context) - Ershov - 1971
4 volume 552 of Lecture Notes in Computer Science (context) - Prehn, Toetenel et al. - 1991
4 The correctness of numerical algorithms (context) - Hull, Enright et al. - 1972
4 A formal notion of simulation between programs (context) - Milner - 1970
3 Mathematical semantics for two simple languages (context) - Strachey, Scott - 1970
3 Formal Models in Programming (context) - Neuhold, Chroust
3 A correctness proof of the Fisher-Galler algorithm using ind.. (context) - London - 1970
3 Program simulation: An extended formal notion (context) - Milner - 1971
3 Heinz Zemanek { Ein Computerpionier (context) - Chroust - 1985
3 Proving programs correct: Some techniques and examples (context) - London - 1970
3 A Computer Program for Discovering and Proving Sequential Re.. (context) - London - 1964
3 Paper for Newcastle IBM Seminar (context) - Zemanek, history et al. - 1974
3 the sieve of Eratosthenes (context) - Hoare, program - 1972
3 Consistent Formal Theories of the Semantics of Programming L.. (context) - Lauer - 1971
3 International Lecture Series in Computer Science (context) - Boyer, Moore et al. - 1981
3 Dijkstra's predicate transformer (context) - de Roever - 1976
3 Mathematical Studies of Information Processing (context) - Blum, Paul et al. - 1979
3 Semiotics and programming languages (context) - Zemanek - 1966
3 Advice on stucturing compilers and proving them correct (context) - Morris - 1973
3 The resolution principal in theorem proving (context) - Luckham - 1967
3 Proof of a recursive program: Quicksort (context) - Foley, Hoare - 1971
3 Technical Report ISF (context) - Petri - 1976
3 A short introduction to the art of programming (context) - Dijkstra - 1971
3 A Logic for Partial Functions (context) - Cheng - 1986
3 Symposium on Semantics of Algorithmic Languages (context) - Engeler - 1971
3 CarnegieMellon University (context) - Manna, Algorithms - 1968
3 Common programming language task: Final report No (context) - Gorn - 1959
3 Part 3 of Annual Review in Automatic Programming (context) - Lucas, Walk et al. - 1969
3 Systems analysis and programming (context) - Strachey - 1966
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.ncl.ac.uk/research/trs/papers/): More
Introducing Real-time Interactions - Henderson (2000) (Correct)
True Anonymity Without Mixes - Molina-Jiménez, Marshall (2001) (Correct)
Exception Handling in Component-Based System Development - Romanovsky (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC