The following pages link to (Q3922128):
Displayed 32 items.
- Inverse-limit and topological aspects of abstract interpretation (Q418811) (← links)
- Verification of multi-linked heaps (Q439948) (← links)
- Program verification using symbolic game semantics (Q477213) (← links)
- Grammar semantics, analysis and parsing by abstract interpretation (Q655410) (← links)
- Proving implications by algebraic approximation (Q671502) (← links)
- Precise interprocedural dataflow analysis with applications to constant propagation (Q671681) (← links)
- Using multiset discrimination to solve language processing problems without hashing (Q673099) (← links)
- Abstract interpretation: a kind of magic (Q673498) (← links)
- Acquiring search-control knowledge via static analysis (Q685544) (← links)
- Closures and fairness in the semantics of programming logic (Q799098) (← links)
- Flow analysis of lazy higher-order functional programs (Q879358) (← links)
- Two-level semantics and abstract interpretation (Q911319) (← links)
- Efficient symbolic analysis of programs (Q1082800) (← links)
- Strictness analysis and denotational abstract interpretation (Q1098274) (← links)
- Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study (Q1100879) (← links)
- Dynamic program slicing (Q1110308) (← links)
- Eliminating partially dead code in explicitly parallel programs (Q1128737) (← links)
- Finite constants: Characterizations of a new decidable set of constants (Q1176239) (← links)
- Static semantics, types, and binding time analysis (Q1179698) (← links)
- A lattice for abstract interpretation of dynamic (LISP-like) structures (Q1201726) (← links)
- The reduced relative power operation on abstract domains (Q1285656) (← links)
- Interconvertibility of a class of set constraints and context-free-language reachability (Q1583350) (← links)
- Constructive design of a hierarchy of semantics of a transition system by abstract interpretation (Q1605224) (← links)
- An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations. (Q1853617) (← links)
- Efficient and flexible matching of recursive types (Q1854490) (← links)
- On the verification of finite failure (Q2575838) (← links)
- Convergence of chaotic iterative least fixed point computations (Q3991126) (← links)
- Relational Analysis and Precision via Probabilistic Abstract Interpretation (Q5415662) (← links)
- Internal and External Logics of Abstract Interpretations (Q5452722) (← links)
- Upper Adjoints for Fast Inter-procedural Variable Equalities (Q5458395) (← links)
- Program Analysis Using Weighted Pushdown Systems (Q5458821) (← links)
- Control-flow analysis of function calls and returns by abstract interpretation (Q5891553) (← links)