Вы здесь

Главная

Static Analysis

Связанные издания:

Analysis of the Equality Relations for the Program Terms
An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract)
A Type-based Analysis for Stack Allocation in Functional Languages
Beyond Prototype Implementations: Polymorphic Projection Analysis for Glasgow Haskell
Bigloo: a portable and optimizing compiler for strict functional languages
Binding-Time Analysis and Strictness Analysis by Abstract Interpretation
Call-By-Name CPS-Transition as a Binding-Time Improvement
Combining Slicing and Constraint Solving for Validation of Measurement Software
Complementation in Abstract Interpretation
Control-Flow Analysis and Type Systems
Determining Storage Properties of Sequentional and Concurrent Programs with Assignment and Structured Data
Effective Flow Analysis for Avoiding Run-Time Checks
Efficient Closure Utilization by Higher-Order Inheritance Analysis
GENA - A Tool for Generating Prolog Analyzers from Specifications
Generation of efficient interprocedural analyzers with PAG
Igor: A tool for developing Prolog dataflow analyzers
LSign Reordered
Natural-Semantics-Based Abstract Interpretation (Preliminary Version)
Optimality in Abstractions of Model Checking
Optimizing Lazy Functional Programs Using Flow Inference
Partitioning Non-strict Functional Languages for Multi-threaded Code Generation
Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time
Proving Correctness of Constraint Logic Programs with Dynamic Scheduling
Region Inference for Higher-Order Functional Languages
Semantics-Directed Program Analysis: A Tool-Maker s Perspective
Static Analysis of Communication for Asynchronous Concurrent Programming Languages
Strictness Analysis by Abstract Reduction Using a Tableau Calculus
System F and Abstract Interpretation
Termination Analysis for Functional Programs Using Term Orderings
Termination Analysis for Offline Partial Evaluation of a Higher Order Functional Language
Trust in the lambda-Calculus
Unification-free Execution of Well-moded and Well-typed Prolog Programs