Остановите войну!
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 61 matches
- 2012
- Mithun Acharya, Brian Robinson:
Practical change impact analysis based on static program slicing for industrial software systems. SIGSOFT FSE 2012: 13 - Elvira Albert, Antonio Flores-Montoya, Samir Genaim:
MayPar: a may-happen-in-parallel analyzer for concurrent objects. SIGSOFT FSE 2012: 14 - Saswat Anand, Mayur Naik, Mary Jean Harrold, Hongseok Yang:
Automated concolic testing of smartphone apps. SIGSOFT FSE 2012: 59 - Dionysis Athanasopoulos, Apostolos V. Zarras, Panos Vassiliadis:
Service selection for happy users: making user-intuitive quality abstractions. SIGSOFT FSE 2012: 32 - Vinay Augustine:
Automating adaptive maintenance changes with SrcML and LINQ. SIGSOFT FSE 2012: 9 - Dirk Beyer, Thomas A. Henzinger, M. Erkan Keremoglu, Philipp Wendler:
Conditional model checking: a technique to pass information between verifiers. SIGSOFT FSE 2012: 57 - Christian Bird, Thomas Zimmermann:
Assessing the value of branches with what-if analysis. SIGSOFT FSE 2012: 45 - Matthias Book, Simon Grapenthin, Volker Gruhn:
Seeing the forest and the trees: focusing team interaction on value and effort drivers. SIGSOFT FSE 2012: 30 - Bora Caglayan, Ayse Tosun Misirli, Gul Calikli, Ayse Bener, Turgay Aytac, Burak Turhan:
Dione: an integrated measurement and defect prediction solution. SIGSOFT FSE 2012: 20 - Kyle R. Canavera, Naeem Esfahani, Sam Malek:
Mining the execution history of a software system to infer the best time for its adaptation. SIGSOFT FSE 2012: 18 - Gerardo Canfora, Massimiliano Di Penta, Rocco Oliveto, Sebastiano Panichella:
Who is going to mentor newcomers in open source projects? SIGSOFT FSE 2012: 44 - Wing-Kwan Chan, Hong Cheng, David Lo:
Searching connected API subgraph via text phrases. SIGSOFT FSE 2012: 10 - Mahinthan Chandramohan, Hee Beng Kuan Tan, Lwin Khin Shar:
Scalable malware clustering through coarse-grained behavior modeling. SIGSOFT FSE 2012: 27 - Bradley Cossette, Robert J. Walker:
Seeking the ground truth: a retroactive study on the evolution and migration of software libraries. SIGSOFT FSE 2012: 55 - Gianpaolo Cugola, Carlo Ghezzi, Leandro Sales Pinto, Giordano Tamburrelli:
SelfMotion: a declarative language for adaptive service-oriented mobile apps. SIGSOFT FSE 2012: 7 - Nicholas DiGiuseppe, James A. Jones:
Semantic fault diagnosis: automatic natural-language fault descriptions. SIGSOFT FSE 2012: 23 - Nicholas DiGiuseppe, James A. Jones:
Concept-based failure clustering. SIGSOFT FSE 2012: 29 - Michael Emmi, Akash Lal, Shaz Qadeer:
Asynchronous programs with prioritized task-buffers. SIGSOFT FSE 2012: 48 - Naeem Esfahani, Kaveh Razavi, Sam Malek:
Dealing with uncertainty in early software architecture. SIGSOFT FSE 2012: 21 - Azadeh Farzan, P. Madhusudan, Niloofar Razavi, Francesco Sorrentino:
Predicting null-pointer dereferences in concurrent programs. SIGSOFT FSE 2012: 47 - Mark Gabel, Zhendong Su:
Testing mined specifications. SIGSOFT FSE 2012: 4 - Malay K. Ganai, Dongyoon Lee, Aarti Gupta:
DTAM: dynamic taint analysis of multi-threaded programs for relevancy. SIGSOFT FSE 2012: 46 - Wei Huang, Ana L. Milanova:
ReImInfer: method purity inference for Java. SIGSOFT FSE 2012: 38 - Miryung Kim, Thomas Zimmermann, Nachiappan Nagappan:
A field study of refactoring challenges and benefits. SIGSOFT FSE 2012: 50 - Taeho Kwon, Zhendong Su:
Detecting and analyzing insecure component usage. SIGSOFT FSE 2012: 5 - Kaiping Liu, Hee Beng Kuan Tan, Mahinthan Chandramohan:
Has this bug been reported? SIGSOFT FSE 2012: 28 - Senthil Mani, Rose Catherine, Vibha Singhal Sinha, Avinava Dubey:
AUSUM: approach for unsupervised bug report summarization. SIGSOFT FSE 2012: 11 - Ana L. Milanova, Wei Huang:
Inference and checking of context-sensitive pluggable types. SIGSOFT FSE 2012: 26 - Mehdi Mirakhorli, Patrick Mäder, Jane Cleland-Huang:
Variability points and design pattern usage in architectural tactics. SIGSOFT FSE 2012: 52 - Emerson R. Murphy-Hill, Rahul Jiresal, Gail C. Murphy:
Improving software developers' fluency by recommending development environment commands. SIGSOFT FSE 2012: 42
skipping 31 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-05-01 19:28 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