Results 261 to 270 of about 24,130 (303)

Mixed applicative and imperative programs

Parallel Computing, 1990
Abstract In this paper we describe an interface for combining routines written in conventional imperative languages like FORTRAN with those written in newer applicative languages. The purpose is to allow re-use of extant software without change in combination with applicative code that has potential for highly parallel execution.
R. R. Oldehoeft, James R. McGraw
openaire   +1 more source

Hierarchical parallelization of imperative programs

1993 Euromicro Workshop on Parallel and Distributed Processing, 2002
We develop a general and efficient hierarchical parallelization algorithm for /spl I.bold/w/spl I.bold/h/spl I.bold/i/spl I.bold/l/spl I.bold/e programs which, in contrast to previous attempts, does not include run-time checks, preserves determinism and maintains the size of the argument program.
Andrea Kindler, Thomas Noll 0001, Bernhard Steffen   +2 more
openaire   +1 more source

Direct Manipulation for Imperative Programs

2019
Direct manipulation is a programming paradigm in which the programmer conveys the intended program behavior by modifying program values at runtime. The programming environment then finds a modification of the original program that yields the manipulated values. In this paper, we propose the first framework for direct manipulation of imperative programs.
Qinheping Hu, Roopsha Samanta, Rishabh Singh, Loris D'Antoni   +3 more
openaire   +1 more source

Algebraic Semantics of Imperative Programs

1996
Algebraic Semantics of Imperative Programs presents a self-contained and novel "executable" introduction to formal reasoning about imperative programs. The authors' primary goal is to improve programming ability by improving intuition about what programs mean and how they run.
Joseph A. Goguen, Grant Malcolm
openaire   +1 more source

Imperative programming with dependent types

Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332), 2002
The article enriches imperative programming with a form of dependent types. We start by explaining some motivations for this enrichment and mentioning some major obstacles that need to be overcome. We then present the design of a source level dependently typed imperative programming language Xanadu, forming both static and dynamic semantics and then ...
openaire   +1 more source

Theories for mechanical proofs of imperative programs

Formal Aspects of Computing, 1997
Abstract For convenient application of a first-order theorem prover to verification of imperative programs, it is important to encapsulate the operational semantics in generic theories. The possibility to do so is illustrated by two theories for the Boyer-Moore theorem prover Nqthm.
openaire   +2 more sources

Linear imperative programming with Differential Evolution

2011 IEEE Symposium on Differential Evolution (SDE), 2011
Differential Evolution (DE) is an evolutionary approach for optimizing non-linear continuous space functions. This method is known to be robust and easy to use. DE manipulates vectors of floats that are improved over generations by mating with best and random individuals.
Cyril Fonlupt, Denis Robilliard, Virginie Marion-Poty   +2 more
openaire   +1 more source

Programmable Verifiers in Imperative Programming

2010
This paper studies the relation between execution and verification. A simple imperative language called VerExec with execution and verification commands is introduced. A machine only executes execution commands of a program, while the compiler only performs the verification commands. Common commands in other languages can be defined as a combination of
openaire   +1 more source

Imperative Programming Languages

2010
We start our presentation with the translation of an imperative programming language. As an example, we consider a subset of the programming language C. Our target language for translation is the instruction set of a suitable virtual machine, which has been specificly designed for this purpose. This virtual machine is called C-Machine or CMa for short.
Reinhard Wilhelm, Helmut Seidl
openaire   +1 more source

* Extraction and Imperative Programming

2004
We can use the Coq system to model programs, by describing them as functions in a purely functional programming language. However, the Coq system does not provide an efficient environment to execute them. It is better to rely on the usual programming tools (compilers, abstract machines, and so on) to provide this environment.
Yves Bertot, Pierre Castéran
openaire   +1 more source