Using Graph-Based CSP to Solve the Address Translation Problem

Aharoni, M.; Ben-Haim, Yael; Doron, Shai; Koyfman, Anatoly; Tsanko, Elena; Veksler, M. A.

doi:10.1007/978-3-319-44953-1_53

Cited by 3 publications

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In (Sun et al 2016) the authors renewed interest in Gröbner basis for formal verification pays off with a novel technique to find unsatisfiable cores in a set of polynomials. Another paper (Aharoni et al 2016) aimed at attacking the hardware address translation problem in microprocessor memory management by using conditional CSP solving. The generation of test cases for software or hardware systems remains one of the most prominent application area of the constraintbased testing and verification area.…”

Section: Track Highlightsmentioning

confidence: 99%

What's Hot in Constraint Programming

Michel

Rueher

2017

AAAI

View full text Add to dashboard Cite

The CP conference is the annual international conference on constraint programming. It is concerned with all aspects of computing with constraints, including theory, algorithms, environments, languages, models, systems, and applications such as decision-making, resource allocation, scheduling, configuration, and planning. The CP community is very keen to ensure it remains open to interdisciplinary research at the intersection between constraint programming and related fields. Hence, in addition to the usual technical and application tracks, the CP 2016 conference featured thematic tracks: Computational Sustainability, CP and Biology, Preferences, Social Choice and Optimization, and Testing and Verification. In this overview, we highlight several remarkable papers that have been selected by the senior program committee and papers with the most innovative methods and techniques, and a very high potential for applications (in our opinion).

show abstract

Section: Track Highlightsmentioning

confidence: 99%