Works Published in 2013

search works

Displaying works 1 - 20 of 225 in total

Sorted by most recent date added to the index first, which may not be the same as publication date order.

2013 conference paper

MAST: triage for market-scale mobile malware analysis

Proceedings of the sixth ACM conference on Security and privacy in wireless and mobile networks, 13–24.

By: S. Chakradeo, B. Reaves, P. Traynor & W. Enck

Event: ACM

Source: ORCID
Added: January 2, 2024

2013 conference paper

WHYPER: towards automating risk assessment of mobile applications

Proceedings of the 22nd USENIX Security Symposium, Washington DC, USA, 14–16.

By: R. Pandita, X. Xiao, W. Yang, W. Enck & T. Xie

Source: ORCID
Added: January 2, 2024

2013 conference paper

Preventing accidental data disclosure in modern operating systems

Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security, 1029–1042.

By: A. Nadkarni & W. Enck

Event: ACM

Source: ORCID
Added: January 2, 2024

2013 chapter

Automatic Security Analysis of Android Applications

In Android Security and Mobile Cloud Computing. Springer.

By: V. Rastogi, Y. Chen & W. Enck

Source: ORCID
Added: January 2, 2024

2013 conference paper

AppsPlayground: automatic security analysis of smartphone applications

Proceedings of the third ACM conference on Data and application security and privacy, 209–220.

By: V. Rastogi, Y. Chen & W. Enck

Event: ACM

Source: ORCID
Added: January 2, 2024

2013 conference paper

A comparative evaluation of static analysis actionable alert identification techniques

Proceedings of the 9th International Conference on Predictive Models in Software Engineering, 1–10.

By: S. Heckman & L. Williams

Source: ORCID
Added: July 18, 2023

2013 conference paper

Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering, ESEC/FSE'13, Saint Petersburg, Russian Federation, August 18-26, 2013

http://dl.acm.org/citation.cfm?id=2491411

Marcelo D'Amorim

Ed(s): B. Meyer, L. Baresi & M. Mezini

Source: ORCID
Added: June 21, 2023

2013 conference paper

SPLat: lightweight dynamic analysis for reducing combinatorics in testing configurable systems

Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering, ESEC/FSE'13, Saint Petersburg, Russian Federation, August 18-26, 2013, 257–267.

Marcelo D'Amorim

TL;DR: SPLat is presented, a new way to dynamically prune irrelevant configurations: the configurations to run for a test can be determined during test execution by monitoring accesses to configuration variables, which achieves an optimal reduction in the number of configurations. (via Semantic Scholar)
Source: ORCID
Added: June 21, 2023

2013 conference paper

Entropy-based test generation for improved fault localization

2013 28th IEEE/ACM International Conference on Automated Software Engineering, ASE 2013, Silicon Valley, CA, USA, November 11-15, 2013, 257–267.

TL;DR: This work extends the search-based test generation tool EVOSUITE to use entropy in the fitness function of its underlying genetic algorithm, and applies it to seven real faults, leading to a 91% average reduction of diagnosis candidates needed to inspect to find the true faulty one. (via Semantic Scholar)
Source: ORCID
Added: June 21, 2023

2013 conference paper

2013 28th IEEE/ACM International Conference on Automated Software Engineering, ASE 2013, Silicon Valley, CA, USA, November 11-15, 2013

http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6684409

Marcelo D'Amorim

Ed(s): E. Denney, T. Bultan & A. Zeller

Source: ORCID
Added: June 21, 2023

2013 conference paper

Scheduling mixed-criticality workloads upon unreliable processors

The 11th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP). Presented at the 11th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), Pont a Mousson, France.

By: A. French, Z. Guo & S. Baruah

Event: 11th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP) at Pont a Mousson, France

Source: NC State University Libraries
Added: April 21, 2023

2013 article proceedings

Mixed-criticality scheduling upon non-monitored varying-speed processors

Presented at the 2013 8th IEEE International Symposium on Industrial Embedded Systems (SIES).

By: Z. Guo* & S. Baruah*

Event: 2013 8th IEEE International Symposium on Industrial Embedded Systems (SIES)

TL;DR: The problem of executing an integrated workload, consisting of some more important components and some less important ones, upon a non-monitored varying-speed processor is considered and it is desired that all components execute correctly under normal circumstances. (via Semantic Scholar)
Sources: Crossref, ORCID
Added: April 1, 2023

2013 article proceedings

Flexible and robust co-regularized multi-domain graph clustering

Presented at the KDD' 13: The 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.

Event: KDD' 13: The 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

TL;DR: CGC (Co-regularized Graph Clustering), based on non-negative matrix factorization (NMF), has several advantages over the existing methods, and provides users with the extent to which the cross-domain instance relationship violates the in-domain clustering structure, and thus enables users to re-evaluate the consistency of the relationship. (via Semantic Scholar)
Sources: Crossref, ORCID
Added: April 1, 2023

2013 article proceedings

Mixed-Criticality Scheduling upon Varying-Speed Processors

Presented at the 2013 IEEE 34th Real-Time Systems Symposium (RTSS).

By: S. Baruah* & Z. Guo*

Event: 2013 IEEE 34th Real-Time Systems Symposium (RTSS)

TL;DR: A varying-speed processor is characterized by two execution speeds: a normal speed and a degraded speed, whereas the more important components should execute correctly if the processor runs at any speed no slower than its specified degraded speed. (via Semantic Scholar)
UN Sustainable Development Goal Categories
7. Affordable and Clean Energy (OpenAlex)
Sources: Crossref, ORCID
Added: April 1, 2023

2013 article proceedings

Variation support for end users

Presented at the 2013 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC).

By: S. Kuttal*

Event: 2013 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)

TL;DR: End-user programming environments provide central repositories where users can execute and store their programs, but these environments do not provide facilities by which users can keep track of the variations that they create for their programs. (via Semantic Scholar)
Sources: Crossref, ORCID
Added: March 26, 2023

2013 article proceedings

Debugging support for end user mashup programming

Presented at the CHI '13: CHI Conference on Human Factors in Computing Systems.

By: S. Kuttal*, A. Sarma* & G. Rothermel*

Event: CHI '13: CHI Conference on Human Factors in Computing Systems

TL;DR: Support that is implemented in the Yahoo! Pipes environment to provide automatic error detection techniques that help mashup programmers localize and correct bugs more effectively and efficiently is described. (via Semantic Scholar)
Sources: Crossref, ORCID
Added: March 26, 2023

2013 article proceedings

Predator behavior in the wild web world of bugs: An information foraging theory perspective

Presented at the 2013 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC).

By: S. Kuttal*, A. Sarma* & G. Rothermel*

Event: 2013 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)

TL;DR: The results show that the stronger scents available within mashup programming environments can improve users' foraging success, and lead to a new model for debugging activities framed in terms of information foraging theory. (via Semantic Scholar)
Sources: Crossref, ORCID
Added: March 26, 2023

2013 conference paper

Parallel algorithms for graph optimization using tree decompositions

Proceedings - IEEE 27th International Parallel and Distributed Processing Symposium Workshops and PhD Forum, IPDPSW 2013, 1838–1847.

By: B. Sullivan*, D. Weerapurage* & C. Groer*

Contributors: B. Sullivan*, D. Weerapurage* & C. Groer*

TL;DR: This work enables a significant expansion of the scale of graphs on which exact solutions to maximum weighted independent set can be obtained, and forms a framework for solving additional graph optimization problems with similar techniques. (via Semantic Scholar)
Source: ORCID
Added: August 6, 2022

2013 journal article

On a conjecture of Andrica and Tomescu

Journal of Integer Sequences, 16(3). http://www.scopus.com/inward/record.url?eid=2-s2.0-84880061040&partnerID=MN8TOARS

By: B. Sullivan

Contributors: B. Sullivan

Source: ORCID
Added: August 6, 2022

2013 conference paper

Tree-Like Structure in Large Social and Information Networks

2013 IEEE 13th International Conference on Data Mining, 1–10.

By: A. Adcock*, B. Sullivan n & M. Mahoney*

Contributors: B. Sullivan n

TL;DR: A detailed empirical analysis of the tree-like properties of realistic informatics graphs is performed using two very different notions of tree-likeness: Gromov's d-hyperbolicity and tree decompositions, tools from structural graph theory which measure how tree- like a graph is in terms of its cut structure. (via Semantic Scholar)
Source: ORCID
Added: August 6, 2022

Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.

Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.