000 04145nam a22005295i 4500
001 978-3-540-70674-8
003 DE-He213
005 20160624102103.0
007 cr nn 008mamaa
008 121227s1996 gw | s |||| 0|eng d
020 _a9783540706748
_9978-3-540-70674-8
024 7 _a10.1007/3-540-61739-6
_2doi
050 4 _aQA76.6-76.66
072 7 _aUM
_2bicssc
072 7 _aCOM051000
_2bisacsh
082 0 4 _a005.11
_223
245 1 0 _aStatic Analysis
_h[electronic resource] :
_bThird International Symposium, SAS '96 Aachen, Germany, September 24–26, 1996 Proceedings /
_cedited by Radhia Cousot, David A. Schmidt.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1996.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1996.
300 _aX, 398 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v1145
505 0 _aConstraint-based program analysis -- Semantics-directed program analysis: A tool-maker's perspective -- Property-oriented expansion -- Generalized dominators for structured programs -- Cache behavior prediction by abstract interpretation -- Termination analysis for offline partial evaluation of a higher order functional language -- Proving correctness of Constraint Logic Programs with dynamic scheduling -- Understanding mobile agents via a non-interleaving semantics for facile -- Termination analysis for partial functions -- A freeness and sharing analysis of logic programs based on a pre-interpretation -- Refinement types for program analysis -- A comparison of three occur-check analysers -- Analysis of the equality relations for the program terms -- An even faster solver for general systems of equations -- Inferring program specifications in polynomial-time -- Automated modular termination proofs for real Prolog programs -- Data-flow-based virtual function resolution -- Compiling laziness using projections -- Optimized algorithms for incremental analysis of logic programs -- Tractable constraints in finite semilattices -- Uniformity for the decidability of hybrid automata -- A backward slicing algorithm for Prolog -- Combining slicing and constraint solving for validation of measurement software -- Subtyping constrained types -- Abstract cofibered domains: Application to the alias analysis of untyped programs -- Stan: A static analyzer for CLP({ie383-01}) based on abstract interpretation -- Two applications of an incremental analysis engine for (constraint) logic programs -- PAN — The Prolog analyzer.
520 _aThis book constitutes the refereed proceedings of the Third International Static Analysis Symposium, SAS '96, held in Aachen, Germany, in September 1996 in conjunction with ALP and PLILP. The volume presents 22 highly-quality revised full papers selected from a total of 79 submissions; also included are three system descriptions and invited contributions by Alex Aiken (abstract only), Flemming Nielson, and Bernhard Steffen. Among the topics addressed are program analysis, incremental analysis, abstract interpretation, partial evaluation, logic programming, functional programming, and constraint programming.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aLogic design.
650 1 4 _aComputer Science.
650 2 4 _aProgramming Techniques.
650 2 4 _aSoftware Engineering.
650 2 4 _aProgramming Languages, Compilers, Interpreters.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aMathematical Logic and Formal Languages.
700 1 _aCousot, Radhia.
_eeditor.
700 1 _aSchmidt, David A.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540617396
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v1145
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-61739-6
942 _2EBK7450
_cEBK
999 _c36744
_d36744