Effective strategic programming for Java developers

Balland, Émilie; Moreau, Pierre-Étienne; Reilles, Antoine

doi:10.1002/spe.2159

Cited by 7 publications

(6 citation statements)

References 46 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…For instance, properties of confluence, termination, or completeness for rewriting under strategies have been addressed, either based on schematization of derivation trees, as in [12], or by tuning proof methods to handle specific strategies (innermost, outermost, lazy strategies) as in [10,11]. Other approaches as [4] use strategies transformation to equivalent rewrite systems to be able to reuse well-known methods. Finally, properties of strategies such as fairness or loop-freeness could be worthfully explored by making connections between different communities (functional programming, proof theory, verification, game theory,...).…”

Section: Resultsmentioning

confidence: 99%

A rewriting point of view on strategies

Kirchner

2013

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

This paper is an expository contribution reporting on published work. It focusses on an approach followed in the rewriting community to formalize the concept of strategy. Based on rewriting concepts, several definitions of strategy are reviewed and connected: in order to catch the higher-order nature of strategies, a strategy is defined as a proof term expressed in the rewriting logic or in the rewriting calculus; to address in a coherent way deduction and computation, a strategy is seen as a subset of derivations; and to recover the definition of strategy in sequential path-building games or in functional programs, a strategy is considered as a partial function that associates to a reduction-in-progress, the possible next steps in the reduction sequence

show abstract

Section: Resultsmentioning

confidence: 99%

A rewriting point of view on strategies

Kirchner

2013

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…Another extension is to provide ways to change the strategy of application of these rules. A very flexible solution would be to allow expert users to write their own strategies as it is possible in embedded term rewriting tools [5].…”

Section: Discussionmentioning

confidence: 99%

Automatic Optimization of Python Skeletal Parallel Programs

Loulergue

Philippe

2020

Algorithms and Architectures for Parallel Processing

View full text Add to dashboard Cite

Skeletal parallelism is a model of parallelism where parallel constructs are provided to the programmer as usual patterns of parallel algorithms. Highlevel skeleton libraries often offer a global view of programs instead of the common Single Program Multiple Data view in parallel programming. A program is written as a sequential program but operates on parallel data structures. Most of the time, skeletons on a parallel data structure have counterparts on a sequential data structure. For example, the map function that applies a given function to all the elements of a sequential collection (e.g., a list) has a map skeleton counterpart that applies a sequential function to all the elements of a distributed collection. Two of the challenges a programmer faces when using a skeleton library that provides a wide variety of skeletons are: which are the skeletons to use, and how to compose them? These design decisions may have a large impact on the performance of the parallel programs. However, skeletons, especially when they do not mutate the data structure they operate on, but are rather implemented as pure functions, possess algebraic properties that allow to transform compositions of skeletons into more efficient compositions of skeletons. In this paper, we present such an automatic transformation framework for the Python skeleton library PySke and evaluate it on several example applications.

show abstract

“…Java is a widely used object‐oriented programming language with the characteristics open‐source and cross‐platform . A typical software framework contains presentation layer, business logic layer, and data access layer .…”

Section: Related Frameworkmentioning

confidence: 99%

JDAS: a software development framework for multidatabases

et al. 2017

View full text Add to dashboard Cite

Modern software development for services computing and cloud computing software systems is no longer based on a single database but on existing multidatabases and this convergence needs new software architecture and framework design. Most current popular frameworks are not designed for multidatabases, and many practical problems in development arise. This study designs and implements a software development framework called Java data access service (JDAS) for multidatabases using the object-oriented programming language Java. The JDAS framework solves related problems that arise when other frameworks are employed in practical software development with multidatabases by presenting and introducing design methods. JDAS consists of the modules of the database abstract, object relational mapping, connection pools management, configuration management, data access service, and inversion of control. Results and case study reveal that the JDAS framework effectively reduces development complexity and improves development efficiency of the software systems with multidatabases.

show abstract

Effective strategic programming for Java developers

Cited by 7 publications

References 46 publications

A rewriting point of view on strategies

A rewriting point of view on strategies

Automatic Optimization of Python Skeletal Parallel Programs

JDAS: a software development framework for multidatabases

Contact Info

Product

Resources

About