This article is a survey of recent results, related works and new challenges in automated theorem proving for program checking. The aim is to give some historical perspective, albeit necessarily incomplete, and highlight some of the turning points that made crucial advances possible
Software is vital for modern society. It is used in many safety- or security-critical applications, ...
International audienceIn a world where trusting software systems is increasingly important, formal m...
Modern proof-assistants are now mature enough to formalise many aspects of mathematics. I outline so...
This paper summarizes the theoretical foundations and basic methodology of automated theorem-proving...
AbstractWe present a detailed review of the elements of automated theorem proving, emphasizing certa...
Abstract. In this memo, we discuss the topic of automated theorem proving. This note is intended to ...
A program correctness checker is an algorithm for checking the output of a computation. This paper d...
131 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1983.This thesis contains two part...
Abstract. We argue that the detection and refutation of non-theorems, and the discovery of appropria...
As the 21st century begins, the power of our magical new tool and partner, the computer, is increasi...
Interactive theorem proving is the modern way of formalizing mathematics using a computer as a proof...
Static analysis of program semantics can be used to provide strong guarantees about the correctness ...
Whereas early researchers in computability theory described effective computability in terms of such...
Software is vital for modern society. It is used in manysafety- or security-critical applications, w...
This paper presents a discussion on the complementary roles of testing and proof within automated so...
Software is vital for modern society. It is used in many safety- or security-critical applications, ...
International audienceIn a world where trusting software systems is increasingly important, formal m...
Modern proof-assistants are now mature enough to formalise many aspects of mathematics. I outline so...
This paper summarizes the theoretical foundations and basic methodology of automated theorem-proving...
AbstractWe present a detailed review of the elements of automated theorem proving, emphasizing certa...
Abstract. In this memo, we discuss the topic of automated theorem proving. This note is intended to ...
A program correctness checker is an algorithm for checking the output of a computation. This paper d...
131 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1983.This thesis contains two part...
Abstract. We argue that the detection and refutation of non-theorems, and the discovery of appropria...
As the 21st century begins, the power of our magical new tool and partner, the computer, is increasi...
Interactive theorem proving is the modern way of formalizing mathematics using a computer as a proof...
Static analysis of program semantics can be used to provide strong guarantees about the correctness ...
Whereas early researchers in computability theory described effective computability in terms of such...
Software is vital for modern society. It is used in manysafety- or security-critical applications, w...
This paper presents a discussion on the complementary roles of testing and proof within automated so...
Software is vital for modern society. It is used in many safety- or security-critical applications, ...
International audienceIn a world where trusting software systems is increasingly important, formal m...
Modern proof-assistants are now mature enough to formalise many aspects of mathematics. I outline so...
DOI
Add to ORKG