Proving program termination is an important step towards ensuring software reliability. the programmers expect that the majority of code fragments, including procedures, event handles, or other program components, alw...
详细信息
Proving program termination is an important step towards ensuring software reliability. the programmers expect that the majority of code fragments, including procedures, event handles, or other program components, always terminates. Unfortunately, until recently there were no viable approaches for automatically proving termination of programs written in imperative programming languages.
We propose a simple solution to Yao's millionaires' problem using thesubtractive homomorphic properties of the secret sharing schemes based on the Chinese remainder theorem (CRT).
We propose a simple solution to Yao's millionaires' problem using thesubtractive homomorphic properties of the secret sharing schemes based on the Chinese remainder theorem (CRT).
In this paper we consider a functional-integral equation with linear modification of the argument. By applying the successive approximation method and by using the trapezoidal formula we give an algorithm for the appr...
详细信息
In this paper we consider a functional-integral equation with linear modification of the argument. By applying the successive approximation method and by using the trapezoidal formula we give an algorithm for the approximation of the solution of this equation.
We present and illustrate a method for the generation of the termination conditions for nested loops with abrupt termination statements. the conditions are (first-order) formulae obtained by certain transformations of...
详细信息
the K framework is a rewrite-based executable semantic framework built withthe purpose to define programming languages and formal analysis methods. this paper introduces K definition of the path-directed symbolic exe...
详细信息
As an extension of our previous work on imperative program verification, we present a formalism for handling the total correctness of While loops in imperative programs, consisting in functional based definitions of t...
详细信息
As an extension of our previous work on imperative program verification, we present a formalism for handling the total correctness of While loops in imperative programs, consisting in functional based definitions of the verification conditions for both partial correctness and for termination.A specific feature of our approach is the generation of verification conditions as first order formulae, including the termination condition which is expressed as an induction principle.
Bounded bi-ideals are a subclass of uniformly recurrent words. We introduce the notion of completely bounded bi-ideals by imposing a restriction on their generating base sequences. We prove that a bounded bi-ideal is ...
详细信息
Bounded bi-ideals are a subclass of uniformly recurrent words. We introduce the notion of completely bounded bi-ideals by imposing a restriction on their generating base sequences. We prove that a bounded bi-ideal is linearly recurrent if and only if it is completely bounded.
the aim of our paper is to solve numerically a second order elliptic BVP, using a collocation method. then, an optimal control problem governed by an elliptic equation is considered and numerical solutions are presented.
the aim of our paper is to solve numerically a second order elliptic BVP, using a collocation method. then, an optimal control problem governed by an elliptic equation is considered and numerical solutions are presented.
We propose general preprocessing techniques to reshape dense multivariate polynomials over finite fields, in order to minimize the cost of memory accesses, while preserving sufficient parallelism, so as to reduce the ...
详细信息
We propose general preprocessing techniques to reshape dense multivariate polynomials over finite fields, in order to minimize the cost of memory accesses, while preserving sufficient parallelism, so as to reduce the running time of polynomial multiplication in multi-threaded implementations.
In this paper the Lucas optimal growth of the human capital and consumption is analyzed on finite horizon. the main purpose is the approximation of the optimal human capital and consumption evolution on infinite horiz...
详细信息
In this paper the Lucas optimal growth of the human capital and consumption is analyzed on finite horizon. the main purpose is the approximation of the optimal human capital and consumption evolution on infinite horizon by the finite case which can be numerically computed.
暂无评论