The digital edition of all books may be viewed on our website before purchase. Excerpt from A Single-Pass Algorithm for Eliminating Constraint Checks in Ada Programs
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books.
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. This text has been digitally restored from a historical edition. Some errors may persist, however we consider it worth publishing due to the work's historical value.The digital edition of all books may be viewed on our website before purchase.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vos droits au titre de la garantie légale : Chaque consommateur de l'UE bénéficie d'au moins deux ans de protection au titre de la garantie légale pour tout bien de consommation vendu dans l'UE. Voir plus
Vendeur : Forgotten Books, London, Royaume-Uni
Paperback. Etat : 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. N° de réf. du vendeur 9781333549657_0
Quantité disponible : Plus de 20 disponibles
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781333549657
Quantité disponible : 15 disponible(s)
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781333549657
Quantité disponible : 15 disponible(s)