Results 1 - 10 of 1,938

An axiomatic basis for computer programming

by C. A. R. Hoare - COMMUNICATIONS OF THE ACM , 1969
"... In this paper an attempt is made to explore the logical founda-tions of computer programming by use of techniques which were first applied in the study of geometry and have later been extended to other branches of mathematics. This in-volves the elucidation of sets of axioms and rules of inference w ..."
Abstract - Cited by 1754 (4 self) - Add to MetaCart
which can be used in proofs of the properties of computer programs. Examples are given of such axioms and rules, and a formal proof of a simple theorem is displayed. Finally, it is argued that important advantages, both theoretical and prac-tical, may follow from a pursuance of these topics.

AgentSpeak(L): BDI Agents speak out in a logical computable language

by Anand S. Rao , 1996
"... Belief-Desire-Intention (BDI) agents have been investigated by many researchers from both a theoretical specification perspective and a practical design perspective. However, there still remains a large gap between theory and practice. The main reason for this has been the complexity of theorem-prov ..."
Abstract - Cited by 514 (2 self) - Add to MetaCart
-proving or model-checking in these expressive specification logics. Hence, the implemented BDI systems have tended to use the three major attitudes as data structures, rather than as modal operators. In this paper, we provide an alternative formalization of BDI agents by providing an operational and proof

Local Reasoning about Programs that Alter Data Structures

by Peter O'Hearn, John Reynolds, Hongseok Yang , 2001
"... We describe an extension of Hoare's logic for reasoning about programs that alter data structures. We consider a low-level storage model based on a heap with associated lookup, update, allocation and deallocation operations, and unrestricted address arithmetic. The assertion language is ba ..."
Abstract - Cited by 324 (28 self) - Add to MetaCart
by a particular command. Through these and a number of examples we show that the formalism supports local reasoning: A speci- cation and proof can concentrate on only those cells in memory that a program accesses. This paper builds on earlier work by Burstall, Reynolds, Ishtiaq and O

A Linear Logical Framework

by Iliano Cervesato, Frank Pfenning , 1996
"... We present the linear type theory LLF as the forAppeared in the proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science --- LICS'96 (E. Clarke editor), pp. 264--275, New Brunswick, NJ, July 27--30 1996. mal basis for a conservative extension of the LF logical framework. ..."
Abstract - Cited by 234 (48 self) - Add to MetaCart
We present the linear type theory LLF as the forAppeared in the proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science --- LICS'96 (E. Clarke editor), pp. 264--275, New Brunswick, NJ, July 27--30 1996. mal basis for a conservative extension of the LF logical framework

Formal proof—theory and practice

by John Harrison - Notices AMS , 2008
"... Aformal proof is a proof written in a precise artificial language that admits only a fixed repertoire of stylized steps. This formal language is usually designed so that there is a purely mechanical process by which the correctness of a proof in the language can be verified. Nowadays, there are nume ..."
Abstract - Cited by 21 (1 self) - Add to MetaCart
, there are numerous computer programs known as proof assistants that can check, or even partially construct, formal proofs written in their preferred proof language. These can be considered as practical, computer-based realizations of the traditional systems of formal symbolic logic and set theory proposed

Reusing Formal Proofs Through Isomorphisms ∗ Invited Talk

by Mauricio Ayala-rincón
"... Formalization of computational objects, software and hardware, is the unique manner to guarantee well-behavior of computer programs and hardware, at least from the mathematical and logical point of view. Several verification and testing approaches have been proved of great applicability in this area ..."
Abstract - Add to MetaCart
Formalization of computational objects, software and hardware, is the unique manner to guarantee well-behavior of computer programs and hardware, at least from the mathematical and logical point of view. Several verification and testing approaches have been proved of great applicability

Checking that finite state concurrent programs satisfy their linear specification

by Orna Lichtenstein, Amir Pnueli - In POPL ’85: Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , 1985
"... We present an algorithm for checking satisfiabil-ity of a linear time temporal logic formula over a finite state concurrent program. The running time of the al-gorithm is exponential in the size of the formula but lin-ear in the size of the checked program. The algorithm yields also a formal proof i ..."
Abstract - Cited by 260 (6 self) - Add to MetaCart
We present an algorithm for checking satisfiabil-ity of a linear time temporal logic formula over a finite state concurrent program. The running time of the al-gorithm is exponential in the size of the formula but lin-ear in the size of the checked program. The algorithm yields also a formal proof

A Static Analyzer for Large Safety-Critical Software

by Bruno Blanchet, Patrick Cousot, Radhia Cousot, Jerome Feret, Laurent Mauborgne, Antoine Mine, David Monniaux, Xavier Rival , 2003
"... We show that abstract interpretation-based static program analysis can be made e#cient and precise enough to formally verify a class of properties for a family of large programs with few or no false alarms. This is achieved by refinement of a general purpose static analyzer and later adaptation to p ..."
Abstract - Cited by 271 (54 self) - Add to MetaCart
to particular programs of the family by the end-user through parametrization. This is applied to the proof of soundness of data manipulation operations at the machine level for periodic synchronous safety critical embedded software. The main novelties are the design principle of static analyzers by refinement

Implementing Mathematics with The Nuprl Proof Development System

by Robert L. Constable, Stuart F. Allen, S. F. Allen, H. M. Bromley, W. R. Cleaveland, J. F. Cremer, R. W. Harper, Douglas J. Howe, T. B. Knoblock, N. P. Mendler, P. Panangaden, Scott F. Smith, James T. Sasaki, S. F. Smith , 1986
"... Problem solving is a significant part of science and mathematics and is the most intellectually significant part of programming. Solving a problem involves understanding the problem, analyzing it, exploring possible solutions, writing notes about intermediate results, reading about relevant methods, ..."
Abstract - Cited by 195 (18 self) - Add to MetaCart
, checking results, and eventually assembling a solution. Nuprl is a computer system which provides assistance with this activity. It supports the interactive creation of proofs, formulas, and terms in a formal theory of mathematics

Formal certification of code-based cryptographic proofs

by Gilles Barthe, Benjamin Grégoire, Santiago Zanella - 4 th Workshop on Formal and Computational Cryptography (FCC , 2008
"... As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-based techniques provide a popular approach in which proofs are structured as sequences of games, and in which proof steps es ..."
Abstract - Cited by 84 (25 self) - Add to MetaCart
establish the validity of transitions between successive games. Code-based techniques form an instance of this approach that takes a code-centric view of games, and that relies on programming language theory to justify proof steps. While code-based techniques contribute to formalize the security statements
Results 1 - 10 of 1,938