Add to ORKGSummary. We define a set of binary arithmetic expressions with the following operations: +, −, ·, mod, and div and formalize the common meaning of the expressions in the set of integers. Then, we define a compile function that for a given expression results in a program for the SCM machine defined by Nakamura and Trybulec in [13]. We prove that the generated program when loaded into the machine and executed computes the value of the expression. The program uses additional memory and runs in time linear in length of the expression
This paper provides the description of my research project on the computational power a programming ...
Abstract: Arithmetic operations and expression evaluations are fundamental in computing models. We f...
We present non-standard denotational specifications of the SSA form and of its conversion processes ...
this paper. One can prove the following propositions: (1) Let I 1 , I 2 be finite sequences of eleme...
The problem of parsing and compiling arithmetic expressions in parallel computational environments i...
Fifty years ago, John McCarthy and James Painter (1967) published the first paper on compiler verifi...
In this thesis, we are dealing with construction of Interpreter of Language of Mathematical function...
"The original publication is available at www.springerlink.com" Copyright Springer [Full text of thi...
AbstractIn this article, we focus on the synthesis of arithmetic expressions that can be evaluated e...
SCHOONSCHIP is a high-speed program which is capable of evaluating expressions of the form: (A1+B1+....
A methodology is described for generating provably correct compilers from denotational definitions ...
A (binary) Mealy machine is a deterministic automaton which in each step reads an input bit, produce...
In this paper we present algorithms for a Boolean encoding of four basic arithmetic operations on in...
Abstract. Computer arithmetic algorithms usually are represented by circuit diagrams which do not se...
In this paper, we propose a methodology for the step-by-step solution of problems, which can be inco...
This paper provides the description of my research project on the computational power a programming ...
Abstract: Arithmetic operations and expression evaluations are fundamental in computing models. We f...
We present non-standard denotational specifications of the SSA form and of its conversion processes ...
this paper. One can prove the following propositions: (1) Let I 1 , I 2 be finite sequences of eleme...
The problem of parsing and compiling arithmetic expressions in parallel computational environments i...
Fifty years ago, John McCarthy and James Painter (1967) published the first paper on compiler verifi...
In this thesis, we are dealing with construction of Interpreter of Language of Mathematical function...
"The original publication is available at www.springerlink.com" Copyright Springer [Full text of thi...
AbstractIn this article, we focus on the synthesis of arithmetic expressions that can be evaluated e...
SCHOONSCHIP is a high-speed program which is capable of evaluating expressions of the form: (A1+B1+....
A methodology is described for generating provably correct compilers from denotational definitions ...
A (binary) Mealy machine is a deterministic automaton which in each step reads an input bit, produce...
In this paper we present algorithms for a Boolean encoding of four basic arithmetic operations on in...
Abstract. Computer arithmetic algorithms usually are represented by circuit diagrams which do not se...
In this paper, we propose a methodology for the step-by-step solution of problems, which can be inco...
This paper provides the description of my research project on the computational power a programming ...
Abstract: Arithmetic operations and expression evaluations are fundamental in computing models. We f...
We present non-standard denotational specifications of the SSA form and of its conversion processes ...