Floating point error is a drawback of embedded systems implementation that is difficult to avoid. Computing rigorous upper bounds of roundoff errors is absolutely necessary for the validation of ...critical software. This problem of computing rigorous upper bounds is even more challenging when addressing non-linear programs. In this paper, we propose and compare two new algorithms based on Bernstein expansions and sparse Krivine-Stengle representations, adapted from the field of the global optimization, to compute upper bounds of roundoff errors for programs implementing polynomial and rational functions. We also provide the convergence rate of these two algorithms. We release two related software package \mathtt {FPBern}FPBern and \mathtt {FPKriSten}FPKriSten, and compare them with the state-of-the-art tools. We show that these two methods achieve competitive performance, while providing accurate upper bounds by comparison with the other tools.
We propose a new approach to analyzing higher-order recursive schemes. Many results in the literature use automata models generalizing pushdown automata, most notably higher-order pushdown automata ...with collapse (CPDA). Instead, we propose to use the Krivine machine model. Compared to CPDA, this model is closer to lambda-calculus, and incorporates nicely many invariants of computations, as for example the typing information. The usefulness of the proposed approach is demonstrated with new proofs of two central results in the field: the decidability of the local and global model checking problems for higher-order schemes with respect to the mu-calculus.
Classical and relative realizability van Oosten, Jaap; Zou, Tingxiang
Theory and applications of categories,
01/2016, Letnik:
31, Številka:
22
Journal Article
Floating point error is a notable drawback of embedded systems implementation. Computing rigorous upper bounds of roundoff errors is absolutely necessary for the validation of critical software. This ...problem of computing rigorous upper bounds is even more challenging when addressing non-linear programs. In this paper, we propose and compare two new methods based on Bernstein expansions and sparse Krivine-Stengle representations, adapted from the field of the global optimization, to compute upper bounds of roundoff errors for programs implementing polynomial functions. We release two related software package FPBern and FPKriSten, and compare them with state of the art tools. We show that these two methods achieve competitive performance, while computing accurate upper bounds by comparison with other tools.
Sequent Calculi and Abstract Machines ARIOLA, Zena M; SABRY, Amr
ACM transactions on programming languages and systems,
05/2009, Letnik:
31, Številka:
4
Journal Article
Recenzirano
Odprti dostop
We propose a sequent calculus derived from the lambda mumu~-calculus of Curien and Herbelin that is expressive enough to directly represent the fine details of program evaluation using typical ...abstract machines. Not only does the calculus easily encode the usual components of abstract machines such as environments and stacks, but it can also simulate the transition steps of the abstract machine with just a constant overhead. Technically this is achieved by ensuring that reduction in the calculus always happens at a bounded depth from the root of the term. We illustrate these properties by providing shallow encodings of the Krivine (call-by-name) and the CEK (call-by-value) abstract machines in the calculus.
Stewart-MacDonald reviews some of Beethoven's compositions, including Piano Trio op.1, no.3 and Symphony no.2 in D major, op.36 by AtIantis Trio; Concerti 1 & 2 pour le pianoforte avec accompagnement ...d'orchestre directed and performed by Arthur Schoonderwoerd with Ensemble Cristofori; and Complete symphonies featuring La Chambre Philharmonique and the Choeur de Chambre Les Elements and directed by Emmanuel Krivine.
Implementing Distributed Lamda-Calculus Interpreter Basov, Alexandr; de Carvalho, Daniel; Mazzara, Manuel
2018 32nd International Conference on Advanced Information Networking and Applications Workshops (WAINA)
Conference Proceeding
This paper describes how one can implement distributed λ-calculus interpreter from scratch. At first, we describe how to implement a monadic parser, than the Krivine Machine is introduced for the ...interpretation part and as for distribution, the actor model is used. In this work we are not providing general solution for parallelism, but we consider particular patterns, which always can be parallelized. As a result, the basic extensible implementation of call-by-name distributed machine is introduced and prototype is presented. We achieved computation speed improvement in some cases, but efficient distributed version is not achieved, problems are discussed in evaluation section. This work provides a foundation for further research, completing the implementation it is possible to add concurrency for non-determinism, improve the interpreter using call-by-need semantic or study optimal auto parallelization to generalize what could be done efficiently in parallel.
Newmark Grubb Knight Frank (NGKF) is pleased to announce that a new level of excellence in Chinese cuisine will make its Manhattan debut in the spring of 2017. Famed chef Dong Zhenxiang, one of the ...highest rated in China, has teamed with the investment arm of Kuafu Properties, prominent New York developers, in the launching of the nearly 18,000-square-foot flagship restaurant at the iconic "Cubes" space, adjacent to the Met Life Plaza on 42nd Street at 3 Bryant Park. Dadong was represented by Dennis Karr and Jonathan Krivine of NGKF.
PDF
