Commit 442ffbfc authored by Mihaela SIGHIREANU's avatar Mihaela SIGHIREANU
Browse files

aplas: typos intro and exps

parent d1e9d138
......@@ -19,7 +19,7 @@ It uses SMT solvers (e.g., \textsc{Z3})
for solving linear integer arithmetic constraints.
%\cspen\ ranked third among the eleven solvers in the general podium of
\cspen\ was ranked among the best solvers at
the last edition of SL-COMP, the competition of separation-logic solvers~\cite{SLCOMPsite}.
the last edition of SL-COMP, the competition of separation logic solvers~\cite{SLCOMPsite}.
\cspenp\ supports the new theory \slah.
Internally, \cspenp\ parses the input file
......
......@@ -60,11 +60,11 @@ The ordered entailment problem is then decided by matching each spatial atom in
Splitting a spatial atom into multiple ones in the antecedent is attributed to pointer arithmetic and unnecessary for SH fragments with nominal addresses.
%Moreover, the availability of $\hls{}$ makes the splitting more involved.
We implemented the decision procedures on top of \cspen\footnote{We anonymize the name of the tool to comply with the double blind procedure.} solver~\cite{GuCW16}.
We implemented the decision procedures on top of the \cspen\footnote{We anonymize the name of the tool to comply with the double blind procedure.} solver. %~\cite{GuCW16}.
We evaluate the performance of the new solver, called {\cspenp}~\cite{CompSpenSite},
on a set of formulas originating from path conditions and verification conditions of programs working on heap lists in memory allocators.
We also randomly generate some formulas, in order to test the scalability of {\cspenp} further.
The experimental results show that {\cspenp} is able to solve the satisfiability and entailment problems for {\slah} efficiently (in average, less than 1 second for satisfiability and less than 15 seconds for entailment).\zhilin{The anonymization is properly done.}
The experimental results show that {\cspenp} is able to solve the satisfiability and entailment problems for {\slah} efficiently (in average, less than 1 second for satisfiability and less than 15 seconds for entailment). %\zhilin{The anonymization is properly done.}
To the best of our knowledge, this work presents the first decision procedure and automated solver for decision problems in a separation logic fragment allowing both pointer arithmetic and memory blocks inside inductive definitions.
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment