A Benders Decomposition Approach to Deciding Modular Linear Integer Arithmetic

A Fresh Look at Zones and Octagons

scientific article published on 04 September 2021

A Tool for Intersecting Context-Free Grammars and Its Applications

A complete refinement procedure for regular separability of context-free languages

A low overhead method for recovering unused memory inside regions

Abstract Interpretation over Non-lattice Abstract Domains

article

An Abstract Domain of Uninterpreted Functions

An iterative approach to precondition inference using constrained Horn clauses

article by Bishoksan Kafle et al published July 2018 in Theory and Practice of Logic Programming

Analyzing Array Manipulating Programs by Program Transformation

Boolean functions for dependency analysis: Algebraic properties and efficient representation

scholarly article by Tania Armstrong et al published 1994 in Lecture Notes in Computer Science

Closure Operators for ROBDDs

Failure tabled constraint logic programming by interpolation

article by Graeme Gange et al published July 2013 in Theory and Practice of Logic Programming

Horn clauses as an intermediate representation for program analysis and transformation ⬇️

Information loss in knowledge compilation: A comparison of Boolean envelopes

Interval Analysis and Machine Arithmetic

Reference Abstract Domains and Applications to String Analysis

Signedness-Agnostic Program Analysis: Precise Integer Bounds for Low-Level Code

Solving Difference Constraints over Modular Arithmetic

State Joining and Splitting for the Symbolic Execution of Binaries

Towards region-based memory management for Go

article

Two classes of Boolean functions for dependency analysis

UN-KLEENE BOOLEAN EQUATION SOLVING

Unbounded Model-Checking with Interpolation for Regular Language Constraints