| 1. |
- Beohar, Harsh, 1984-, et al.
(författare)
-
Input-output conformance testing based on featured transition systems
- 2014
-
Ingår i: Proceedings of the 29th Annual ACM Symposium on Applied Computing. - New York, NY, USA : Association for Computing Machinery (ACM). - 9781450324694 ; , s. 1272-1278
-
Konferensbidrag (refereegranskat)abstract
- We extend the theory of input-output conformance testing to the setting of software product lines. In particular, we allow for input-output featured transition systems to be used as the basis for generating test suites and test cases. We introduce refinement operators both at the level of models and at the level of test suites that allow for projecting them into a specific product configuration (or a product sub-line). We show that the two sorts of refinement are consistent and lead to the same set of test-cases. © Copyright 2014 ACM
|
|
| 2. |
- Georgiadis, Georgios, 1981, et al.
(författare)
-
Dealing with storage without forecasts in Smart Grids: problem transformation and online scheduling algorithm
- 2014
-
Ingår i: 29th Annual ACM Symposium on Applied Computing, SAC 2014; Gyeongju; South Korea; 24 March 2014 through 28 March 2014. - New York, NY, USA : ACM. - 9781450324694 ; , s. 518-524
-
Konferensbidrag (refereegranskat)abstract
- Renewable and distributed energy sources are today possiblebut these technologies bring benefits as well as challenges, such as their intermittent nature, that leads to utilization problems for the power grid. On the other hand, upcoming storage technologies, such as electric vehicles, hold the potential to store and utilize this intermittent supply at a later time but bring challenges of their own, for example efficient storage utilization and intermittent energy demand.In this paper we propose a novel modeling of the problem ofunforecasted energy dispatch with storage as an onlinescheduling problem of tasks on machines, by transformingtime constraints of energy requests into equivalent machineconstraints as well as by modeling energy storage through the extension of existing online scheduling techniques with the concept of \emph{load credit}. Based on this transformation, we also present an algorithm that dispatches load and utilizes efficiently any storage capabilities in order to mitigate the effect of unreliable or non-existent demand forecasts, and we prove that the resulting solution's competitive ratio is within a logarithmic factor of the optimal offline solution. Finally, we provide an extensive simulation study for a variety of scenarios based on data from a large network of consumers, showing that the presented algorithm is highly competitive even to methods that assume exact knowledge about the demand requests.
|
|
| 3. |
- Hedin, Daniel, 1978, et al.
(författare)
-
JSFlow: Tracking Information Flow in JavaScript and its APIs
- 2014
-
Ingår i: Proceedings of the ACM Symposium on Applied Computing (SAC). - New York, NY, USA : ACM. - 9781450324694 ; , s. 1663-1671
-
Konferensbidrag (refereegranskat)abstract
- JavaScript drives the evolution of the web into a powerful application platform. Increasingly, web applications combine services from different providers. The script inclusion mechanism routinely turns barebone web pages into full-fledged services built up from third-party code. Such code provides a range of facilities from helper utilities (such as jQuery) to readily available services (such as Google Analytics and Tynt). Script inclusion poses a challenge of ensuring that the integrated third-party code respects security and privacy. This paper presents JSFlow, a security-enhanced JavaScript interpreter for fine-grained tracking of information flow. We show how to resolve practical challenges for enforcing information-flow policies for the full JavaScript language, as well as tracking information in the presence of libraries, as provided by browser APIs. The interpreter is itself written in JavaScript, which enables deployment as a browser extension. Our experiments with the extension provide in-depth understanding of information manipulation by third-party scripts such as Google Analytics. We find that different sites intended to provide similar services effectuate rather different security policies for the user's sensitive information: some ensure it does not leave the browser, others share it with the originating server, while yet others freely propagate it to third parties. Copyright 2014 ACM.
|
|
| 4. |
- Patrignani, Marco, et al.
(författare)
-
Fully abstract trace semantics for low-level isolation mechanisms
- 2014
-
Ingår i: Symposium on Applied Computing, SAC 2014.. - New York, NY, USA : ACM Press. - 9781450324694 ; , s. 1562-1569
-
Konferensbidrag (refereegranskat)abstract
- Many software systems adopt isolation mechanisms of modernprocessors as software security building blocks. Reasoningabout these building blocks means reasoning aboutelaborate assembly code, which can be very complex due tothe loose structure of the code. A way to overcome this complexityis giving the code a more structured semantics. Thispaper presents one such semantics, namely a fully abstracttrace semantics, for an assembly language enhanced withprotection mechanisms of modern processors. The trace semanticsrepresents the behaviour of protected assembly codewith simple abstractions, unburdened by low-level details, atthe maximum degree of precision. Additionally, it capturesthe capabilities of attackers to protected software and simplifiesproviding a secure compiler targeting that language.
|
|
| 5. |
- Rana, Juwel, et al.
(författare)
-
The strength of social strength: an evaluation study of algorithmic versus user-defined ranking
- 2014
-
Ingår i: Proceedings of the ACM Symposium on Applied Computing. - New York : ACM Digital Library. - 9781450324694 ; , s. 658-659
-
Konferensbidrag (refereegranskat)abstract
- A family relation is generally considered to be stronger than a relation between coworkers in our society, but the strength of the relation is intrinsic and have been cumbersome to measure. The fact that we increasingly communicate electronically, such as through email, mobile phone calls or social media, has made it possible to automatically measure and analyze the relation between persons. This paper presents an evaluation study of social strength, where the social strength is defined as a metric that represents the tie strength of the relation between persons, calculated based on the frequency, duration, context and media type of the electronic communication between the persons. The study found that the Utility Function performs better because it emphasize the communication frequency between persons. There is however a significant difference in results between the algorithms and the user-defined ranking. This indicates the inability of the algorithms to capture intrinsic knowledge (such as the importance of family bonds and nonelectronic interaction). This would mean that the participants' ranking was colored by their interaction in real-life. It is however evident from the study that the functions provide more accurate results when they utilize multiple sources of communication history over only a single source. Finally, capturing sufficient communication data from multiple data sources is very hard, as access to such data is restricted because of concerns regarding for instance business and privacy. A conclusion is that the algorithms requires a larger data set, preferably being captured continuously over a period longer than 2 weeks, to achieve a better accuracy that is closer to the ground truth. However, the study shows the feasibility of capturing social strength automatically and we believe that the results is an important step towards systems that reason about the relation between persons in order to make communications services more pervasive.
|
|
