Static Analysis: Third International Workshop, WSA '93, Padova, Italy, September 22-24, 1993. ProceedingsPatrick Cousot Springer Science & Business Media, 08/09/1993 - 283 من الصفحات This volume constitutes the proceedings of the third International Workshop on Static Analysis (WSA`93), held in Padova, Italy, in September 1993. The objective of the international workshop series WSA is to serve as a forum for the discussion of the various aspects of static analysis in different programming paradigms. The clearly increasing mumbers of submitted papers and workshop participants point out the growing importance of static analysis techniques for logical, functional, concurrent and parallel languages as well as for parallel term rewriting systems. This proceedings contains, besides the abstracts or full papers of the invited talks given by Pascal Van Hentenryck, Peter van Roy, and Paul Hudak, full versions of the 20 contributed papers selected from a total of 68 submissions by an international program committee consisting of many renown researchers in the field. The volume is organized in sections on fixpoint computation, concurrency, parallelism, transformation, logic programs, term rewriting systems, strictness, reasoning about programs, and types. |
المحتوى
The Impact of Granularity in Abstract Interpretation of Prolog | 3 |
Optimization Techniques for General Purpose Fbcpoint Algorithms Practical Efficiency for the Abstract Interpretation of Prolog | 17 |
Chaotic fixpoint iteration guided by dynamic dependency | 29 |
Fast Abstract Interpretation Using Sequential Algorithms | 47 |
Abstract Interpretation and Verification of Reactive Systems | 62 |
Semantics and Analysis of Lindabased languages | 74 |
Compiling FX on the CM2 | 89 |
Combining Dependability with Architectural Adaptability by means of the SIGNAL Language | 101 |
Freeness Sharing Linearity and Correctness All at Once | 155 |
Synthesis of directionality information for functional logic programs | 167 |
Abstract Rewriting | 180 |
Reflections on Program Optimization | 195 |
Finiteness Conditions for Strictness Analysis | 196 |
Strictness Properties of Lazy Algebraic Datatypes | 208 |
Minimal Thunkification | 220 |
An Efficient Abductive Reasoning System Based on Program Analysis | 232 |
Challenges in developing Useful and Practical Static Analysis for Logic Programs | 113 |
the Notion of a Perfect Process Tree | 114 |
Tupling Functions with Multiple Recursion Parameters | 126 |
Avoiding Repeated Tests in Pattern Matching | 143 |
A Congruence for Gamma Programs | 244 |
Usage Analysis with Natural Reduction Types | 256 |
Polymorphic Types and Widening Operators | 269 |
طبعات أخرى - عرض جميع المقتطفات
عبارات ومصطلحات مألوفة
A₁ abductive reasoning abstract domain abstract equation abstract interpretation abstract semantics abstract substitution AEqs AIDYSO AISISO algebra algorithm annotation apply approximation argument atom bisimulation boolean bottom-up C₁ C₂ call patterns Cenv clause compiler complete lattice Computer Science constraint construct constructor Cousot data structures defined definition denote dependency graph e₁ efficiency elements encoding example expression finite fixpoint function calls Functional Programming functor given granularity implementation input iteration lambda lattice least fixpoint Lisp Logic Programming maps multiset operational semantics output pair Partial Evaluation predicate procedure process graph Programming Languages Prolog proof properties Proposition pvar recursion parameters reduction types relation relevant logic rewrite rules sequence sequential algorithms SFD graphs static analysis strictness analysis subterms term term rewriting system transformation transition tuples type system vector widening operator workset X₁