Results 221 to 230 of about 45,469 (261)
Formal Derivation of Distributed MapReduce [PDF]
Lecture Notes in Computer Science, 2014 MapReduce is a powerful distributed data processing model that is currently adopted in a wide range of domains to efficiently handle large volumes of data, i.e., cope with the big data surge. In this paper, we propose an approach to formal derivation of the MapReduce framework.
Asieh Salehi Fathabadi +2 more
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Formal Derivation of Algorithms
ACM Transactions on Mathematical Software, 2003In this paper we apply a formal approach for the derivation of dense linear algebra algorithms to the triangular Sylvester equation. The result is a large family of provably correct algorithms. By using a coding style that reflects the algorithms as they are naturally presented, the correctness of the algorithms carries through to the correctness of ...
Enrique S Quintana-Ortí +2 more
exaly +4 more sources
A formal derivation of Heaps' Law
Information Sciences, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Leijenhorst, D.C. van +1 more
openaire +2 more sources
Formal Derivation of Rule-Based Programs
IEEE Transactions on Software Engineering, 1993It is shown that a combination of specification and program refinement may be applied to deriving efficient concurrent rule-based programs. Specification refinement is used to generate an initial rule-based program that is refined into a program which is highly concurrent and efficient.
R F Gamble
exaly +3 more sources
Formally deriving an STG machine
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming, 2003Starting from P. Sestoft semantics for lazy evaluation, we define a new semantics in which normal forms consist of variables pointing to lambdas or constructions. This is in accordance with the more recent changes in the Spineless Tagless G-machine (STG) machine, where constructions only appear in closures (lambdas only appeared in closures already in ...
Alberto de la Encina, Ricardo Pena
openaire +2 more sources
Derivations and Formalizations
2017The deductive rules studied in the previous chapters have been implemented in several computational environments such as theorem provers and proof assistants.
Mauricio Ayala-Rincón +1 more
openaire +1 more source
A Formal Derivation of Composite Trust
2013Trust appears in asymmetric interactions, where one party (the active party) can easily betray a stakeholder (the passive party). Over the Internet, the amount of information that a passive party can use to determine the integrity of an active party is often limited.
MULLER, Tim, SCHWEITZER, Patrick
openaire +2 more sources
Formal Derivation of Spanning Trees Algorithms
2003Graphs algorithms and graph-theoretical problems provide a challenging battlefield for the incremental development of proved models. The B event-based approach implements the incremental and proved development of abstract models which are translated into algorithms; we focus our methodology on the minimum spanning tree problem and on Prim's algorithm ...
Abrial, Jean-Raymond +2 more
openaire +3 more sources
Formal synthesis of chelamidine alkaloids and their derivatives
Chemical Communications, 2018A concise two-step operation of α-amination of aldehydes and subsequent Friedel–Crafts/Prins-type cyclization towards accessing tetrahydrobenzo[ c ]phenanthridine and related structures was developed.
Rui-Qi Li +5 more
openaire +2 more sources
The Formalism of Derived Categories
2001Let A be an abelian category. The derived category D(A)of A is a quotient category of the abelian category Kom(A)of complexes over A. The quotient category is defined by making quasiisomorphisms into isomorphisms and this allows to identify complexes with their resolutions.
Reinhardt Kiehl, Rainer Weissauer
openaire +1 more source