Pages that link to "Item:Q3593074"
From MaRDI portal
The following pages link to Grammar Analysis and Parsing by Abstract Interpretation (Q3593074):
Displaying 50 items.
- Verified abstract interpretation techniques for disassembling low-level self-modifying code (Q287369) (← links)
- An abstract interpretation framework for genotype elimination algorithms (Q428908) (← links)
- Modeling of complex systems. II: A minimalist and unified semantics for heterogeneous integrated systems (Q440664) (← links)
- Verification conditions for source-level imperative programs (Q465685) (← links)
- A sharing-based approach to supporting adaptation in service compositions (Q488324) (← links)
- From invariant checking to invariant inference using randomized search (Q518404) (← links)
- Assume-admissible synthesis (Q520340) (← links)
- A compiler framework for the reduction of worst-case execution times (Q601045) (← links)
- An array content static analysis based on non-contiguous partitions (Q681352) (← links)
- A demonstrably correct compiler (Q749202) (← links)
- On the refinement of liveness properties of distributed systems (Q763239) (← links)
- Scalable polyhedral verification of recurrent neural networks (Q832168) (← links)
- An integrated approach to high integrity software verification (Q861714) (← links)
- On using data abstractions for model checking refinements (Q878378) (← links)
- Loop detection in term rewriting using the eliminating unfoldings (Q944383) (← links)
- Using abstract interpretation to add type checking for interfaces in Java bytecode verification (Q974112) (← links)
- Pentagons: a weakly relational abstract domain for the efficient validation of array accesses (Q988565) (← links)
- Abstract interpretation of resolution-based semantics (Q1035705) (← links)
- Automating the addition of fault tolerance with discrete controller synthesis (Q1041296) (← links)
- Mathematics for reasoning about loop functions (Q1044182) (← links)
- Specialisation of Prolog and FCP programs using abstract interpretation (Q1108783) (← links)
- Program invariants as fixedpoints (Q1254848) (← links)
- Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements (Q1275821) (← links)
- Refinement to certify abstract interpretations: illustrated on linearization for polyhedra (Q1739912) (← links)
- Abstract interpretation of mobile systems (Q1772313) (← links)
- Demand-driven interprocedural analysis for map-based abstract domains (Q1785851) (← links)
- A decision tree lifted domain for analyzing program families with numerical features (Q2044175) (← links)
- A relational shape abstract domain (Q2058389) (← links)
- Gradual typing using union typing with records (Q2133461) (← links)
- Static analysis of ReLU neural networks with tropical polyhedra (Q2145325) (← links)
- Data abstraction: a general framework to handle program verification of data structures (Q2145329) (← links)
- Lightweight shape analysis based on physical types (Q2152652) (← links)
- Verifying constant-time implementations by abstract interpretation (Q2167720) (← links)
- A two-phase approach for conditional floating-point verification (Q2233493) (← links)
- Analyzing infrastructure as code to prevent intra-update sniping vulnerabilities (Q2233499) (← links)
- Counterexample- and simulation-guided floating-point loop invariant synthesis (Q2233532) (← links)
- Runtime abstract interpretation for numerical accuracy and robustness (Q2234076) (← links)
- Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints (Q2235285) (← links)
- A sparse evaluation technique for detailed semantic analyses (Q2339156) (← links)
- Compositional analysis for verification of parameterized systems (Q2368952) (← links)
- Abstract interpretation and types for systems biology (Q2518376) (← links)
- Interpreting Abstract Interpretations in Membership Equational Logic (Q2841246) (← links)
- Invariants Synthesis over a Combined Domain for Automated Program Verification (Q2842643) (← links)
- Automatic Inference of Access Permissions (Q2891412) (← links)
- Template-Based Unbounded Time Verification of Affine Hybrid Automata (Q2901366) (← links)
- Refinement to Certify Abstract Interpretations, Illustrated on Linearization for Polyhedra (Q2945626) (← links)
- Using Abstract Interpretation to Correct Synchronization Faults (Q2961562) (← links)
- An abstract interpretation-based model for safety semantics (Q2995468) (← links)
- Improving Strategies via SMT Solving (Q3000582) (← links)
- Precise Interprocedural Analysis in the Presence of Pointers to the Stack (Q3000594) (← links)
