Add to ORKGThis paper aims to introduce a method for verification of programs, which is fully automatic. This method consists in an algorithm called ALICE which, given a program and an algebraic specification, answers if the program is correct w.r.t. the algebraic specification. No user intervention is needed (except, of course, the writing of the program and the specification). The paper also proves that the problem of determining the correctness of a program w.r.t. an algebraic specification is undecidable (even if only partial correctness is required)
Reliability is critical for system software, such as OS kernels, mobile browsers, embedded systems a...
In this paper, we summarize the results on program verification through semi-algebraic systems (SASs...
Abstract—this paper describes a verification method of au-tomata based programs [1] based on symboli...
This paper aims to introduce a method for verification of programs, which is fully automatic. This...
Formal verification of complex algorithms is challenging. Verifying their implementations goes beyo...
A new semantics for algebraic specifications, called visible semantics, is defined. Its most notable...
This paper proposes an algebraic method to prove the correctness of Arithmetic Program which halts i...
Formal verification of complex algorithms is challenging. Verifying their implementations goes beyon...
This work develops new automated reasoning techniques for verifying the correctness of equationally ...
Software model checking is the algorithmic analysis of programs to prove prop-erties of their execut...
Developing a verifying compiler---a compiler that proves that components are correct with respect to...
Programming is error-prone. It is even worse when programming a quantum computer or designing quantu...
Whereas early researchers in computability theory described effective computability in terms of such...
A program correctness checker is an algorithm for checking the output of a computation. This paper d...
Static analysis of program semantics can be used to provide strong guarantees about the correctness ...
Reliability is critical for system software, such as OS kernels, mobile browsers, embedded systems a...
In this paper, we summarize the results on program verification through semi-algebraic systems (SASs...
Abstract—this paper describes a verification method of au-tomata based programs [1] based on symboli...
This paper aims to introduce a method for verification of programs, which is fully automatic. This...
Formal verification of complex algorithms is challenging. Verifying their implementations goes beyo...
A new semantics for algebraic specifications, called visible semantics, is defined. Its most notable...
This paper proposes an algebraic method to prove the correctness of Arithmetic Program which halts i...
Formal verification of complex algorithms is challenging. Verifying their implementations goes beyon...
This work develops new automated reasoning techniques for verifying the correctness of equationally ...
Software model checking is the algorithmic analysis of programs to prove prop-erties of their execut...
Developing a verifying compiler---a compiler that proves that components are correct with respect to...
Programming is error-prone. It is even worse when programming a quantum computer or designing quantu...
Whereas early researchers in computability theory described effective computability in terms of such...
A program correctness checker is an algorithm for checking the output of a computation. This paper d...
Static analysis of program semantics can be used to provide strong guarantees about the correctness ...
Reliability is critical for system software, such as OS kernels, mobile browsers, embedded systems a...
In this paper, we summarize the results on program verification through semi-algebraic systems (SASs...
Abstract—this paper describes a verification method of au-tomata based programs [1] based on symboli...