Excerpt from A Single-Pass Algorithm for Eliminating Constraint Checks in Ada Programs
In the remainder of the chapter, test and check will be used as synonyms for the term constraint check.
Unfortunately, because these checks are performed at run-time, there is a (possibly severe) performance penalty associated with them. In recognition of that penalty, the language provides the programmer with the means of not generating these tests through use of the suppress pragma.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
"synopsis" may belong to another edition of this title.
Seller: Forgotten Books, London, United Kingdom
Paperback. Condition: New. No Jacket. Print on Demand. Unlock faster Ada code by eliminating wasted constraint checks. This concise work explains a single-pass technique that removes redundant runtime tests, improving compiler efficiency without heavy data-flow analysis.The book presents a streamlined algorithm focused on syntax-directed optimization. It covers how available expressions, constant propagation, and induction-variable analysis work together to reduce or remove constraint checks in Ada programs. Readers will see how the method relies on straightforward, code-first reasoning rather than complex, pre-analysis passes.Designed for practitioners, the text connects theory to practice. It explains how the compiler can safely treat shared variables and tasking scenarios, while preserving program correctness and behavior. The discussion includes handling of exceptions and goto-like constructs, and outlines the algorithm's structure and data structures. How available expression elimination identifies and drops repeat tests. How constant propagation and sign analysis can fold away bounds checks. How induction variables are analyzed to move tests out of loops. How the approach applies to Ada's features like tasking and exceptions.Ideal for readers of Ada optimization and compiler design, this edition offers a clear, practical view of a faster, safer approach to constraint checking. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Seller Inventory # 9781333549657_0
Quantity: Over 20 available
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781333549657
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781333549657
Quantity: 15 available