Sciweavers

1073 search results - page 40 / 215
» Formal Program Development with Approximations
Sort
View
FPCA
1995
14 years 7 days ago
The Functional Side of Logic Programming
In this paper we study the relationships between logic programming and functional programming, trying to answer the following basic question: to what extent is logic programming j...
Massimo Marchiori
IPPS
1998
IEEE
14 years 28 days ago
Building BSP Programs Using the Refinement Calculus
Abstract. We extend the refinement calculus to permit the derivation of programs in the Bulk Synchronous Parallelism (BSP) style. This demonstrates that formal approaches developed...
David B. Skillicorn
TAPSOFT
1995
Springer
14 years 6 days ago
Generic Techniques for Source-Level Debugging and Dynamic Program Slicing
Algebraic specifications have been used successfully as a formal basis for software development. This paper discusses how the origin and dynamic dependence relations implicitly de...
Frank Tip
AIIA
1995
Springer
14 years 7 days ago
Learning Programs in Different Paradigms using Genetic Programming
Genetic Programming (GP) is a method of automatically inducing programs by representing them as parse trees. In theory, programs in any computer languages can be translated to par...
Man Leung Wong, Kwong-Sak Leung
HIPC
2007
Springer
14 years 16 days ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri