Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Decision procedure for Requirement Traceability Semantics #105

Open
ferhaterata opened this issue Jun 15, 2017 · 0 comments
Open

Decision procedure for Requirement Traceability Semantics #105

ferhaterata opened this issue Jun 15, 2017 · 0 comments
Assignees
@ferhaterata
Labels
Alloy KodKod Research SAT SMT Traceability

Comments

@ferhaterata
Copy link
Member

Lower and Upper bound approximation that gives sound and complete results.
Slicing, Unrolling ....
KodKod (minimize the search space LB, UB)
SMT (UF, preprocessing)
SAT (Benchmark used in Opium, debian apt-get)
DL fragment
Implement using queries against Neo4j graph db

many-sorted
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@ferhaterata ferhaterata

Labels
Alloy KodKod Research SAT SMT Traceability
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@ferhaterata