SLAMM – Automating Memory Analysis for Numerical Algorithms
نویسندگان
چکیده
منابع مشابه
Automating Terrain Analysis: Algorithms for Intelligence Preparation of the Battlefield
Terrain information supplies an important context for ground operations. The layout of terrain is a determining factor in arraying of forces, both friendly and enemy, and the structuring of Courses of Action (COAs). For example, key terrain, such as a bridge over an unfordable river, or terrain that allows observation of the opposing forces line of advance, is likely to give a big military adva...
متن کاملAlgorithms for Numerical Analysis in High Dimensions
Nearly every numerical analysis algorithm has computational complexity that scales exponentially in the underlying physical dimension. The separated representation, introduced previously, allows many operations to be performed with scaling that is formally linear in the dimension. In this paper we further develop this representation by (i) discussing the variety of mechanisms that allow it to b...
متن کاملStatic Analysis of Numerical Algorithms
We present a new numerical abstract domain for static analysis of the errors introduced by the approximation by floating-point arithmetic of real numbers computation, by abstract interpretation [3]. This work extends a former domain [4,8], with an implicitly relational domain for the approximation of the floating-point values of variables, based on affine arithmetic [2]. It allows us to analyze...
متن کاملAutomating Pre-Virtualization for Memory Objects
Virtualization is used to construct several virtual machines on a physical machine for high utilization and other benefits. The virtual machines should run independently within their own domain without disturbing the others’ execution. In order to achieve this purpose, two things are considered: virtualization-sensitive instruction and sensitive memory operation. Since the virtualization-sensit...
متن کاملAutomating Deductive Verification for Weak-Memory Programs
Writing correct programs for weak memory models such as the C11 memory model is challenging because of the weak consistency guarantees these models provide. The first program logics for the verification of such programs have recently been proposed, but their usage has been limited thus far to manual proofs. Automating proofs in these logics via first-order solvers is non-trivial, due to reasoni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2010
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2010.08.034