Grammar Analysis and Parsing by Abstract Interpretation
From MaRDI portal
Publication:3593074
DOI10.1007/978-3-540-71322-7_9zbMATH Open1149.68389OpenAlexW2320520550MaRDI QIDQ3593074FDOQ3593074
Authors: Patrick Cousot, Radhia Cousot 
Publication date: 24 September 2007
Published in: Program Analysis and Compilation, Theory and Practice (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-71322-7_9
Recommendations
Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Semantics in the theory of computing (68Q55)
Cited In (84)
- Verifying Reference Counting Implementations
- Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements
- Constructive Galois connections
- Scalable polyhedral verification of recurrent neural networks
- Program invariants as fixedpoints
- Runtime abstract interpretation for numerical accuracy and robustness
- Title not available (Why is that?)
- An abstract interpretation-based model for safety semantics
- Generic abstraction of dictionaries and arrays
- Survey on Directed Model Checking
- Syntactical analysis using cell automaton grammars
- Specialisation of Prolog and FCP programs using abstract interpretation
- Refinement to certify abstract interpretations: illustrated on linearization for polyhedra
- Automating the addition of fault tolerance with discrete controller synthesis
- Using abstract interpretation to add type checking for interfaces in Java bytecode verification
- Lifting numeric relational domains to algebraic data types
- A two-phase approach for conditional floating-point verification
- Analyzing infrastructure as code to prevent intra-update sniping vulnerabilities
- Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints
- Pentagons: a weakly relational abstract domain for the efficient validation of array accesses
- An abstract interpretation framework for genotype elimination algorithms
- From invariant checking to invariant inference using randomized search
- Verified abstract interpretation techniques for disassembling low-level self-modifying code
- Template-based unbounded time verification of affine hybrid automata
- Merge-and-Shrink Abstraction
- An integrated approach to high integrity software verification
- Gradual typing using union typing with records
- Distributed and predictable software model checking
- Modeling of complex systems. II: A minimalist and unified semantics for heterogeneous integrated systems
- A compiler framework for the reduction of worst-case execution times
- Counterexample- and simulation-guided floating-point loop invariant synthesis
- Loop invariants: analysis, classification, and examples
- On using data abstractions for model checking refinements
- Abstract interpretation of mobile systems
- Refinement to Certify Abstract Interpretations, Illustrated on Linearization for Polyhedra
- Data abstraction: a general framework to handle program verification of data structures
- Static analysis of ReLU neural networks with tropical polyhedra
- Lightweight shape analysis based on physical types
- A demonstrably correct compiler
- Mathematics for reasoning about loop functions
- Demand-driven interprocedural analysis for map-based abstract domains
- A decision tree lifted domain for analyzing program families with numerical features
- Compositional analysis for verification of parameterized systems
- Verification conditions for source-level imperative programs
- Abstract cofibered domains: application to the alias analysis of untyped programs
- Refinement-based CFG reconstruction from unstructured programs
- Verifying constant-time implementations by abstract interpretation
- On the refinement of liveness properties of distributed systems
- Cibai: An Abstract Interpretation-Based Static Analyzer for Modular Analysis and Verification of Java Classes
- Abstract interpretation and types for systems biology
- A sharing-based approach to supporting adaptation in service compositions
- Counterexample-Guided Refinement of Template Polyhedra
- A relational shape abstract domain
- Validating numerical semidefinite programming solvers for polynomial invariants
- Grammar semantics, analysis and parsing by abstract interpretation
- Automatic verification of parameterized networks of processes
- Interpreting abstract interpretations in membership equational logic
- Static Analysis Techniques for Parameterised Boolean Equation Systems
- Abstract interpretation of resolution-based semantics
- Symbolic model checking in non-Boolean domains
- Computing Program Reliability Using Forward-Backward Precondition Analysis and Model Counting
- Invariants synthesis over a combined domain for automated program verification
- Assume-admissible synthesis
- Loop detection in term rewriting using the eliminating unfoldings
- Differential game logic
- An array content static analysis based on non-contiguous partitions
- Shared Certificates for Neural Network Verification
- The Nuggetizer: Abstracting Away Higher-Orderness for Program Verification
- A sparse evaluation technique for detailed semantic analyses
- Verifying a network invariant for all configurations of the Futurebus+ cache coherence protocol
- Using abstract interpretation to correct synchronization faults
- A spectrum of behavioral relations over LTSs on probability distributions
- Title not available (Why is that?)
- On lexicographic proof rules for probabilistic termination
- Precise interprocedural analysis in the presence of pointers to the stack
- Title not available (Why is that?)
- Formal reduction for rule-based models
- Interpreters from functions and grammars
- Property-oriented expansion
- An Inference-Rule-Based Decision Procedure for Verification of Heap-Manipulating Programs with Mutable Data and Cyclic Data Structures
- A Computational Interpretation of Context-Free Expressions
- Title not available (Why is that?)
- Automatic inference of access permissions
- Improving strategies via SMT solving
This page was built for publication: Grammar Analysis and Parsing by Abstract Interpretation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3593074)
