Reducing Configurations to Monitor in a Software Product Line

Kim, Chang Hwan Peter; Bodden, Eric; Batory, Don; Khurshid, Sarfraz

doi:10.1007/978-3-642-16612-9_22

Cited by 29 publications

(25 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Features include a logical solver and a configuration generator. 2 All subjects except 101Companies have been used in previous studies on testing/analyzing SPLs, including GPL by [2,5], Elevator, Email, MinePump by [2], JTopas by [6], Notepad by [21,20], XStream by [11,35] Prevayler by [36,1], and Sudoku by [1]. • XStream [28] is a library for (de)serializing objects to XML (and from it).…”

Section: • Notepad [21] Is a Gui Application Based On Javamentioning

confidence: 99%

See 1 more Smart Citation

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

Kim

Marinov

Khurshid

et al. 2013

Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering

Self Cite

View full text Add to dashboard Cite

Many programs can be configured through dynamic and/or static selection of configuration variables. A software product line (SPL), for example, specifies a family of programs where each program is defined by a unique combination of features. Systematically testing SPL programs is expensive as it can require running each test against a combinatorial number of configurations. Fortunately, a test is often independent of many configuration variables and need not be run against every combination. Configurations that are not required for a test can be pruned from execution. This paper presents SPLat, 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. SPLat achieves an optimal reduction in the number of configurations and is lightweight compared to prior work that used static analysis and heavyweight dynamic execution. Experimental results on 10 SPLs written in Java show that SPLat substantially reduces the total test execution time in many cases. Moreover, we demonstrate the scalability of SPLat by applying it to a large industrial code base written in Ruby on Rails.

show abstract

Section: • Notepad [21] Is a Gui Application Based On Javamentioning

confidence: 99%

“…To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. ESEC/FSE '13, August [18][19][20][21][22][23][24][25][26]2013, Saint Petersburg, Russia Copyright 2013 ACM 978-1-4503-2237-9/13/08 ...$15.00.…”

Section: Introductionmentioning

confidence: 99%

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

Kim

Marinov

Khurshid

et al. 2013

Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering

Self Cite

View full text Add to dashboard Cite

show abstract

“…In ongoing work, we are extending the Clara static analysis framework to better cope with native and reflective calls [Bodden et al 2011], and to analyze and optimize runtime monitors not only for individual programs but instead for entire software product lines [Kim et al 2010]. In future work, we plan to design typestate analyses that do not require the entire closed program but instead operate on individual program modules, e.g.…”

Section: Resultsmentioning

confidence: 99%

Partially Evaluating Finite-State Runtime Monitors Ahead of Time

Bodden

Lam

Hendren

2012

ACM Trans. Program. Lang. Syst.

Self Cite

View full text Add to dashboard Cite

Finite-state properties account for an important class of program properties, typically related to the order of operations invoked on objects. Many library implementations therefore include manually-written finite-state monitors to detect violations of finite-state properties at runtime. Researchers have recently proposed the explicit specification of finite-state properties and automatic generation of monitors from the specification. However, runtime monitoring only shows the presence of violations, and typically cannot prove their absence. Moreover, inserting a runtime monitor into a program under test can slow down the program by several orders of magnitude.In this work, we therefore present a set of four static whole-program analyses that partially evaluate runtime monitors at compile time, with increasing cost and precision. As we show, ahead-of-time evaluation can often evaluate the monitor completely statically. This may prove that the program cannot violate the property on any execution or may prove that violations do exist. In the remaining cases, the partial evaluation converts the runtime monitor into a residual monitor. This monitor only receives events from program locations that the analyses failed to prove irrelevant. This makes the residual monitor much more efficient than a full monitor, while still capturing all property violations at runtime.We implemented the analyses in Clara, a novel framework for the partial evaluation of AspectJ-based runtime monitors, and validated our approach by applying Clara to finite-state properties over several large-scale Java programs. Clara proved that most of the programs never violate our example properties. Some programs required monitoring, but in those cases Clara could often reduce the monitoring overhead to below 10%. We observed that several programs did violate the stated properties.

show abstract

“…However, there are other ways to combine runtime verification with software product lines. Kim et al exploit the constraints imposed by a feature model, paired with a static program analysis to restrict runtime verifications only to products that actually have the potential of violating the property in question [11]. This approach could be extended for delta-oriented monitor specifications, and we consider such an extension for future work.…”

Section: Related Work and Conclusionmentioning

confidence: 99%

Delta-Oriented Monitor Specification

Bodden

Falzon

Pun

et al. 2012

Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change

Self Cite

View full text Add to dashboard Cite

Abstract. Delta-oriented programming allows software developers to define software product lines as variations of a common code base, where variations are expressed as so-called program deltas. Monitor-oriented programming (MOP) provides a mechanism to execute functionality based on the execution history of the program; this is useful, e.g., for the purpose of runtime verification and for enforcing security policies. In this work we discuss how delta-oriented programming and MOP can benefit from each other in the Abstract Behavior Specification Language (ABS) through a new approach we call Delta-oriented Monitor Specification (DMS). We use deltas over monitor definitions to concisely capture protocol changes induced by feature combinations, and propose a notation to denote these deltas. In addition, we explore the design space for expressing runtime monitors as program deltas in ABS. A small case study shows that our approach successfully avoids code duplication in monitor specifications and that those specifications can evolve hand in hand with feature definitions.

show abstract

Reducing Configurations to Monitor in a Software Product Line

Cited by 29 publications

References 11 publications

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

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

Partially Evaluating Finite-State Runtime Monitors Ahead of Time

Delta-Oriented Monitor Specification

Contact Info

Product

Resources

About