SwePub
Sök i LIBRIS databas

  Extended search

WFRF:(Abdulla Parosh)
 

Search: WFRF:(Abdulla Parosh) > (2015-2019) > Flatten and Conquer :

Flatten and Conquer : A Framework for Efficient Analysis of String Constraints

Abdulla, Parosh Aziz, 1961- (author)
Uppsala universitet,Datorteknik,Uppsala University, Sweden
Atig, Mohamed Faouzi (author)
Uppsala universitet,Datorteknik,Uppsala University, Sweden
Chen, Yu-Fang (author)
Academic Sinica, Taiwan
show more...
Bui, Phi Diep (author)
Uppsala universitet,Datorteknik,Uppsala University, Sweden
Holık, Lukas (author)
Brno University of Technology, Czech Republic
Rezine, Ahmed (author)
Linköpings universitet,Programvara och system,Tekniska fakulteten
Rümmer, Philipp, 1978- (author)
Uppsala universitet,Datorteknik,Uppsala University, Sweden
show less...
 (creator_code:org_t)
2017-06-14
2017
English.
In: SIGPLAN notices. - New York, NY, USA : ACM. - 0362-1340 .- 1558-1160. - 9781450349888 ; 52:6, s. 602-617, s. 602-617
  • Journal article (peer-reviewed)
Abstract Subject headings
Close  
  • 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.

Subject headings

NATURVETENSKAP  -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
NATURAL SCIENCES  -- Computer and Information Sciences -- Computer Sciences (hsv//eng)

Keyword

String Equation; Formal Verification; Automata Theory

Publication and Content Type

ref (subject category)
art (subject category)

Find in a library

To the university's database

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view