In this paper, we summarize the results on program verification through semi-algebraic systems (SASs) solving that we have obtained, including automatic discovery of invariants and ranking functions, symbolic decision procedure for the termination of a class of linear loops, termination analysis of nonlinear systems, and so on.Computer Science, Information SystemsComputer Science, Software EngineeringComputer Science, Theory & MethodsSCI(E)EI中国科学引文数据库(CSCD)9REVIEW11-16
This paper presents a first attempt at implementing an algorithm with result verification for linear...
Abstract. Modeling and analysis techniques are presented for real-time, safety-critical software. So...
Static analysis of program semantics can be used to provide strong guarantees about the correctness ...
Recent advances in program verification indicate that various verification problems can be reduced t...
Abstract. The discovery of invariants and ranking functions plays a central role in program verifica...
The discovery of invariants and ranking functions plays a central role in program verification. In o...
AbstractThe problem-oriented verification system SPECTRUM using the set of linear algebra programs a...
One of the main application areas and driving forces behind the development of Satisfiability Modulo...
This paper aims to introduce a method for verification of programs, which is fully automatic. This...
This paper proposes an algebraic method to prove the correctness of Arithmetic Program which halts i...
Abstract. Most of the properties established during program verification are either invariants or de...
While the state of the art is relatively sophisticated in programming language support for computer ...
In contrast to pure mathematical applications where automated theorem provers (ATPs) are quite capab...
In order to verify semialgebraic programs, we automatize the Floyd/Naur/Hoare proof method. The main...
In order to verify semialgebraic programs, we automatize the Floyd/Naur/Hoare proof method. The main...
This paper presents a first attempt at implementing an algorithm with result verification for linear...
Abstract. Modeling and analysis techniques are presented for real-time, safety-critical software. So...
Static analysis of program semantics can be used to provide strong guarantees about the correctness ...
Recent advances in program verification indicate that various verification problems can be reduced t...
Abstract. The discovery of invariants and ranking functions plays a central role in program verifica...
The discovery of invariants and ranking functions plays a central role in program verification. In o...
AbstractThe problem-oriented verification system SPECTRUM using the set of linear algebra programs a...
One of the main application areas and driving forces behind the development of Satisfiability Modulo...
This paper aims to introduce a method for verification of programs, which is fully automatic. This...
This paper proposes an algebraic method to prove the correctness of Arithmetic Program which halts i...
Abstract. Most of the properties established during program verification are either invariants or de...
While the state of the art is relatively sophisticated in programming language support for computer ...
In contrast to pure mathematical applications where automated theorem provers (ATPs) are quite capab...
In order to verify semialgebraic programs, we automatize the Floyd/Naur/Hoare proof method. The main...
In order to verify semialgebraic programs, we automatize the Floyd/Naur/Hoare proof method. The main...
This paper presents a first attempt at implementing an algorithm with result verification for linear...
Abstract. Modeling and analysis techniques are presented for real-time, safety-critical software. So...
Static analysis of program semantics can be used to provide strong guarantees about the correctness ...