Incremental static analysis involves analyzing changes to a version of a source code along
with analyzing code regions that are semantically affected by the changes. Existing analysis …

Equality of expressions in lambda-calculi, higher-order programming languages, higher-
order programming calculi and process calculi is defined as alpha-equivalence …

We define a distance function on propositional formulas in CNF as a measure of non-
isomorphism of formulas: the larger the distance between two formulas is, the further they …

Given two n-variable Boolean functions f and g, we study the problem of computing an ε-
approximate isomorphism between them. An ε-approximate isomorphism is a permutation π …

Abstract The Graph Isomorphism (GI) Class is the class of all the problems equivalent to the
Graph Isomorphism problem, that is not known to be solvable in polynomial time nor to be …

In this paper, we propose a two-steps approach to partition instances of the Conjunctive
Normal Form (CNF) Syntactic Formula Isomorphism problem (CSFI) into groups of different …

A class of reachability reduction problem is raised in the area of computer network security
and software engineering. We revisit the reachability reduction problem on vertex labeled …