Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
S
slowbeast
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Requirements
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Locked files
Build
Pipelines
Jobs
Pipeline schedules
Test cases
Artifacts
Deploy
Releases
Package Registry
Container Registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Service Desk
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Code review analytics
Issue analytics
Insights
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
This is an archived project. Repository and other project resources are read-only.
Show more breadcrumbs
Marek Chalupa
slowbeast
Graph
init-sets
Select Git revision
No matching results
An error occurred while fetching branches. Retry the search.
An error occurred while fetching tags. Retry the search.
You can move around the graph by using the arrow keys.
Begin with the selected commit
Created with Raphaël 2.2.0
5
Apr
12
May
4
3
30
Apr
29
28
27
26
24
23
22
21
20
19
18
17
16
15
14
13
12
9
8
7
6
1
26
Mar
25
24
23
22
19
18
17
16
15
8
5
4
3
2
1
26
Feb
25
24
23
22
21
20
19
18
17
16
15
11
9
3
18
Jan
15
12
Merge branch 'xchalup4-master-patch-64576' into 'master'
master
master
Update README.md
move programstructure.py to analysis/
bself: check for loop-hit limit after handling loop
bself: allow empty inductive sets
overapprox: fix return values
inductiveset: fix includes_any
blackify
Fix creating 1st-hit sis
bself: always use whole seq when removing inducive sets
remove some assertions
kindse: fix after API change
bself: do not convert sets to sequences where not needed
refactor inductive sequences
bself: on the first hit, unwind only twice
relations: use incremental solving
Revert "union sets from exits"
bself: store inductive sets once we have them
union sets from exits
unwind loop only when hit for the first time
add scc condensation
bself: do not do lookahead in overapprox
Revert "bse: remember the order of writes to memory"
tests: add a new test
bself: fix creating initial sets
BSELF: prune inductive sets
overapprox: fix a crash
symexe mem: fix a check for uninit bytes
bse: remember the order of writes to memory
solver: fix obtaining clauses
solver: fix accessing non-symbolic value as symbolic
solver: remove implied clauses multiple times
add a note
solver: do not solve reduced formulas
solver: fix using inferred equalities
solver: fix solving with reduced bitwith
enable solving with reduced bitwidth
fix rewriting polynomials
Revert "symbolic: fix simplifying arith formula"
solver: remove is_sat function
Loading