Abstract interpretation and application to logic programs
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Bi-inductive structural semantics
- Abstract interpretation of resolution-based semantics
- Specialisation of Prolog and FCP programs using abstract interpretation
- Speeding up inferences using relevance reasoning: a formalism and algorithms
- The quotient of an abstract interpretation
- Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements
- The reduced relative power operation on abstract domains
- Live data structures in logic programs. Derivation by means of abstract interpretation
- Bottom-up abstract interpretation of logic programs
- An abstract interpretation framework for optimizing dynamic modular logic languages
- Precise goal-independent abstract interpretation of constraint logic programs.
- A new framework for declarative programming
- Path dependent analysis of logic programs
- Combinations of abstract domains for logic programming: Open product and generic pattern construction
- Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
- Logical optimality of groundness analysis
- Approximate reasoning by similarity-based SLD resolution.
- Descending chains and narrowing on template abstract domains
- A polymorphic type dependency analysis for logic programs
- Abstract interpretation of mobile systems
- Similarity-based SLD resolution and its role for web knowledge discovery
- Managing the granularity of constraint-based analyses by rule transformation.
- An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations.
- Pair-independence and freeness analysis through linear refinement.
- Logical approximation for program analysis
- The powerset operator on abstract interpretations
- Design of abstract domains using first-order logic
- Accelerating program analyses in Datalog by merging library facts
- Thread-modular analysis of release-acquire concurrency
- Relational string abstract domains
- Non-terminating processes in the situation calculus
- Template polyhedra and bilinear optimization
- Models and emerging trends of concurrent constraint programming
- Generating invariants for non-linear hybrid systems
- Finding suitable variability abstractions for lifted analysis
- Abstraction and resolution modulo AC: How to verify Diffie--Hellman-like protocols automatically
- Static extensivity analysis for \(\lambda\)-definable functions over lattices
- Abstract interpretation and types for systems biology
- On the verification of finite failure
- Program verification with interacting analysis plugins
- Precise goal-independent abstract interpretation of constraint logic programs
- scientific article; zbMATH DE number 1617316 (Why is no real title available?)
- scientific article; zbMATH DE number 1696888 (Why is no real title available?)
- A generic framework for heap and value analyses of object-oriented programming languages
- Relational abstract domain of weighted hexagons
- Extending abstract acceleration methods to data-flow programs with numerical inputs
- A note on the inversion join for polyhedral analysis
- Interpreting abstract interpretations in membership equational logic
- Sound non-statistical clustering of static analysis alarms
- Resource usage analysis of logic programs via abstract interpretation using sized types
- Complete abstractions and subclassical modal logics
- Using abstract interpretation to correct synchronization faults
- Finding relevant templates via the principal component analysis
- Generalizing inference systems by coaxioms
- Static contract checking with abstract interpretation
- Precondition inference from intermittent assertions and application to contracts on collections
- Access analysis-based tight localization of abstract memories
- scientific article; zbMATH DE number 7037626 (Why is no real title available?)
- Analysis of residuating logic programs
- Analyzing logic programs using “prop”-ositional logic programs and a magic wand
- Symbolic model checking in non-Boolean domains
- Optimality in goal-dependent analysis of Sharing
- Trace-Based Coinductive Operational Semantics for While
- Certified Static Analysis by Abstract Interpretation
- Lifting abstract interpreters to quantified logical domains
- scientific article; zbMATH DE number 4178750 (Why is no real title available?)
- Incremental Abstract Interpretation
- On the interaction between sharing and linearity
- Abstract Interpretation as Automated Deduction
- Expression-Based Aliasing for OO–languages
- A Novel Test Case Generation Method for Prolog Programs Based on Call Patterns Semantics
- Loop Summarization Using Abstract Transformers
- Propositional Interpolation and Abstract Interpretation
- Probabilistic semantics and program analysis
- A scalable segmented decision tree abstract domain
- Predicate Abstraction in a Program Logic Calculus
- scientific article; zbMATH DE number 3978439 (Why is no real title available?)
- Bottom-up dataflow analysis of normal logic programs
- Abstract interpretation based on oldt resolution
- Abstract interpretation based on Alexander Templates
- scientific article; zbMATH DE number 512885 (Why is no real title available?)
- Abstract interpretation of logic programs using magic transformations
- scientific article; zbMATH DE number 549957 (Why is no real title available?)
- Applying abstract acceleration to (co-)reachability analysis of reactive programs
- Discovering invariants via simple component analysis
- scientific article; zbMATH DE number 1942465 (Why is no real title available?)
- scientific article; zbMATH DE number 1953275 (Why is no real title available?)
- scientific article; zbMATH DE number 1954120 (Why is no real title available?)
- Learning solution preferences in constraint problems
- Sequence-based abstract interpretation of Prolog
- scientific article; zbMATH DE number 1497841 (Why is no real title available?)
- An iterative approach to precondition inference using constrained Horn clauses
- Refining and compressing abstract domains
- Abstract interpretation of temporal concurrent constraint programs
- Tabling with sound answer subsumption
- Least solutions of equations over \(\mathcal{N}\)
- scientific article; zbMATH DE number 879006 (Why is no real title available?)
- Proving the correctness of compiler optimisations based on a global analysis: a study of strictness analysis†
- Correct answers for first order logic
- Abstract interpreters for free
This page was built for publication: Abstract interpretation and application to logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4012706)
