Results 261 to 270 of about 13,380 (311)

Security procedures for program libraries

Computers & Security, 1982
Abstract As computer programming has become more complex, management has become more concerned about its own ability to exercise appropriate control over the programmer. This paper describes an implementation of procedures, libraries, and separation of duties to improve security in programming.
openaire   +1 more source

Verifying Probabilistic Procedural Programs

2004
Monolithic finite-state probabilistic programs have been abstractly modeled by finite Markov chains, and the algorithmic verification problems for them have been investigated very extensively. In this paper we survey recent work conducted by the authors together with colleagues on he algorithmic verification of probabilistic procedural programs ([BKS ...
Javier Esparza, Kousha Etessami
openaire   +1 more source

Procedural programming

2016
Το προτεινόμενο σύγγραμμα στοχεύει στην εισαγωγή του πρωτοετούς φοιτητή στις έννοιες του διαδικαστικού προγραμματισμού, του δομημένου προγραμματισμού και του τμηματικού προγραμματισμού. Ως όχημα θα χρησιμοποιηθεί η γλώσσα C, που συνδυάζει τα πλεονεκτήματα των γλωσσών προγραμματισμού υψηλού επιπέδου με την ευελιξία προγραμματισμού σε χαμηλότερο επίπεδο,
openaire   +1 more source

A procedure mechanism for backtrack programming

Proceedings of the annual conference on - ACM 76, 1976
One of the difficulties in using nondeterministic algorithms for the solution of combinatorial problems is that most programming languages do not include features capable of easily representing backtracking processes. This paper describes a procedure mechanism that uses coroutines as a means for the description and realization of nondeterministic ...
openaire   +1 more source

A procedural interface for program directing

Software: Practice and Experience, 1995
AbstractDebugging and performance measurement tools are becoming more important in the development and maintenance of increasingly complex software. These tools belong to a class of programs, called directors. Directors are programs that monitor and control other programs. Through monitoring, directors analyze program execution at runtime.
openaire   +1 more source

A Simplified Procedure for Quadratic Programming

Operations Research, 1963
The problem discussed in this paper deals with maximization (minimization) under linear restrictions, of a quadratic function of the form (1/2XtUX + VX) where U is negative (positive) semi definite. The optimum solution to this problem can be obtained by solving a certain enlarged system of equations representing the Kuhn-Tucker conditions.
openaire   +2 more sources

Program Evaluation: Principles, Procedures, and Practices

2013
This chapter provides a review of the current state of the principles, procedures, and practices within program evaluation. We address a few incisive and difficult questions about the current state of the field: (1) What are the kinds of program evaluations? (2)Why do program evaluation results often have so little impact on social policy?
Aurelio Jose Figueredo, Olderbak, Sally Gayle, Schlomer, Gabriel Lee, Garcia, Rafael Antonio, Wolf, Pedro   +4 more
openaire   +2 more sources

Procedures in Horn-clause programming

1986
In this paper we show the relevance of the notion of procedure to logic programming. We explain how this feature can be obtained by extending first-order logic programs to programs written in a fragment of second-order logic, and outline a combinatory theory of such logic programs. We show how various algebraic structures and abstract data types can be
openaire   +1 more source

A New Decomposition Procedure for Dynamic Programming

Operations Research, 1970
This paper presents a new decomposition procedure that reduces the highspeed memory requirement and interpolations, associated with the dynamic programming algorithm. It shows that an nth-order system described by k coupled difference or differential equations can be treated as a kth-order system with respect to the high-speed memory requirement and ...
openaire   +1 more source

Non-procedural logic programming

1994
We present a logic programming language where both problem domain and computational knowledge are expressed in logic. A logic program in this language consists of an object-program and a number of meta-programs. The object program, a collection of formulae, is a description of the problem domain of interest.
openaire   +1 more source