Sökning: WFRF:(Rümmer Philipp 1978) >
Flatten and Conquer :
Flatten and Conquer : A Framework for Efficient Analysis of String Constraints
-
- Abdulla, Parosh Aziz, 1961- (författare)
- Uppsala universitet,Datorteknik,Uppsala University, Sweden
-
- Atig, Mohamed Faouzi (författare)
- Uppsala universitet,Datorteknik,Uppsala University, Sweden
-
- Chen, Yu-Fang (författare)
- Academic Sinica, Taiwan
-
visa fler...
-
- Bui, Phi Diep (författare)
- Uppsala universitet,Datorteknik,Uppsala University, Sweden
-
- Holık, Lukas (författare)
- Brno University of Technology, Czech Republic
-
- Rezine, Ahmed (författare)
- Linköpings universitet,Programvara och system,Tekniska fakulteten
-
- Rümmer, Philipp, 1978- (författare)
- Uppsala universitet,Datorteknik,Uppsala University, Sweden
-
visa färre...
-
(creator_code:org_t)
- 2017-06-14
- 2017
- Engelska.
-
Ingår i: SIGPLAN notices. - New York, NY, USA : ACM. - 0362-1340 .- 1558-1160. - 9781450349888 ; 52:6, s. 602-617, s. 602-617
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
https://urn.kb.se/re...
-
visa färre...
Abstract
Ämnesord
Stäng
- We describe a uniform and efficient framework for checking the satisfiability of a large class of string constraints. The framework is based on the observation that both satisfiability and unsatisfiability of common constraints can be demonstrated through witnesses with simple patterns. These patterns are captured using flat automata each of which consists of a sequence of simple loops. We build a Counter-Example Guided Abstraction Refinement (CEGAR) framework which contains both an under-and an over-approximation module. The flow of information between the modules allows to increase the precision in an automatic manner. We have implemented the framework as a tool and performed extensive experimentation that demonstrates both the generality and efficiency of our method.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Nyckelord
- String Equation; Formal Verification; Automata Theory
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas