Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
P
Polymalys
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Model registry
Operate
Environments
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
GitLab community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
OTAWA-plugins
Polymalys
Commits
395e1ef4
Commit
395e1ef4
authored
1 year ago
by
Forget Julien
Browse files
Options
Downloads
Patches
Plain Diff
Update authors.
parent
61610386
No related branches found
No related tags found
No related merge requests found
Changes
1
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
README.md
+9
-6
9 additions, 6 deletions
README.md
with
9 additions
and
6 deletions
README.md
+
9
−
6
View file @
395e1ef4
...
...
@@ -2,12 +2,15 @@
Polymalys: Polyhedra-based Memory Analysis.
*
Version
XX for Otawa XX
*
Version
1.1, December 2023
----
## Author
## Author
s
Clement Ballabriga
<Clement.Ballabriga@nospamuniv-lille.fr>
*
Clement Ballabriga
<Clement.Ballabriga@nospamuniv-lille.fr>
*
Julien Forget
<Julien.Forget@nospamuniv-lille.fr>
*
Sandro Grebant
<sandro.grebant@nospamuniv-lille.fr>
*
Giuseppe Lipari
<giuseppe.lipari@nospamuniv-lille.fr>
License: GPL 2.1 or higher.
...
...
@@ -21,9 +24,9 @@ Polymalys is a tool for static analysis of *binary* code. It discovers
linear relations between data locations (i.e. memory locations as well
as registers) of the code. The analysis relies on abstract
interpretation using a polyhedra-based abstract domain. The current
implementation exploits the discovered linear relations to compute
upper
bounds to loop iterations. For more information on the
underlying
theory, refer to [1].
implementation exploits the discovered linear relations to compute
upper
bounds to loop iterations. For more information on the
underlying
theory, refer to [1].
## Requirements
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment