The following pages link to (Q4068060):
Displaying 50 items.
- Application of static analyses for state-space reduction to the microcontroller binary code (Q617924) (← links)
- Precise interprocedural dataflow analysis with applications to constant propagation (Q671681) (← links)
- A region analysis algorithm for the live variables problem (Q799117) (← links)
- Transformational derivation of an improved alias analysis algorithm (Q815001) (← links)
- Non-local configuration of component interfaces by constraint satisfaction (Q823765) (← links)
- Algebraic program analysis (Q832153) (← links)
- Properties of data flow frameworks: A unified model (Q910237) (← links)
- Pentagons: a weakly relational abstract domain for the efficient validation of array accesses (Q988565) (← links)
- Efficient symbolic analysis of programs (Q1082800) (← links)
- The logic-termal equivalence is polynomial-time decidable (Q1144374) (← links)
- Tree equivalence of linear recursive schemata is polynomial-time decidable (Q1162152) (← links)
- Finite constants: Characterizations of a new decidable set of constants (Q1176239) (← links)
- Program equivalence and context-free grammars (Q1221492) (← links)
- Node listings for reducible flow graphs (Q1236887) (← links)
- Profitability computations on program flow graphs (Q1242449) (← links)
- Äquivalente Transformationen für Flußdiagramme (Q1249431) (← links)
- Bidirectional data flow analysis for type inferencing. (Q1399007) (← links)
- Automatic generation of interprocedural data-flow analyzers and optimizers (Q1433977) (← links)
- On sparse evaluation representations (Q1605227) (← links)
- Mechanising a type-safe model of multithreaded Java with a verified compiler (Q1663233) (← links)
- A unifying view on SMT-based software verification (Q1703012) (← links)
- Demand-driven interprocedural analysis for map-based abstract domains (Q1785851) (← links)
- Verified bytecode verifiers. (Q1874284) (← links)
- On the computational complexity of data flow analysis over finite bounded meet semilattices (Q1981765) (← links)
- A decision tree lifted domain for analyzing program families with numerical features (Q2044175) (← links)
- Optimizing reversible programs (Q2097435) (← links)
- Compositional verification of smart contracts through communication abstraction (Q2145351) (← links)
- A flow-insensitive-complete program representation (Q2152650) (← links)
- System-level non-interference of constant-time cryptography. II: Verified static analysis and stealth memory (Q2228439) (← links)
- Data flow analysis of asynchronous systems using infinite abstract domains (Q2233447) (← links)
- Instruction-level security analysis for information flow in stack-based assembly languages (Q2381502) (← links)
- A class of polynomially solvable range constraints for interval analysis without widenings (Q2575737) (← links)
- A formally verified compiler back-end (Q2655327) (← links)
- Automated formal analysis and verification: an overview (Q2871577) (← links)
- Complete Abstractions and Subclassical Modal Logics (Q2961561) (← links)
- Dataflow Analysis for Datarace-Free Programs (Q3000580) (← links)
- Typing Local Control and State Using Flow Analysis (Q3000584) (← links)
- The Cayley-Hamilton Theorem for Noncommutative Semirings (Q3073632) (← links)
- The Birth of Model Checking (Q3512430) (← links)
- Abstract Interpretation with Applications to Timing Validation (Q3512479) (← links)
- A Scalable Segmented Decision Tree Abstract Domain (Q3587252) (← links)
- An algorithm for tracing live variables based on a straightened program graph (Q4101429) (← links)
- Mechanized Verification of Computing Dominators for Formalizing Compilers (Q4916051) (← links)
- A Case Study in Abstract Interpretation Based Program Transformation (Q4917048) (← links)
- Property-oriented expansion (Q5030184) (← links)
- An even faster solver for general systems of equations (Q5030194) (← links)
- Tractable constraints in finite semilattices (Q5030199) (← links)
- Continualization of Probabilistic Programs With Correction (Q5041102) (← links)
- Data flow analysis as model checking (Q5096226) (← links)
- Precise interprocedural dataflow analysis with applications to constant propagation (Q5096757) (← links)
