The following pages link to Programming Languages and Systems (Q5316570):
Displaying 23 items.
- Why does Astrée scale up? (Q845249) (← links)
- The octagon abstract domain (Q853733) (← links)
- Static analysis of embedded real-time concurrent software with dynamic priorities (Q1650954) (← links)
- Refinement to certify abstract interpretations: illustrated on linearization for polyhedra (Q1739912) (← links)
- A framework for memory efficient context-sensitive program analysis (Q2082559) (← links)
- Static analysis of ReLU neural networks with tropical polyhedra (Q2145325) (← links)
- Certified compilation for cryptography: extended x86 instructions and constant-time verification (Q2152025) (← links)
- Twinning automata and regular expressions for string static analysis (Q2234078) (← links)
- A sparse evaluation technique for detailed semantic analyses (Q2339156) (← links)
- Refinement of worst-case execution time bounds by graph pruning (Q2339158) (← links)
- A Note on the Inversion Join for Polyhedral Analysis (Q2814111) (← links)
- Automatic Inference of Access Permissions (Q2891412) (← links)
- Sound Non-statistical Clustering of Static Analysis Alarms (Q2891424) (← links)
- Refinement-Based CFG Reconstruction from Unstructured Programs (Q3075470) (← links)
- String Analysis as an Abstract Interpretation (Q3075489) (← links)
- Inferring Min and Max Invariants Using Max-Plus Polyhedra (Q3522071) (← links)
- Splitting the Control Flow with Boolean Flags (Q3522080) (← links)
- Sweeping in Abstract Interpretation (Q5170178) (← links)
- Convex Invariant Refinement by Control Node Splitting: a Heuristic Approach (Q5170180) (← links)
- An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints (Q5452614) (← links)
- Non-disjunctive Numerical Domain for Array Predicate Abstraction (Q5458394) (← links)
- Clustered relational thread-modular abstract interpretation with local traces (Q6535225) (← links)
- Verifying numerical programs via iterative abstract testing (Q6536291) (← links)
