000 03721nam a22005535i 4500
001 978-3-540-45386-4
003 DE-He213
005 20240423130128.0
007 cr nn 008mamaa
008 101221s2006 gw | s |||| 0|eng d
020 _a9783540453864
_9978-3-540-45386-4
024 7 _a10.1007/11871743
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
100 1 _aMüller-Olm, Markus.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
245 1 0 _aVariations on Constants
_h[electronic resource] :
_bFlow Analysis of Sequential and Parallel Programs /
_cby Markus Müller-Olm.
250 _a1st ed. 2006.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2006.
300 _aXIII, 177 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aProgramming and Software Engineering,
_x2945-9168 ;
_v3800
505 0 _a1. Introduction -- 2. A Hierarchy of Constants -- 3. Deciding Constants by Effective Weakest Preconditions -- 4. Limits of Parallel Flow Analysis -- 5. Parallel Flow Graphs -- 6. Non-atomic Execution -- 7. Dependence Traces -- 8. Detecting Copy Constants and Eliminating Faint Code -- 9. Complexity in the Non-atomic Scenario -- 10. Conclusion -- A. A Primer on Constraint-Based Program Analysis.
520 _aProgram analysis is concerned with techniques that automatically determine run-time properties of given programs prior to run-time. It is used for validation in order to ensure that programs serve their intended purpose and in further processing for efficient execution such as in optimizing compilers. Optimal program analysis provides a guarantee about the precision of the computed results. This monograph, a revised version of the author's habilitation thesis, focusses on optimal flow analysis of sequential and parallel programs. It studies algorithmic properties of various versions of the well-known constant-propagation problem. In order to come to grips with the variants considered, it combines techniques from different areas such as linear algebra, computable ring theory, abstract interpretation, program verification, complexity theory, etc. Combination of techniques is the key to further progress in automatic analysis and constant-propagation allows us to illustrate this point in a theoretical study. After a general overview, the monograph consists of three essentially self-contained parts that can be read independently of each other. These parts study: a hierarchy of constants in sequential programs, inherent limits of flow analysis of parallel programs, and how to overcome these limits by abandoning a classic atomic execution assumption.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aCompilers (Computer programs).
650 1 4 _aTheory of Computation.
650 2 4 _aSoftware Engineering.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aCompilers and Interpreters.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540453857
776 0 8 _iPrinted edition:
_z9783540830733
830 0 _aProgramming and Software Engineering,
_x2945-9168 ;
_v3800
856 4 0 _uhttps://doi.org/10.1007/11871743
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c185361
_d185361