FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2776845434> ?p ?o ?g. }

• W2776845434 endingPage "32" @default.
• W2776845434 startingPage "1" @default.
• W2776845434 abstract "String analysis is the problem of reasoning about how strings are manipulated by a program. It has numerous applications including automatic detection of cross-site scripting, and automatic test-case generation. A popular string analysis technique includes symbolic executions, which at their core use constraint solvers over the string domain, a.k.a. string solvers. Such solvers typically reason about constraints expressed in theories over strings with the concatenation operator as an atomic constraint. In recent years, researchers started to recognise the importance of incorporating the replace-all operator (i.e. replace all occurrences of a string by another string) and, more generally, finite-state transductions in the theories of strings with concatenation. Such string operations are typically crucial for reasoning about XSS vulnerabilities in web applications, especially for modelling sanitisation functions and implicit browser transductions (e.g. innerHTML). Although this results in an undecidable theory in general, it was recently shown that the straight-line fragment of the theory is decidable, and is sufficiently expressive in practice. In this paper, we provide the first string solver that can reason about constraints involving both concatenation and finite-state transductions. Moreover, it has a completeness and termination guarantee for several important fragments (e.g. straight-line fragment). The main challenge addressed in the paper is the prohibitive worst-case complexity of the theory (double-exponential time), which is exponentially harder than the case without finite-state transductions. To this end, we propose a method that exploits succinct alternating finite-state automata as concise symbolic representations of string constraints. In contrast to previous approaches using nondeterministic automata, alternation offers not only exponential savings in space when representing Boolean combinations of transducers, but also a possibility of succinct representation of otherwise costly combinations of transducers and concatenation. Reasoning about the emptiness of the AFA language requires a state-space exploration in an exponential-sized graph, for which we use model checking algorithms (e.g. IC3). We have implemented our algorithm and demonstrated its efficacy on benchmarks that are derived from cross-site scripting analysis and other examples in the literature." @default.
• W2776845434 created "2018-01-05" @default.
• W2776845434 creator A5005128087 @default.
• W2776845434 creator A5022025835 @default.
• W2776845434 creator A5034129725 @default.
• W2776845434 creator A5042659880 @default.
• W2776845434 creator A5059358773 @default.
• W2776845434 date "2017-12-27" @default.
• W2776845434 modified "2023-09-28" @default.
• W2776845434 title "String constraints with concatenation and transducers solved efficiently" @default.
• W2776845434 cites W1497805930 @default.
• W2776845434 cites W1505482284 @default.
• W2776845434 cites W1510368738 @default.
• W2776845434 cites W1512310098 @default.
• W2776845434 cites W1528837436 @default.
• W2776845434 cites W1543926679 @default.
• W2776845434 cites W1555798330 @default.
• W2776845434 cites W1572832005 @default.
• W2776845434 cites W1588454361 @default.
• W2776845434 cites W1599228120 @default.
• W2776845434 cites W1787380291 @default.
• W2776845434 cites W1810306334 @default.
• W2776845434 cites W1964874178 @default.
• W2776845434 cites W1965940079 @default.
• W2776845434 cites W1982132104 @default.
• W2776845434 cites W1987469449 @default.
• W2776845434 cites W1987647365 @default.
• W2776845434 cites W1993370765 @default.
• W2776845434 cites W2011367000 @default.
• W2776845434 cites W2011875300 @default.
• W2776845434 cites W2017035494 @default.
• W2776845434 cites W2023036777 @default.
• W2776845434 cites W2023887108 @default.
• W2776845434 cites W2028685566 @default.
• W2776845434 cites W2037286444 @default.
• W2776845434 cites W2044901139 @default.
• W2776845434 cites W2052958416 @default.
• W2776845434 cites W2075573771 @default.
• W2776845434 cites W2094568767 @default.
• W2776845434 cites W2097444001 @default.
• W2776845434 cites W2117402063 @default.
• W2776845434 cites W2117657788 @default.
• W2776845434 cites W2130370455 @default.
• W2776845434 cites W2137351629 @default.
• W2776845434 cites W2161510308 @default.
• W2776845434 cites W2164622707 @default.
• W2776845434 cites W2169092431 @default.
• W2776845434 cites W2169868363 @default.
• W2776845434 cites W2194959641 @default.
• W2776845434 cites W2295723447 @default.
• W2776845434 cites W2295791966 @default.
• W2776845434 cites W2330747214 @default.
• W2776845434 cites W233122475 @default.
• W2776845434 cites W2339322325 @default.
• W2776845434 cites W2482729551 @default.
• W2776845434 cites W2499720498 @default.
• W2776845434 cites W254881558 @default.
• W2776845434 cites W2735438339 @default.
• W2776845434 cites W2911375523 @default.
• W2776845434 cites W2945259913 @default.
• W2776845434 cites W4206635485 @default.
• W2776845434 cites W4237492309 @default.
• W2776845434 cites W4242157899 @default.
• W2776845434 cites W8218418 @default.
• W2776845434 doi "https://doi.org/10.1145/3158092" @default.
• W2776845434 hasPublicationYear "2017" @default.
• W2776845434 type Work @default.
• W2776845434 sameAs 2776845434 @default.
• W2776845434 citedByCount "38" @default.
• W2776845434 countsByYear W27768454342018 @default.
• W2776845434 countsByYear W27768454342019 @default.
• W2776845434 countsByYear W27768454342020 @default.
• W2776845434 countsByYear W27768454342021 @default.
• W2776845434 countsByYear W27768454342022 @default.
• W2776845434 countsByYear W27768454342023 @default.
• W2776845434 crossrefType "journal-article" @default.
• W2776845434 hasAuthorship W2776845434A5005128087 @default.
• W2776845434 hasAuthorship W2776845434A5022025835 @default.
• W2776845434 hasAuthorship W2776845434A5034129725 @default.
• W2776845434 hasAuthorship W2776845434A5042659880 @default.
• W2776845434 hasAuthorship W2776845434A5059358773 @default.
• W2776845434 hasBestOaLocation W27768454341 @default.
• W2776845434 hasConcept C11413529 @default.
• W2776845434 hasConcept C114614502 @default.
• W2776845434 hasConcept C153269930 @default.
• W2776845434 hasConcept C157486923 @default.
• W2776845434 hasConcept C192034797 @default.
• W2776845434 hasConcept C199360897 @default.
• W2776845434 hasConcept C2776235265 @default.
• W2776845434 hasConcept C2777904410 @default.
• W2776845434 hasConcept C2779639559 @default.
• W2776845434 hasConcept C33923547 @default.
• W2776845434 hasConcept C37914503 @default.
• W2776845434 hasConcept C41008148 @default.
• W2776845434 hasConcept C80444323 @default.
• W2776845434 hasConcept C87619178 @default.
• W2776845434 hasConceptScore W2776845434C11413529 @default.
• W2776845434 hasConceptScore W2776845434C114614502 @default.

• next