## Formal Methods and the Certification of Critical Systems (1993)

### Cached

### Download Links

Citations: | 70 - 0 self |

### BibTeX

@MISC{Rushby93formalmethods,

author = {John Rushby},

title = {Formal Methods and the Certification of Critical Systems},

year = {1993}

}

### Years of Citing Articles

### OpenURL

### Abstract

### Citations

2922 | Graph-based algorithms for boolean function manipulation - Bryant - 1986 |

1359 | An Axiomatic Basis for Computer Programming - Hoare - 1969 |

1203 | The temporal logic of programs - Pnueli - 1977 |

1176 | Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications - Clarke, Emerson, et al. - 1986 |

1074 | A computing procedure for quantification theory - Davis, Putnam - 1962 |

943 | A machine-oriented logic based on the resolution principle - Robinson - 1965 |

806 | The temporal logic of actions - Lamport - 1991 |

710 | A New Introduction to Modal Logic - Hughes, Cresswell - 1996 |

686 | Introduction to Metamathematics - Kleene - 1952 |

634 | Modal Logic: an Introduction - Chellas - 1980 |

598 | A Mathematical Introduction to Logic - Enderton - 2002 |

573 | Symbolic model checking: 10 20 states and beyond - Burch, Clarke, et al. - 1990 |

533 | PVS: A Prototype Verification System - Shankar - 1992 |

530 | A computational logic - Boyer, Moore - 1979 |

401 | Constructive analysis - Bishop, Bridges - 1985 |

395 | A Computational Logic Handbook - Boyer, Moore - 1988 |

392 | Simplification by cooperating decision procedures - Nelson, Oppen - 1982 |

359 | Binary decision diagrams - Akers - 1978 |

238 | A Really Temporal Logic - Alur, Henzinger - 1994 |

216 | Mathematical Logic - Shoenfield - 1967 |

198 |
Understanding Z: A specification language and its formal semantics
- Spivey
- 1988
(Show Context)
Citation Context ..., Denmark, August 1981. Volume 134 of Lecture Notes in Computer Science, SpringerVerlag. [Spi87] Cary R. Spitzer. Digital Avionics Systems. Prentice-Hall, Englewood Cliffs, NJ, 1987.s214 Bibliography =-=[Spi88]-=- J. M. Spivey. Understanding Z: A Specification Language and its Formal Semantics. Cambridge Tracts in Theoretical Computer Science 3. Cambridge University Press, Cambridge, UK, 1988. [Spi93] J. M. Sp... |

198 | Melham, editors. Introduction to HOL: A Theorem Proving Environment for Higher Order Logic - Gordon, F - 1993 |

196 | Specifying real-time properties with metric temporal logic. RealTime Systems 2(4 - Koymans - 1990 |

196 | Nonstandard Analysis - Robinson - 1966 |

186 | Computability and logic - Boolos, Burgess, et al. - 2007 |

185 | Initial Algebra Semantics and Continuous Algebras - Goguen, Thatcher, et al. - 1977 |

158 |
Deciding combinations of theories
- Shostak
- 1984
(Show Context)
Citation Context ...ty. Communications of the ACM, 21(7):583–585, July 1978. [Sho79] Robert E. Shostak. A practical decision procedure for arithmetic with function symbols. Journal of the ACM, 26(2):351–360, April 19=-=79. [Sho84] Rob-=-ert E. Shostak. Deciding combinations of theories. Journal of the ACM, 31(1):1–12, January 1984. [SIG91] SIGSOFT ’91: Software for Critical Systems, New Orleans, LA, December 1991. Published as AC... |

151 | Logic for Computer Science, Foundations of Automatic Theorem Proving. Harper and Row - Gallier - 1986 |

150 | Scattering theory - Lax, Phillips - 1989 |

121 | Automated Deduction by Theory Resolution
- Stickel
- 1985
(Show Context)
Citation Context ...nable time. If we add decision procedures for the theories concerned, then unification needs to be performed modulo these interpreted theories and it is a research topic to make this work effectively =-=[Sti85]-=-.s250 Appendix A. A Rapid Introduction to Mathematical Logic we try to prove in formal methods are untrue when first formulated, and resolution provides little help in such cases (though it can someti... |

118 | The Development of Logic - Kneale, Kneale - 1964 |

113 | ALogical Approach to Discrete Math - Gries, Schneider - 1994 |

112 | The algebraic specification of abstract data types - Guttag, Horning - 1978 |

106 | Variations on the common subexpression problem - Downey, Sethi, et al. - 1980 |

101 | Relevant Logic and Entailment - Dunn - 1986 |

99 |
Principia Mathematica
- Whitehead, Russell
- 1957
(Show Context)
Citation Context ...nds of objects represented and manipulated.sA.10. Typed Systems and Higher-Order Logic 279 A.10 Typed Systems and Higher-Order Logic While Zermelo and Fraenkel developed axiomatic set theory, Russell =-=[WR27] exp-=-lored a different approach to the construction of a consistent set theory. 60 Considered from one perspective, Russell’s paradox demonstrates that Frege’s axiom of comprehension is dangerously unr... |

93 | Formal Hardware Verification Methods: A Survey". Formai Methods - Gupta - 1992 |

88 | Why higher-order logic is a good formalism for specifying and verifying hardware - Gordon - 1985 |

85 | Modelling knowledge and action in distributed systems - Halpern, Fagin - 1989 |

84 |
Cultural Theory
- Thompson, Ellis, et al.
- 1990
(Show Context)
Citation Context ...t be described by simply listing their axioms: the entire apparatus of the system has to be developed, and I do not have space to attempt this here. Interested readers can find a good introduction in =-=[Tho91]-=-. Constructive type theories are the foundation for a number of interesting systems for formal specifications and proofs, of which the oldest and best known is Nuprl [CAB + 86] (which is based on, and... |

82 | An overview of the MIZAR project - Rudnicki - 1992 |

81 | Axiomatic Set Theory - Suppes - 1960 |

78 | IMPS: An interactive mathematical proof system - Farmer, Guttman, et al. - 1990 |

76 |
A unification algorithm for associative–commutative functions
- Stickel
- 1981
(Show Context)
Citation Context ...e substitution instance for x is less than that for y in some suitable ordering). Similar techniques can be used for operators that are associative (and for the combined associative-commutative case) =-=[Sti81]. -=-These techniques are usually embedded in the matching rather than the rewriting mechanism, and referred to as AC-matching.sA.5. First-Order Theories 255 for example, we used the rewrite rules a → b ... |

76 | A mathematical incompleteness in Peano arithmetic, Handbook for mathematical logic - Paris, Harrington - 1977 |

74 | A Partial Functions Version of Church’s Simple Theory of Types - Farmer - 1990 |

69 | Edinburgh LCF, A Mechanized Logic - Gordon, Milner, et al. - 1979 |

65 |
A practical decision procedure for arithmetic with function symbols
- Shostak
- 1979
(Show Context)
Citation Context ... formulas. Journal of the ACM, 24(4):529–543, October 1977.sBibliography 213 [Sho78] Robert E. Shostak. An algorithm for reasoning about equality. Communications of the ACM, 21(7):583–585, July 19=-=78. [Sho79] R-=-obert E. Shostak. A practical decision procedure for arithmetic with function symbols. Journal of the ACM, 26(2):351–360, April 1979. [Sho84] Robert E. Shostak. Deciding combinations of theories. Jo... |

65 | Introduction to Logic - Copi - 1967 |

64 | Mathematical logic - Kleene - 1967 |