Перейти к основному содержанию
Мемориальная библиотека А.П. Ершова
Toggle navigation
Издания
Журналы
Новые поступления
Вы здесь
Главная
абстрактный
Связанные издания:
An Experiment in Domain Refinement: Type Domains and Type Representations for Logic Programs
An Imperative Extension of the Object Constraint Language OCL
An Informal Formal Method for Systematic JUnit Test Case Generation
Annotated Structure Shape Graphs for Abstract Analysis of Prolog
An Object-Based Programming Model for Shared Data
AOP: Does It Make Sense? The Case Concurrency and Failures
Applications of Computability Theory over Abstract Data Types
Approximating the Algebraic Relational Semantics of Imperative Programs
A Practical and Flexible Flow Analysis for Higher-Order Languages
A Practical Application of Sharing and Freeness Inference
A Scalable Abstract Machine Model to Support Limited-OR (LOR/Restricted-AND Parallelism(RAP) in Logic Programs
A Simple and General Method for Integrating Abstract Interpretation in SICStus
A Simple Take on Typed Abstract Syntax in Haskell-like Languages
A Suite of Analysis Tools Based on a General Purpose Abstract Interpreter
A Symbolic Semantics for Abstract Model Checking
ATLAS: A Typed Language for Algebraic Specification
A Tool for Abstract Interpretation: Dynamic Programming
A Tool Interface Language for PSF
Automated Deduction - CADE 26: Proc./26th International Conference on AD, Gothenburg, Sweden, August 2017
Automatic Construction of Hoare Proofs from Abstract Interpretation Results
Automatic Determination of Communication Topologies in Mobile Systems
Automatic Discovery of Linear Restraints Among Variables of a Program
Automatic Inference of Models for Statistical Code Compression
Automatic Parallelization of Irregular and Pointer-Based Computations: Perspectives from Logic and Constraint Programming
Automatic Verification Based on Abstract Interpretation
Automatic Verification by Abstract Interpretation
A Virtual Machine for a Process Calculus
Backwards Abstract Interpretation of Probabilistic Programs
Behaviour-Based Model Construction
Beyond Abstract Data Types: Giving Life to Objects
Beyond Prototype Implementations: Polymorphic Projection Analysis for Glasgow Haskell
Binding-Time Analysis and Strictness Analysis by Abstract Interpretation
Boolean Algebra of Shape Analysis Constraints
Building User-Environment Factories
Canonical Abstract Prototypes for Abstract Visual and Interaction Design
Canonical term functors and parameterization-by-use for the specification of abstract data types
Categorical Abstract Data Type (CADT)
Categorical Programming with Abstract Data Types
Chaotic Fixpoint Iteration Guided by Dynamic Dependency
Class Analysis of Object-Oriented Programs through Abstract Interpretation
Cliche-Based Program Editors
Combinations of Abstract Domains for Logic Programming
Combined Determination of Sharing and Freeness of Program Variables through Abstract Interpretation
Combining Abstract Interpretation and Partial Evaluation (brief overview)
Combining Forward and Backward Analyses of Temporal Properties
Communication as Unification in the Petri Box Calculus
Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation
Compiling Control Revisited: A New Approach based upon Abstract Interpretation
Complementation in Abstract Interpretation
Completeness in Abstract Interpretation: A Domain Perspective
« первая
‹ предыдущая
1
2
3
4
5
6
7
8
9
следующая ›
последняя »