Вы здесь

Главная

интерпретация

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

Decompilation is the Efficient Enumeration of Types
Denotational Abstract Interpretation of Functional Logic Programs
Denotational Abstract Interpretation of Logic Programs
Dependency Analysis of Mobile Systems
Derivation of Linear Size Relations by Abstract Interpretation
Derivation of Proof Methods by Abstract Interpretation
Distinctness and Sharing Domains for Static Analysis of Java Programs
Distributed Control Flow with Classical Modal Logic
Domain Compression for Complete Abstractions
Domain Independence and the Relational Calculus
Effect Analysis in Higher-Order Languages
Effective Inline-Threaded Interpretation of Java Bytecode Using Preparation Sequences
Efficient Bottom-up Abstract Interpretation of Prolog by Means of Constraint Solving over Symbolic Finite Domains
Efficient Chaotic Iteration Strategies with Widenings
Efficient Closure Utilization by Higher-Order Inheritance Analysis
Experimental Evaluation of a Generic Abstract Interpretation Algorithm for PROLOG
Extent Analysis of Data Fields
Fast Abstract Interpretation Using Sequential Algorithms
Fast and Efficient Cache Behaviour Prediction
Finiteness Conditions for Strictness Analysis
Fortran 90. Errata, Amendments, and Interpretations
Fractional Types
Framework for Abstract Interpretation
Freeness Analysis Througn Linear Refinement
Functional Dependencies and Moore-Set Completions of Abstract Interpretations and Semantics
Galois Connection Based Abstract Interpretations for Strictness Analysis
Gate Splitting in LOTOS Specifications Using Abstract Interpretation
GENA - A Tool for Generating Prolog Analyzers from Specifications
Generalized Constraint Propagation: A Stady in C
Genetic Abstract Interpretation Algorithms for Prolog: Two Optimization Techniques and Their Experimental Evaluation
Global Analysis of Standard Prolog Programs
Implementation of Functional Languages: Proc./12th Intern. Workshop, IFL 2000, Aachen, Germany, September 2000
Implementation of Functional Languages: Proc./14th Intern. Workshop, IFL 2002, Madrid, Spain, September 2002
Implementation of Multiple Specialization in Logic Programs
Implementing Groudness Analysis with Definite Boolean Functions
Improving Abstract Interpretations by Systematic Lifting to the Powerset
Improving the Result of Static Analyses of Programs by Logical Decreasing Iterations
Incompleteness, Counterexamples, and Refinements in Abstract Model-Checking
Incremental Analysis of Logic Programs
Infinite State Model Checking by Abstract Interpretation and Program Specialisation
Integrating the Symbolic and the Sub-Symbolic Level in Sonar-Based Navigation
Interpretation abstraite au moyen des grammaires attribuees
Interpretation abstraite pour ameliorer la representation des environnements dans les langages fonctionnels
Intuitionistic Implication in Abstract Interpretation
Kolmogorov and Godel s approach to intuitionistic logic: current developments
Linear Time Self-Interpretation of the Pure Lambda Calculus
Live Data Structures in Logic Programs
Live-Structure Dataflow Analysis for Prolog
Logic-Based Program Synthesis and Transformation: Revised Selected Papers/23rd International Symposium, LOPSTR 2013, Madrid, Spain, September 2013
Logic Program Specialisation: How to Be More Specific