Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 36 matches
- 2011
- Tristan Oliver Richard Allwood, Cristian Cadar, Susan Eisenbach:
High coverage testing of Haskell programs. ISSTA 2011: 375-385 - Andrea Arcuri, Lionel C. Briand:
Adaptive random testing: an illusion of effectiveness? ISSTA 2011: 265-275 - Domagoj Babic, Lorenzo Martignoni, Stephen McCamant, Dawn Song:
Statically-directed dynamic automated test generation. ISSTA 2011: 12-22 - Daniel Balasubramanian, Corina S. Pasareanu, Michael W. Whalen, Gabor Karsai, Michael R. Lowry:
Polyglot: modeling and analysis for multiple Statechart formalisms. ISSTA 2011: 45-55 - Andrew R. Bernat, Kevin A. Roundy, Barton P. Miller:
Efficient, sensitivity resistant binary instrumentation. ISSTA 2011: 89-99 - Martin Burger, Andreas Zeller:
Minimizing reproduction of software failures. ISSTA 2011: 221-231 - Jacob Burnim, Koushik Sen, Christos Stergiou:
Testing concurrent programs on relaxed memory models. ISSTA 2011: 122-132 - Nicholas DiGiuseppe, James A. Jones:
On the influence of multiple faults on coverage-based fault localization. ISSTA 2011: 210-220 - Emine Dumlu, Cemal Yilmaz, Myra B. Cohen, Adam A. Porter:
Feedback driven adaptive combinatorial testing. ISSTA 2011: 243-253 - Gordon Fraser, Andreas Zeller:
Generating parameterized unit tests. ISSTA 2011: 364-374 - Milos Gligoric, Darko Marinov, Sam Kamin:
CoDeSe: fast deserialization via code generation. ISSTA 2011: 298-308 - Patrice Godefroid, Daniel Luchaup:
Automatic partial loop summarization in dynamic test generation. ISSTA 2011: 23-33 - Salvatore Guarnieri, Marco Pistoia, Omer Tripp, Julian Dolby, Stephen Teilhet, Ryan Berg:
Saving the world wide web from vulnerable JavaScript. ISSTA 2011: 177-187 - Philip J. Guo, Dawson R. Engler:
Using automatic persistent memoization to facilitate data analysis scripting. ISSTA 2011: 287-297 - Jeff Huang, Charles Zhang:
Persuasive prediction of concurrency access anomalies. ISSTA 2011: 144-154 - Vilas Jagannath, Qingzhou Luo, Darko Marinov:
Change-aware preemption prioritization. ISSTA 2011: 133-143 - Wei Le, Mary Lou Soffa:
Generating analyses for detecting faults in path segments. ISSTA 2011: 320-330 - Matthew J. McGill, Laura K. Dillon, R. E. Kurt Stirewalt:
Scalable analysis of conceptual data models. ISSTA 2011: 56-66 - Akbar Siami Namin, Sahitya Kakarla:
The use of mutation in testing experiments and its sensitivity to external threats. ISSTA 2011: 342-352 - Jaideep Nijjar, Tevfik Bultan:
Bounded verification of Ruby on Rails data models. ISSTA 2011: 67-77 - Chris Parnin, Alessandro Orso:
Are automated debugging techniques actually helping programmers? ISSTA 2011: 199-209 - Corina S. Pasareanu, Neha Rungta, Willem Visser:
Symbolic execution with mixed concrete-symbolic solving. ISSTA 2011: 34-44 - Michael Pradel, Thomas R. Gross:
Detecting anomalies in the order of equally-typed method arguments. ISSTA 2011: 232-242 - Nathan E. Rosenblum, Barton P. Miller, Xiaojin Zhu:
Recovering the toolchain provenance of binary code. ISSTA 2011: 100-110 - Cindy Rubio-González, Ben Liblit:
Defective error/pointer interactions in the Linux kernel. ISSTA 2011: 111-121 - Itai Segall, Rachel Tzoref-Brill, Eitan Farchi:
Using binary decision diagrams for combinatorial test design. ISSTA 2011: 254-264 - Muzammil Shahbaz, K. C. Shashidhar, Robert Eschbach:
Iterative refinement of specification for component based embedded systems. ISSTA 2011: 276-286 - William N. Sumner, Tao Bao, Xiangyu Zhang:
Selecting peers for execution comparison. ISSTA 2011: 309-319 - Kunal Taneja, Tao Xie, Nikolai Tillmann, Jonathan de Halleux:
eXpress: guided path exploration for efficient regression test generation. ISSTA 2011: 1-11 - Takaaki Tateishi, Marco Pistoia, Omer Tripp:
Path- and index-sensitive string analysis based on monadic second-order logic. ISSTA 2011: 166-176
skipping 6 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-06-25 15:29 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint