FG Programmiersprachen und Compilerbau
Refine
Year of publication
Document Type
- Conference Proceeding (60)
- Conference publication peer-reviewed (32)
- Doctoral thesis (7)
- Scientific journal article peer-reviewed (6)
- Scientific journal article not peer-reviewed (4)
- Part of a book (chapter) (4)
- Report (4)
- Book (3)
- Article (2)
- Book (publisher) (1)
- Conference publication not peer-reviewed (1)
- Periodical (1)
Language
- English (89)
- German (35)
- Multiple languages (1)
Keywords
Institute
Verification of software for Contiki-based low-power embedded systems using software model checking
(2018)
MOC 2017 – 9. Workshop zur Deklarativen Modellierung und effizienten Optimierung komplexer Probleme
(2017)
This paper describes a new approach to decompose constraint satisfaction problems (CSPs) using an auxiliary constraint satisfaction optimization problem (CSOP) that detects sub-CSPs which share only few common variables. The purpose of this approach is to find sub-CSPs which can be solved in parallel and combined to a complete solution of the original CSP. Therefore, our decomposition approach has two goals: 1. to evenly balance the workload distribution over all cores and solve the partial CSPs as fast as possible and 2. to minimize the number of shared variables to make the join process of the solutions as fast as possible.
This paper describes a new approach on optimization of regular constraint satisfaction problems (rCSPs) using an auxiliary constraint satisfaction optimization problem (CSOP) that detects areas with a potentially high number of conflicts. The purpose of this approach is to remove conflicts by the combination of regular constraints with intersection and concatenation of their underlying deterministic finite automatons (DFAs). This, eventually, often allows to significantly speed-up the solution process of the original rCSP.