uu.seUppsala universitets publikasjoner
Endre søk
Begrens søket
1234567 151 - 200 of 363
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Treff pr side
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Forfatter A-Ø
  • Forfatter Ø-A
  • Tittel A-Ø
  • Tittel Ø-A
  • Type publikasjon A-Ø
  • Type publikasjon Ø-A
  • Eldste først
  • Nyeste først
  • Skapad (Eldste først)
  • Skapad (Nyeste først)
  • Senast uppdaterad (Eldste først)
  • Senast uppdaterad (Nyeste først)
  • Disputationsdatum (tidligste først)
  • Disputationsdatum (siste først)
  • Standard (Relevans)
  • Forfatter A-Ø
  • Forfatter Ø-A
  • Tittel A-Ø
  • Tittel Ø-A
  • Type publikasjon A-Ø
  • Type publikasjon Ø-A
  • Eldste først
  • Nyeste først
  • Skapad (Eldste først)
  • Skapad (Nyeste først)
  • Senast uppdaterad (Eldste først)
  • Senast uppdaterad (Nyeste først)
  • Disputationsdatum (tidligste først)
  • Disputationsdatum (siste først)
Merk
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 151. Guan, Nan
    et al.
    Han, Meiling
    Gu, Chuancai
    Deng, Qingxu
    Yi, Wang
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Bounding carry-in interference to improve fixed-priority global multiprocessor scheduling analysis2015Inngår i: Proc. 21st International Conference on Embedded and Real-Time Computing Systems and Applications, IEEE Computer Society, 2015, s. 11-20Konferansepaper (Fagfellevurdert)
  • 152. Guan, Nan
    et al.
    Tang, Yue
    Abdullah, Jakaria
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Stigge, Martin
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Yi, Wang
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Scalable timing analysis with refinement2015Inngår i: Tools and Algorithms for the Construction and Analysis of Systems, Springer, 2015, s. 3-18Konferansepaper (Fagfellevurdert)
  • 153.
    Guan, Nan
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Tang, Yue
    Wang, Yang
    Yi, Wang
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Delay analysis of structural real-time workload2015Inngår i: Proc. 18th Conference on Design, Automation and Test in Europe, Piscataway, NJ: IEEE, 2015, s. 223-228Konferansepaper (Fagfellevurdert)
  • 154. Guan, Nan
    et al.
    Zhao, Mengying
    Xue, Chun Jason
    Liu, Yongpan
    Yi, Wang
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Modular performance analysis of energy-harvesting real-time networked systems2015Inngår i: Proc. 36th Real-Time Systems Symposium, IEEE Computer Society, 2015, s. 65-74Konferansepaper (Fagfellevurdert)
  • 155.
    Hassani Bijarbooneh, Farshid
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Du, Wei
    Ngai, Edith C.-H.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Fu, Xiaoming
    Liu, Jiangchuan
    Cloud-assisted data fusion and sensor selection for Internet of Things2016Inngår i: IEEE Internet of Things Journal, ISSN 2327-4662, Vol. 3, nr 3, s. 257-268Artikkel i tidsskrift (Fagfellevurdert)
  • 156.
    Haziza, Frédéric
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för datorteknik. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Few is Just Enough!: Small Model Theorem for Parameterized Verification and Shape Analysis2015Doktoravhandling, med artikler (Annet vitenskapelig)
    Abstract [en]

    This doctoral thesis considers the automatic verification of parameterized systems, i.e. systems with an arbitrary number of communicating components, such as mutual exclusion protocols, cache coherence protocols or heap manipulating programs. The components may be organized in various topologies such as words, multisets, rings, or trees.

    The task is to show correctness regardless of the size of the system and we consider two methods to prove safety:(i) a backward reachability analysis, using the well-quasi ordered framework and monotonic abstraction, and (ii) a forward analysis which only needs to inspect a small number of components in order to show correctness of the whole system. The latter relies on an abstraction function that views the system from the perspective of a fixed number of components. The abstraction is used during the verification procedure in order to dynamically detect cut-off points beyond which the search of the state-space need not continue.

    Our experimentation on a variety of benchmarks demonstrate that the method is highly efficient and that it works well even for classes of systems with undecidable property. It has been, for example, successfully applied to verify a fine-grained model of Szymanski's mutual exclusion protocol. Finally, we applied the methods to solve the complex problem of verifying highly concurrent data-structures, in a challenging setting: We do not a priori bound the number of threads, the size of the data-structure, the domain of the data to store nor do we require the presence of a garbage collector. We successfully verified the concurrent Treiber's stack and Michael & Scott's queue, in the aforementioned setting.

    To the best of our knowledge, these verification problems have been considered challenging in the parameterized verification community and could not be carried out automatically by other existing methods.

    Delarbeid
    1. All for the price of few: (Parameterized verification through view abstraction)
    Åpne denne publikasjonen i ny fane eller vindu >>All for the price of few: (Parameterized verification through view abstraction)
    2013 (engelsk)Inngår i: Verification, Model Checking, and Abstract Interpretation, Springer Berlin/Heidelberg, 2013, s. 476-495Konferansepaper, Publicerat paper (Fagfellevurdert)
    sted, utgiver, år, opplag, sider
    Springer Berlin/Heidelberg, 2013
    Serie
    Lecture Notes in Computer Science ; 7737
    HSV kategori
    Identifikatorer
    urn:nbn:se:uu:diva-190003 (URN)10.1007/978-3-642-35873-9_28 (DOI)978-3-642-35872-2 (ISBN)
    Konferanse
    VMCAI 2013, January 20-22, Rome, Italy
    Prosjekter
    UPMARC
    Tilgjengelig fra: 2013-01-09 Laget: 2013-01-07 Sist oppdatert: 2015-11-10bibliografisk kontrollert
    2. An Integrated Specification and Verification Technique for Highly Concurrent Data Structures
    Åpne denne publikasjonen i ny fane eller vindu >>An Integrated Specification and Verification Technique for Highly Concurrent Data Structures
    Vise andre…
    2013 (engelsk)Inngår i: Tools and Algorithms for the Construction and Analysis of Systems, 2013Konferansepaper, Publicerat paper (Fagfellevurdert)
    Abstract [en]

    We present a technique for automatically verifying safety properties of concurrent programs, in particular programs which rely on subtle dependen- cies of local states of different threads, such as lock-free implementations of stacks and queues in an environment without garbage collection. Our technique addresses the joint challenges of infinite-state specifications, an unbounded num- ber of threads, and an unbounded heap managed by explicit memory allocation. Our technique builds on the automata-theoretic approach to model checking, in which a specification is given by an automaton that observes the execution of a program and accepts executions that violate the intended specification. We extend this approach by allowing specifications to be given by a class of infinite-state au- tomata. We show how such automata can be used to specify queues, stacks, and other data structures, by extending a data-independence argument. For verifica- tion, we develop a shape analysis, which tracks correlations between pairs of threads, and a novel abstraction to make the analysis practical. We have imple- mented our method and used it to verify programs, some of which have not been verified by any other automatic method before.

    Emneord
    verification, pointer program, queue, stack, unbounded concurrency, specification, linearizability
    HSV kategori
    Identifikatorer
    urn:nbn:se:uu:diva-191330 (URN)
    Konferanse
    19th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 16-24 March, 2013, Rome, ITALY
    Prosjekter
    UPMARC
    Tilgjengelig fra: 2013-01-16 Laget: 2013-01-10 Sist oppdatert: 2018-01-11bibliografisk kontrollert
    3. Block me if you can!: Context-sensitive parameterized verification
    Åpne denne publikasjonen i ny fane eller vindu >>Block me if you can!: Context-sensitive parameterized verification
    2014 (engelsk)Inngår i: Static Analysis: SAS 2014, Springer, 2014, s. 1-17Konferansepaper, Publicerat paper (Fagfellevurdert)
    Abstract [en]

    We present a method for automatic verification of systems with a parameterized number of communicating processes, such as mutual exclusion protocols or agreement protocols. To that end, we present a powerful abstraction framework that uses an efficient and precise symbolic encoding of (infinite) sets of configurations. In particular, it generalizes downward-closed sets that have successfully been used in earlier approaches to parameterized verification. We show experimentally the efficiency of the method, on various examples, including a fine-grained model of Szymanski’s mutual exclusion protocol, whose correctness, to the best of our knowledge, has not been proven automatically by any other existing methods.

    sted, utgiver, år, opplag, sider
    Springer, 2014
    Serie
    Lecture Notes in Computer Science, ISSN 0302-9743 ; 8723
    HSV kategori
    Identifikatorer
    urn:nbn:se:uu:diva-260087 (URN)10.1007/978-3-319-10936-7_1 (DOI)000360204700001 ()978-3-319-10935-0 (ISBN)
    Konferanse
    21st International Symposium, SAS 2014, September 11–13, Munich, Germany
    Prosjekter
    UPMARC
    Tilgjengelig fra: 2014-09-13 Laget: 2015-08-15 Sist oppdatert: 2015-12-16bibliografisk kontrollert
    4. Monotonic abstraction for programs with dynamic memory heaps
    Åpne denne publikasjonen i ny fane eller vindu >>Monotonic abstraction for programs with dynamic memory heaps
    Vise andre…
    2008 (engelsk)Inngår i: Computer Aided Verification / [ed] Gupta A, Malik S, Berlin: Springer-Verlag , 2008, s. 341-354Konferansepaper, Publicerat paper (Fagfellevurdert)
    Abstract [en]

    We propose a new approach for automatic verification of programs with dynamic heap manipulation. The method is based on symbolic (backward) reachability analysis using upward-closed sets of heaps w.r.t. an appropriate preorder on graphs. These sets are represented by a finite set of minimal graph patterns corresponding to a set of bad configurations. We define an abstract semantics for the programs which is monotonic w.r.t. the preorder. Moreover, we prove that our analysis always terminates by showing that the preorder is a well-quasi ordering. Our results are presented for the case of programs with 1-next selector. We provide experimental results showing the effectiveness of our approach.

    sted, utgiver, år, opplag, sider
    Berlin: Springer-Verlag, 2008
    Serie
    Lecture Notes in Computer Science, ISSN 0302-9743 ; 5123
    HSV kategori
    Identifikatorer
    urn:nbn:se:uu:diva-106059 (URN)10.1007/978-3-540-70545-1_33 (DOI)000257539900033 ()
    Konferanse
    20th International Conference on Computer Aided Verification Princeton, NJ, JUL 07, 2008
    Tilgjengelig fra: 2009-06-13 Laget: 2009-06-13 Sist oppdatert: 2018-01-13bibliografisk kontrollert
    5. Parameterized tree systems
    Åpne denne publikasjonen i ny fane eller vindu >>Parameterized tree systems
    Vise andre…
    2008 (engelsk)Inngår i: Formal Techniques for Networked and Distributed Systems: FORTE 2008 / [ed] Suzuki K, Berlin: Springer-Verlag , 2008, s. 69-83Konferansepaper, Publicerat paper (Fagfellevurdert)
    Abstract [en]

    Several recent works have considered parameterized verification, i.e. automatic verification of systems consisting of an arbitrary number of finite-state processes organized in a linear array. The aim of this paper is to extend these works by giving a simple and efficient method to prove safety properties for systems with tree-like architectures. A process in the system is a finite-state automaton and a transition is performed jointly by a process and its parent and children processes. The method derives an over-approximation of the induced transition system, which allows the use of finite trees as symbolic representations of infinite sets of configurations. Compared to traditional methods for parameterized verification of systems with tree topologies, our method does not require the manipulation of tree transducers, hence its simplicity and efficiency. We have implemented a prototype which works well on several nontrivial tree-based protocols.

    sted, utgiver, år, opplag, sider
    Berlin: Springer-Verlag, 2008
    Serie
    Lecture Notes in Computer Science, ISSN 0302-9743 ; 5048
    HSV kategori
    Identifikatorer
    urn:nbn:se:uu:diva-106058 (URN)10.1007/978-3-540-68855-6_5 (DOI)000256666500005 ()978-3-540-68854-9 (ISBN)
    Konferanse
    28th International Conference on Formal Techniques for Networked and Distributed Systems Tokyo, JAPAN, JUN 10-13, 2008
    Tilgjengelig fra: 2009-06-13 Laget: 2009-06-13 Sist oppdatert: 2018-01-13bibliografisk kontrollert
    6. Model checking race-freeness
    Åpne denne publikasjonen i ny fane eller vindu >>Model checking race-freeness
    2008 (engelsk)Inngår i: SIGARCH Computer Architecture News, ISSN 0163-5964, E-ISSN 1943-5851, Vol. 36, nr 5, s. 72-79Artikkel i tidsskrift (Fagfellevurdert) Published
    HSV kategori
    Identifikatorer
    urn:nbn:se:uu:diva-142914 (URN)10.1145/1556444.1556454 (DOI)
    Tilgjengelig fra: 2011-01-17 Laget: 2011-01-17 Sist oppdatert: 2018-01-12bibliografisk kontrollert
    7. Parameterized verification through view abstraction
    Åpne denne publikasjonen i ny fane eller vindu >>Parameterized verification through view abstraction
    2016 (engelsk)Inngår i: International Journal on Software Tools for Technology Transfer (STTT), ISSN 1433-2779, E-ISSN 1433-2787, Vol. 18, nr 5, s. 495-516Artikkel i tidsskrift (Fagfellevurdert) Published
    Abstract [en]

    We present a simple and efficient framework for automatic verification of systems with a parametric number of communicating processes. The processes may be organized in various topologies such as words, multisets, rings, or trees. Our method needs to inspect only a small number of processes in order to show correctness of the whole system. It relies on an abstraction function that views the system from the perspective of a fixed number of processes. The abstraction is used during the verification procedure in order to dynamically detect cut-off points beyond which the search of the state space need not continue. We show that the method is complete for a large class of well quasi-ordered systems including Petri nets. Our experimentation on a variety of benchmarks demonstrate that the method is highly efficient and that it works well even for classes of systems with undecidable verification problems. In particular, the method handles the fine-grained and full version of Szymanski's mutual exclusion protocol, whose correctness, to the best of our knowledge, has not been proven automatically by any other existing methods.

    Emneord
    Parameterized systems; Safety; Small model properties; View abstraction
    HSV kategori
    Identifikatorer
    urn:nbn:se:uu:diva-260089 (URN)10.1007/s10009-015-0406-x (DOI)000382011100003 ()
    Prosjekter
    UPMARC
    Tilgjengelig fra: 2015-11-23 Laget: 2015-08-15 Sist oppdatert: 2017-12-04bibliografisk kontrollert
  • 157.
    Haziza, Frédéric
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Biologiska sektionen, Institutionen för cell- och molekylärbiologi, Beräkningsbiologi och bioinformatik. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi.
    Holík, Lukás
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik. Brno Univ Technol, CS-61090 Brno, Czech Republic..
    Meyer, Roland
    Univ Kaiserslautern, D-67663 Kaiserslautern, Germany..
    Wolff, Sebastian
    Univ Kaiserslautern, D-67663 Kaiserslautern, Germany..
    Pointer Race Freedom2016Inngår i: Verification, Model Checking, And Abstract Interpretation, VMCAI 2016, Springer, 2016, s. 393-412Konferansepaper (Fagfellevurdert)
    Abstract [en]

    We propose a novel notion of pointer race for concurrent programs manipulating a shared heap. A pointer race is an access to a memory address which was freed, and it is out of the accessor's control whether or not the cell has been re-allocated. We establish two results. (1) Under the assumption of pointer race freedom, it is sound to verify a program running under explicit memory management as if it was running with garbage collection. (2) Even the requirement of pointer race freedom itself can be verified under the garbage-collected semantics. We then prove analogues of the theorems for a stronger notion of pointer race needed to cope with performance-critical code purposely using racy comparisons and even racy dereferences of pointers. As a practical contribution, we apply our results to optimize a thread-modular analysis under explicit memory management. Our experiments confirm a speedup of up to two orders of magnitude.

  • 158.
    Heintz, Fredrik
    et al.
    Linköpings Universitet.
    Mannila, Linda
    Linköpings Universitet.
    Nordén, Lars-Åke
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Parnes, Peter
    Luleå Tekniska Universitet.
    Regnell, Björn
    Lunds Universitet.
    Introducing Programming and Digital Competence in Swedish K–9 Education2017Inngår i: Informatics in Schools: Focus on Learning Programming, 2017Konferansepaper (Fagfellevurdert)
  • 159.
    Hermans, Frederik
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorarkitektur och datorkommunikation.
    McNamara, Liam
    Sörös, Gábor
    Rohner, Christian
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorarkitektur och datorkommunikation.
    Voigt, Thiemo
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorarkitektur och datorkommunikation.
    Ngai, Edith
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    FOCUS: Robust visual codes for everyone2016Inngår i: Proc. 14th International Conference on Mobile Systems, Applications, and Services, New York: ACM Press, 2016, s. 319-332Konferansepaper (Fagfellevurdert)
  • 160.
    Hojjat, Hossein
    et al.
    Rochester Institute of Technology, University of Tehran.
    Rümmer, Philipp
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    The Eldarica Horn Solver2018Inngår i: Formal Methods in Computer Aided Design, IEEE, 2018Konferansepaper (Fagfellevurdert)
  • 161.
    Hojjat, Hossein
    et al.
    Cornell Univ, Ithaca, NY 14853 USA..
    Rümmer, Philipp
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    McClurg, Jedidiah
    CU Boulder, Boulder, CO USA..
    Cerny, Pavol
    CU Boulder, Boulder, CO USA..
    Foster, Nate
    Cornell Univ, Ithaca, NY 14853 USA..
    Optimizing Horn Solvers for Network Repair2016Inngår i: Proceedings of the 2016 16Th Conference on Formal Methods In Computer-Aided Design (FMCAD 2016) / [ed] Piskac, R Talupur, M, IEEE , 2016, s. 73-80Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Automatic program repair modifies a faulty program to make it correct with respect to a specification. Previous approaches have typically been restricted to specific programming languages and a fixed set of syntactical mutation techniques-e.g., changing the conditions of if statements. We present a more general technique based on repairing sets of unsolvable Horn clauses. Working with Horn clauses enables repairing programs from many different source languages, but also introduces challenges, such as navigating the large space of possible repairs. We propose a conservative semantic repair technique that only removes incorrect behaviors and does not introduce new behaviors. Our proposed framework allows the user to request the best repairs-it constructs an optimization lattice representing the space of possible repairs, and uses a novel local search technique that exploits heuristics to avoid searching through sub-lattices with no feasible repairs. To illustrate the applicability of our approach, we apply it to problems in software-defined networking (SDN), and illustrate how it is able to help network operators fix buggy configurations by properly filtering undesired traffic. We show that interval and Boolean lattices are effective choices of optimization lattices in this domain, and we enable optimization objectives such as modifying the minimal number of switches. We have implemented a prototype repair tool, and present preliminary experimental results on several benchmarks using real topologies and realistic repair scenarios in data centers and congested networks.

  • 162.
    Holik, Lukas
    et al.
    Brno University of Technology, Czech Republic.
    Janku, Petr
    Brno University of Technology, Czech Republic.
    Lin, Anthony W.
    University of Oxford, United Kingdom.
    Rümmer, Philipp
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Vojnar, Tomas
    Brno University of Technology, Czech Republic.
    String constraints with concatenation and transducers solved efficiently2018Inngår i: Proceedings of the ACM on Programming Languages, E-ISSN 2475-1421, Vol. 2, s. 1-32, artikkel-id 4Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    String analysis is the problem of reasoning about how strings are manipulated by a program. It has numerous applications including automatic detection of cross-site scripting, and automatic test-case generation. A popular string analysis technique includes symbolic executions, which at their core use constraint solvers over the string domain, a.k.a. string solvers. Such solvers typically reason about constraints expressed in theories over strings with the concatenation operator as an atomic constraint. In recent years, researchers started to recognise the importance of incorporating the replace-all operator (i.e. replace all occurrences of a string by another string) and, more generally, finite-state transductions in the theories of strings with concatenation. Such string operations are typically crucial for reasoning about XSS vulnerabilities in web applications, especially for modelling sanitisation functions and implicit browser transductions (e.g. innerHTML). Although this results in an undecidable theory in general, it was recently shown that the straight-line fragment of the theory is decidable, and is sufficiently expressive in practice. In this paper, we provide the first string solver that can reason about constraints involving both concatenation and finite-state transductions. Moreover, it has a completeness and termination guarantee for several important fragments (e.g. straight-line fragment). The main challenge addressed in the paper is the prohibitive worst-case complexity of the theory (double-exponential time), which is exponentially harder than the case without finite-state transductions. To this end, we propose a method that exploits succinct alternating finite-state automata as concise symbolic representations of string constraints. In contrast to previous approaches using nondeterministic automata, alternation offers not only exponential savings in space when representing Boolean combinations of transducers, but also a possibility of succinct representation of otherwise costly combinations of transducers and concatenation. Reasoning about the emptiness of the AFA language requires a state-space exploration in an exponential-sized graph, for which we use model checking algorithms (e.g. IC3). We have implemented our algorithm and demonstrated its efficacy on benchmarks that are derived from cross-site scripting analysis and other examples in the literature.

  • 163. Holik, Lukás
    et al.
    Isberner, Malte
    Jonsson, Bengt
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Mediator synthesis in a component algebra with data2015Inngår i: Correct System Design, Springer, 2015, s. 238-259Konferansepaper (Fagfellevurdert)
    Abstract [en]

    We formulate a compositional specification theory for components that interact by directed synchronous communication actions. The theory is an extension of interface automata which is also able to capture both absence of deadlock as well as constraints on data parameters in interactions. We define refinement, parallel composition, and quotient. The quotient is an adjoint of parallel composition, and produces the most general component that makes the components cooperate to satisfy a given system specification. We show how these operations can be used to synthesize mediators that allow components in networked systems to interoperate. This is illustrated by application to the synthesis of mediators in e-commerce applications.

  • 164. Hu, Xiping
    et al.
    Chu, Terry H. S.
    Leung, Victor C. M.
    Ngai, Edith C.-H.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Kruchten, Philippe
    Chan, Henry C. B.
    A survey on mobile social networks: Applications, platforms, system architectures, and future research directions2015Inngår i: IEEE Communications Surveys and Tutorials, ISSN 1553-877X, E-ISSN 1553-877X, Vol. 17, nr 3, s. 1557-1581Artikkel, forskningsoversikt (Fagfellevurdert)
  • 165. Hu, Xiping
    et al.
    Deng, Junqi
    Zhao, Jidi
    Hu, Wenyan
    Ngai, Edith C.-H.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Wang, Renfei
    Shen, Johnny
    Liang, Min
    Li, Xitong
    Leung, Victor C. M.
    Kwok, Yu-Kwong
    SAfeDJ: A crowd-cloud codesign approach to situation-aware music delivery for drivers2015Inngår i: ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP), ISSN 1551-6857, E-ISSN 1551-6865, Vol. 12, nr 1s, s. 21:1-24, artikkel-id 21Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Driving is an integral part of our everyday lives, but it is also a time when people are uniquely vulnerable. Previous research has demonstrated that not only does listening to suitable music while driving not impair driving performance, but it could lead to an improved mood and a more relaxed body state, which could improve driving performance and promote safe driving significantly. In this article, we propose SAfeDJ, a smartphone-based situation-aware music recommendation system, which is designed to turn driving into a safe and enjoyable experience. SAfeDJ aims at helping drivers to diminish fatigue and negative emotion. Its design is based on novel interactive methods, which enable in-car smartphones to orchestrate multiple sources of sensing data and the drivers' social context, in collaboration with cloud computing to form a seamless crowdsensing solution. This solution enables different smartphones to collaboratively recommend preferable music to drivers according to each driver's specific situations in an automated and intelligent manner. Practical experiments of SAfeDJ have proved its effectiveness in music-mood analysis, and mood-fatigue detections of drivers with reasonable computation and communication overheads on smartphones. Also, our user studies have demonstrated that SAfeDJ helps to decrease fatigue degree and negative mood degree of drivers by 49.09% and 36.35%, respectively, compared to traditional smartphone-based music player under similar driving situations.

  • 166. Hu, Xiping
    et al.
    Li, Xitong
    Ngai, Edith C.-H.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Zhao, Jidi
    Leung, Victor C. M.
    Nasiopoulos, Panos
    Health Drive: Mobile healthcare onboard vehicles to promote safe driving2015Inngår i: Proc. 48th Hawaii International Conference on System Sciences, IEEE Computer Society, 2015, s. 3074-3083Konferansepaper (Fagfellevurdert)
  • 167.
    Hu, Xiping
    et al.
    Chinese Acad Sci, Shenzhen, Peoples R China.
    Ning, Zhaolong
    Dalian Univ Technol, Dalian, Peoples R China.
    Zhang, Kuan
    Univ Waterloo, Waterloo, ON, Canada.
    Ngai, Edith
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Bai, Kun
    Tencent Co, Shenzhen, Peoples R China.
    Wang, Fei
    Cornell Univ, Ithaca, NY USA.
    Crowdsourcing for Mobile Networks and IoT2018Inngår i: Wireless Communications & Mobile Computing, ISSN 1530-8669, E-ISSN 1530-8677, artikkel-id 6231236Artikkel i tidsskrift (Annet vitenskapelig)
  • 168.
    Huang, Weiwei
    et al.
    Sun Yat Sen Univ, Sch Data & Comp Sci, Guangzhou 510006, Guangdong, Peoples R China;Sun Yat Sen Univ, Guangdong Prov Key Lab Big Data Anal & Proc, Guangzhou 510006, Guangdong, Peoples R China.
    Zhou, Yipeng
    Macquarie Univ, Dept Comp, Fac Sci & Engn, Sydney, NSW 2109, Australia.
    Xie, Xueyan
    Sun Yat Sen Univ, Sch Data & Comp Sci, Guangzhou 510006, Guangdong, Peoples R China;Sun Yat Sen Univ, Guangdong Prov Key Lab Big Data Anal & Proc, Guangzhou 510006, Guangdong, Peoples R China.
    Wu, Di
    Sun Yat Sen Univ, Sch Data & Comp Sci, Guangzhou 510006, Guangdong, Peoples R China;Sun Yat Sen Univ, Guangdong Prov Key Lab Big Data Anal & Proc, Guangzhou 510006, Guangdong, Peoples R China.
    Chen, Min
    Huazhong Univ Sci & Technol, Sch Comp Sci & Technol, Wuhan 430074, Peoples R China;Huazhong Univ Sci & Technol, Wuhan Natl Lab Optoelect, Wuhan 430074, Peoples R China.
    Ngai, Edith
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik. Uppsala Univ, Dept Informat Technol, SE-75105 Uppsala, Sweden.
    Buffer State is Enough: Simplifying the Design of QoE-Aware HTTP Adaptive Video Streaming2018Inngår i: IEEE transactions on broadcasting, ISSN 0018-9316, E-ISSN 1557-9611, Vol. 64, nr 2, s. 590-601Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Recently, the prevalence of mobile devices together with the outburst of user-generated contents has fueled the tremendous growth of the Internet traffic taken by video streaming. To improve user-perceived quality-of-experience (QoE), dynamic adaptive streaming via HTTP (DASH) has been widely adopted by practical systems to make streaming smooth under limited bandwidth. However, previous DASH approaches mostly performed complicated rate adaptation based on bandwidth estimation, which has been proven to be unreliable over HTTP. In this paper, we simplify the design by only exploiting client-side buffer state information and propose a pure buffer-based DASH scheme to optimize user QoE. Our approach can not only get rid of the drawback caused by inaccurate bandwidth estimation, but also incur very limited overhead. We explicitly define an integrated user QoE model, which takes playback freezing, bitrate switch, and video quality into account, and then formulate the problem into a non-linear stochastic optimal control problem. Next, we utilize control theory to design a dynamic buffer-based controller for DASH, which determines video bitrate of each chunk to be requested and stabilize the buffer level in the meanwhile. Extensive experiments have been conducted to validate the advantages of our approach, and the results show that our approach can achieve the best performance compared with other alternative approaches.

  • 169.
    Huvila, Isto
    et al.
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Historisk-filosofiska fakulteten, Institutionen för ABM.
    Cajander, Åsa
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Bildanalys och människa-datorinteraktion.
    Daniels, Mats
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Åhlfeldt, Rose-Mharie
    Patients' perceptions of their medical records from different subject positions2015Inngår i: Journal of the Association for Information Science and Technology, ISSN 2330-1635, E-ISSN 2330-1643, Vol. 66, nr 12, s. 2456-2470Artikkel i tidsskrift (Fagfellevurdert)
  • 170.
    Huvila, Isto
    et al.
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Historisk-filosofiska fakulteten, Institutionen för ABM.
    Daniels, Mats
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Cajander, Åsa
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Bildanalys och människa-datorinteraktion.
    Åhlfeldt, Rose-Mharie
    Patients reading their medical records: Differences in experiences and attitudes between regular and inexperienced readers2016Inngår i: Information research, ISSN 1368-1613, E-ISSN 1368-1613, Vol. 21, nr 1, artikkel-id 706Artikkel i tidsskrift (Fagfellevurdert)
  • 171.
    Hylamia, Abdullah
    et al.
    KTH Royal Inst Technol, Stockholm, Sweden.
    Spanghero, Marco
    KTH Royal Inst Technol, Stockholm, Sweden.
    Varshney, Ambuj
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Voigt, Thiemo
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik. RISE SICS, Stockholm, Sweden.
    Papadimitratos, Panagiotis
    KTH Royal Inst Technol, Stockholm, Sweden.
    Demo: Security on Harvested Power2018Inngår i: WISEC'18: PROCEEDINGS OF THE 11TH ACM CONFERENCE ON SECURITY & PRIVACY IN WIRELESS AND MOBILE NETWORKS, ASSOC COMPUTING MACHINERY , 2018, s. 296-298Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Security mechanisms for battery-free devices have to operate under severe energy constraints relying on harvested energy. This is challenging, as the energy harvested from the ambient environment is usually scarce, intermittent and unpredictable. One of the challenges for developing security mechanisms for such settings is the lack of hardware platforms that recreate energy harvesting conditions experienced on a battery-free sensor node. In this demonstration, we present an energy harvesting security (EHS) platform that enables the development of security algorithms for battery-free sensors. Our results demonstrate that our platform is able to harvest sufficient energy from indoor lighting to support several widely used cryptography algorithms.

  • 172.
    Hylamia, Abdullah
    et al.
    KTH Royal Inst Technol, Stockholm, Sweden.
    Varshney, Ambuj
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Soleiman, Andreas
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Papadimitratos, Panagiotis
    KTH Royal Inst Technol, Stockholm, Sweden.
    Rohner, Christian
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Voigt, Thiemo
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik. RISE SICS, Stockholm, Sweden.
    Demo: Towards Battery-free Radio Tomographic Imaging2018Inngår i: WISEC'18: PROCEEDINGS OF THE 11TH ACM CONFERENCE ON SECURITY & PRIVACY IN WIRELESS AND MOBILE NETWORKS, ASSOC COMPUTING MACHINERY , 2018, s. 293-295Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Radio Tomographic Imaging (RTI) enables novel radio frequency (RF) sensing applications such as intrusion detection systems by observing variations in radio links caused by human actions. RTI applications are, however, severely limited by the requirement to retrofit existing infrastructure with energy-expensive sensors. In this demonstration, we present our ongoing efforts to develop the first battery-free RTI system that operates on minuscule amounts of energy harvested from the ambient environment. Our system eliminates the energy-expensive components employed on state-of-the-art RTI systems achieving two orders of magnitude lower power consumption. Battery-free operation enables a sustainable deployment, as RTI sensors could be deployed for long periods of time with little maintenance effort. Our demonstration showcases an intrusion detection scenario enabled by our system.

  • 173.
    Isbister, Tim
    et al.
    Swedish Def Res Agcy FOI, Stockholm, Sweden..
    Kaati, Lisa
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik. Swedish Def Res Agcy FOI, Stockholm, Sweden..
    Cohen, Katie
    Swedish Def Res Agcy FOI, Stockholm, Sweden..
    Gender Classification with Data Independent Features in Multiple Languages2017Inngår i: 2017 European Intelligence and Security Informatics Conference (EISIC) / [ed] Brynielsson, J, IEEE, 2017, s. 54-60Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Gender classification is a well-researched problem, and state-of-the-art implementations achieve an accuracy of over 85%. However, most previous work has focused on gender classification of texts written in the English language, and in many cases, the results cannot be transferred to different datasets since the features used to train the machine learning models are dependent on the data. In this work, we investigate the possibilities to classify the gender of an author on five different languages: English, Swedish, French, Spanish, and Russian. We use features of the word counting program Linguistic Inquiry and Word Count (LIWC) with the benefit that these features are independent of the dataset. Our results show that by using machine learning with features from LIWC, we can obtain an accuracy of 79% and 73% depending on the language. We also, show some interesting differences between the uses of certain categories among the genders in different languages.

  • 174. Isomöttönen, Ville
    et al.
    Daniels, Mats
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Cajander, Åsa
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Bildanalys och människa-datorinteraktion.
    Pears, Arnold
    McDermott, Roger
    Searching for global employability: Can students capitalize on enabling learning environments?2019Inngår i: ACM Transactions on Computing Education, ISSN 1946-6226, E-ISSN 1946-6226, Vol. 19, nr 2, s. 11:1-29, artikkel-id 11Artikkel i tidsskrift (Fagfellevurdert)
  • 175.
    Janzén, Johan
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorarkitektur och datorkommunikation. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Black-Schaffer, David
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorarkitektur och datorkommunikation.
    Hugo, Andra
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorarkitektur och datorkommunikation.
    Partitioning GPUs for Improved Scalability2016Inngår i: Proc. 28th International Symposium on Computer Architecture and High Performance Computing, IEEE Computer Society, 2016, s. 42-49Konferansepaper (Fagfellevurdert)
    Abstract [en]

    To port applications to GPUs, developers need to express computational tasks as highly parallel executions with tens of thousands of threads to fill the GPU's compute resources. However, while this will fill the GPU's resources, it does not necessarily deliver the best efficiency, as the task may scale poorly when run with sufficient parallelism to fill the GPU. In this work we investigate how we can improve throughput by co-scheduling poorly-scaling tasks on sub-partitions of the GPU to increase utilization efficiency. We first investigate the scalability of typical HPC tasks on GPUs, and then use this insight to improve throughput by extending the StarPU framework to co-schedule tasks on the GPU. We demonstrate that co-scheduling poorly-scaling GPU tasks accelerates the execution of the critical tasks of a Cholesky Factorization and improves the overall performance of the application by 9% across a wide range of block sizes.

  • 176.
    Jiang, Xu
    et al.
    Hong Kong Polytech Univ, Hong Kong, Hong Kong, Peoples R China.;Beihang Univ, Sch Comp Sci & Engn, State Key Lab Virtual Real Technol & Syst, Beijing, Peoples R China..
    Guan, Nan
    Hong Kong Polytech Univ, Hong Kong, Hong Kong, Peoples R China..
    Long, Xiang
    Beihang Univ, Sch Comp Sci & Engn, State Key Lab Virtual Real Technol & Syst, Beijing, Peoples R China..
    Yi, Wang
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik. Northeastern Univ, Shenyang, Liaoning, Peoples R China..
    Semi-Federated Scheduling of Parallel Real-Time Tasks on Multiprocessors2017Inngår i: 2017 IEEE Real-Time Systems Symposium (RTSS), IEEE, 2017, s. 80-91Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Federated scheduling is a promising approach to schedule parallel real-time tasks on multi-cores, where each heavy task exclusively executes on a number of dedicated processors, while light tasks are treated as sequential sporadic tasks and share the remaining processors. However, federated scheduling suffers resource waste since a heavy task with processing capacity requirement x + is an element of (where x is an integer and 0 < is an element of < 1) needs x+ 1 dedicated processors. In the extreme case, almost half of the processing capacity is wasted. In this paper we propose the semi-federate scheduling approach, which only grants x dedicated processors to a heavy task with processing capacity requirement x+ is an element of, and schedules the remaining is an element of part together with light tasks on shared processors. Experiments with randomly generated task sets show the semi-federated scheduling approach significantly outperforms not only federated scheduling, but also all existing approaches for scheduling parallel real-time tasks on multi-cores.

  • 177. Jin, Xi
    et al.
    Guan, Nan
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Wang, Jintao
    Zeng, Peng
    Analyzing multimode wireless sensor networks using the network calculus2015Inngår i: Journal of Sensors, ISSN 1687-725X, E-ISSN 1687-7268, Vol. 2015, s. 851608:1-12, artikkel-id 851608Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    The network calculus is a powerful tool to analyze the performance of wireless sensor networks. But the original network calculus can only model the single-mode wireless sensor network. In this paper, we combine the original network calculus with the multimode model to analyze the maximum delay bound of the flow of interest in the multimode wireless sensor network. There are two combined methods A-MM and N-MM. The method A-MM models the whole network as a multimode component, and the method N-MM models each node as a multimode component. We prove that the maximum delay bound computed by the method A-MM is tighter than or equal to that computed by the method N-MM. Experiments show that our proposed methods can significantly decrease the analytical delay bound comparing with the separate flow analysis method. For the large-scale wireless sensor network with 32 thousands of sensor nodes, our proposed methods can decrease about 70% of the analytical delay bound.

  • 178. Johansson, Fredrik
    et al.
    Kaati, Lisa
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Shrestha, Amendra
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Timeprints for identifying social media users with multiple aliases2015Inngår i: Security Informatics, ISSN 2190-8532, Vol. 4, s. 7:1-11, artikkel-id 7Artikkel i tidsskrift (Fagfellevurdert)
  • 179.
    Jonsson, Bengt
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    The Quest for Optimality in Stateless Model Checking of Concurrent Programs2018Inngår i: Formal Methods For Industrial Critical Systems, FMICS 2018 / [ed] Howar, F Barnat, J, Springer, 2018, s. XI-XIIKonferansepaper (Fagfellevurdert)
  • 180. Jónsson, Björn Þór
    et al.
    Lárusdóttir, Marta Kristín
    Daniels, Mats
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Clear, Alison
    Clear, Tony
    McDermott, Roger
    Aligning quality assurance at the course unit and educational program levels2016Inngår i: Proc. 46th ASEE/IEEE Frontiers in Education Conference, Piscataway, NJ: IEEE Press, 2016Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Quality assurance is a subject that has grown dramatically in importance in recent times. In previous work, we have described how the ACM Curricula can be used to support the Quality Assurance process of educational programs, using the Computer Science program at Reykjavik University as an example. Faculty members and employers of graduates participated in the process, that resulted in providing both detailed quantitative data and qualitative information. The assessment also raised awareness of how abstract topics and learning outcomes from an international standard can be used when revising the curricula of a particular course in a CS program. Quality assurance is indeed a continuous process, where the results of evaluations should be used to drive improvements. In this paper we focus on how a Database course was re-structured based on a recent quality assurance process.

  • 181.
    Kaati, Lisa
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Johansson, Fredrik
    Countering lone actor terrorism: Weak signals and online activities2016Inngår i: Understanding Lone Actor Terrorism: Past experience, future outlook, and response strategies, Abingdon, UK: Routledge, 2016, s. 266-279Kapittel i bok, del av antologi (Fagfellevurdert)
  • 182.
    Kaati, Lisa
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Johansson, Fredrik
    Forsman, Elinor
    Semantic technologies for detecting names of new drugs on darknets2016Inngår i: Proc. 4th International Conference on Cybercrime and Computer Forensics, IEEE, 2016Konferansepaper (Fagfellevurdert)
  • 183.
    Kaati, Lisa
    et al.
    FOI, Stockholm, Sweden..
    Lundeqvist, Elias
    FOI, Stockholm, Sweden..
    Shrestha, Amendra
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Svensson, Maria
    FOI, Stockholm, Sweden..
    Author Profiling in the Wild2017Inngår i: 2017 European Intelligence and Security Informatics Conference (EISIC) / [ed] Brynielsson, J, IEEE, 2017, s. 155-158Konferansepaper (Fagfellevurdert)
    Abstract [en]

    In this paper, we use machine learning for profiling authors of online textual media. We are interested in determining the gender and age of an author. We use two different approaches, one where the features are learned from raw data and one where features are manually extracted. We are interested in understanding how well author profiling works in the wild and therefore we have tested our models on different domains than they are trained on. Our results show that applying models to a different domain then they were trained on significantly decreases the performance of the models. The results show that more efforts need to be put into making models domain independent if techniques such as author profiling should be used operationally, for example by training on many different datasets and by using domain independent features.

  • 184.
    Kaati, Lisa
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Omer, Enghin
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Prucha, Nico
    ICSR, London, England.
    Shrestha, Amendra
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Detecting multipliers of jihadism on twitter2015Inngår i: Proc. 15th ICDM Workshops, IEEE Computer Society, 2015, s. 954-960Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Detecting terrorist related content on social media is a problem for law enforcement agency due to the large amount of information that is available. In this paper we describe a first step towards automatically classifying twitter user accounts (tweeps) as supporters of jihadist groups who disseminate propaganda content online. We use a machine learning approach with two set of features: data dependent features and data independent features. The data dependent features are features that are heavily influenced by the specific dataset while the data independent features are independent of the dataset and that can be used on other datasets with similar result. By using this approach we hope that our method can be used as a baseline to classify violent extremist content from different kind of sources since data dependent features from various domains can be added.

  • 185.
    Kaati, Lisa
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Shrestha, Amendra
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Cohen, Katie
    Linguistic analysis of lone offender manifestos2016Inngår i: Proc. 4th International Conference on Cybercrime and Computer Forensics, IEEE, 2016Konferansepaper (Fagfellevurdert)
  • 186.
    Kaati, Lisa
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Shrestha, Amendra
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Cohen, Katie
    Lindquist, Sinna
    Automatic detection of xenophobic narratives: A case study on Swedish alternative media2016Inngår i: Proc. 14th International Conference on Intelligence and Security Informatics, IEEE, 2016, s. 121-126Konferansepaper (Fagfellevurdert)
  • 187.
    Kaati, Lisa
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Shrestha, Amendra
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Sardella, Tony
    Washington Univ, St Louis, MO USA..
    Identifying Warning Behaviors of Violent Lone Offenders in Written Communication2016Inngår i: 2016 IEEE 16Th International Conference On Data Mining Workshops (ICDMW) / [ed] Domeniconi, C Gullo, F Bonchi, F DomingoFerrer, J BaezaYates, R Zhou, ZH Wu, X, New York: IEEE, 2016, s. 1053-1060Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Violent lone offenders such as school shooters and lone actor terrorists pose a threat to the modern society but since they act alone or with minimal help form others they are very difficult to detect. Previous research has shown that violent lone offenders show signs of certain psychological warning behaviors that can be viewed as indicators of an increasing or accelerating risk of committing targeted violence. In this work, we use a machine learning approach to identify potential violent lone offenders based on their written communication. The aim of this work is to capture psychological warning behaviors in written text and identify texts written by violent lone offenders. We use a set of features that are psychologically meaningful based on the different categories in the text analysis tool Linguistic Inquiry and Word Count (LIWC). Our study only contains a small number of known perpetrators and their written communication but the results are promising and there are many interesting directions for future work in this area.

  • 188.
    Kaati, Lisa
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Shrestha, Amendra
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Sardella, Tony
    Identifying warning behaviors of violent lone offenders in written communication2016Inngår i: Proc. 16th ICDM Workshops, IEEE Computer Society, 2016, s. 1053-1060Konferansepaper (Fagfellevurdert)
  • 189.
    Kahsai, Temesghen
    et al.
    Carnegie Mellon University, Silicon Valley; NASA Ames.
    Kersten, Rody
    Carnegie Mellon University, Silicon Valley.
    Rümmer, Philipp
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Schäf, Martin
    SRI International.
    Quantified heap invariants for object-oriented programs2017Inngår i: 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, 2017, s. 368-384Konferansepaper (Fagfellevurdert)
  • 190.
    Kahsai, Temesghen
    et al.
    Nasa Ames CMU, Moffett Field, CA USA.
    Rümmer, Philipp
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Sanchez, Huascar
    SRI Int, 333 Ravenswood Ave, Menlo Pk, CA 94025 USA.
    Schäf, Martin
    SRI Int, 333 Ravenswood Ave, Menlo Pk, CA 94025 USA.
    JayHorn: A framework for verifying Java programs2016Inngår i: Computer Aided Verification: Part I, Springer, 2016, s. 352-358Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Building a competitive program verifiers is becoming cheaper. On the front-end side, openly available compiler infrastructure and optimization frameworks take care of hairy problems such as alias analysis, and break down the subtleties of modern languages into a handful of simple instructions that need to be handled. On the back-end side, theorem provers start providing full-fledged model checking algorithms, such as PDR, that take care looping control-flow. In this spirit, we developed JayHorn, a verification framework for Java with the goal of having as few moving parts as possible. Most steps of the translation from Java into logic are implemented as bytecode transformations, with the implication that their soundness can be tested easily. From the transformed bytecode, we generate a set of constrained Horn clauses that are verified using state-of-the-art Horn solvers. We report on our implementation experience and evaluate JayHorn on benchmarks.

  • 191.
    Kaxiras, Stefanos
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Carlson, Trevor E.
    Natl Univ Singapore, Dept Comp Sci, Singapore, Singapore.
    Alipour, Mehdi
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Ros, Alberto
    Univ Murcia, Comp Engn Dept, Murcia, Spain.
    Non-Speculative Load Reordering in Total Store Ordering2018Inngår i: IEEE Micro, ISSN 0272-1732, E-ISSN 1937-4143, Vol. 38, nr 3, s. 48-57Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Load reordering is important for performance. It allows a core to continue performing accesses to the memory system even when there are older, in-program-order, unperformed accesses (for example, due to long latency misses). The only known solution to allow such reordering in a strong consistency model such as total store ordering (TSO) has been to reorder speculatively and squash-and-re-execute if caught. We show, for the first time, that we can do the load reordering non-speculatively and leave it to the coherence protocol to handle conflicts. We can do this efficiently (without perceptible hardware or performance cost) and without deadlocks or livelocks. The important new result is that we can now irrevocably bind speculative loads. Our solution allows us to commit reordered loads out of order without having to wait (for the loads to become non-speculative) or checkpoint committed state (and rollback if needed), just to ensure correctness in the rare case of another core seeing the reordering.

  • 192. Kinnunen, Päivi
    et al.
    Butler, Matthew
    Morgan, Michael
    Nylén, Aletta
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Peters, Anne-Kathrin
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Sinclair, Jane
    Kalvala, Sara
    Pesonen, Erkki
    Understanding initial undergraduate expectations and identity in computing studies2018Inngår i: European Journal of Engineering Education, ISSN 0304-3797, E-ISSN 1469-5898, Vol. 43, nr 2, s. 201-218Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    There is growing appreciation of the importance of understanding thestudent perspective in Higher Education (HE) at both institutional andinternational levels. This is particularly important in Science, Technology,Engineering and Mathematics subjects such as Computer Science (CS)and Engineering in which industry needs are high but so are studentdropout rates. An important factor to consider is the management ofstudents’initial expectations of university study and career. This paperreports on a study of CSfirst-year students’expectations across threeEuropean countries using qualitative data from student surveys andessays. Expectation is examined from both short-term (topics to bestudied) and long-term (career goals) perspectives. Tackling these issueswill help paint a picture of computing education through students’eyesand explore their vision of its and their role in society. It will also helpeducators prepare students more effectively for university study and toimprove the student experience.

  • 193.
    Klebanov, Vladimir
    et al.
    Karlsruhe Inst Technol, Inst Theoret Informat, Karlsruhe, Germany.
    Rümmer, Philipp
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Ulbrich, Mattias
    Karlsruhe Inst Technol, Inst Theoret Informat, Karlsruhe, Germany.
    Automating regression verification of pointer programs by predicate abstraction2018Inngår i: Formal methods in system design, ISSN 0925-9856, E-ISSN 1572-8102, Vol. 52, nr 3, s. 229-259Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Regression verification is an approach complementing regression testing with formal verification. The goal is to formally prove that two versions of a program behave either equally or differently in a precisely specified way. In this paper, we present a novel automated approach for regression verification that reduces the equivalence of two related imperative pointer programs to constrained Horn clauses over uninterpreted predicates. Subsequently, state-of-the-art SMT solvers are used to solve the clauses. We have implemented the approach, and our experiments show that non-trivial programs with integer and pointer arithmetic can now be proved equivalent without further user input.

  • 194.
    Krcal, Jan
    et al.
    Univ Saarland, Comp Sci, Saarbrucken, Germany..
    Krcal, Pavel
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik. Lloyds Register Consulting, Stockholm, Sweden..
    Scalable Analysis of Fault Trees with Dynamic Features2015Inngår i: 2015 45Th Annual IEEE/IFIP International Conference On Dependable Systems And Networks, 2015, s. 89-100Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Fault trees constitute one of the essential formalisms for static safety analysis of various industrial systems. Dynamic fault trees (DFT) enrich the formalism by time-dependent behavior, e.g., repairs or functional dependencies. Analysis of DFT is so far limited to substantially smaller models than those required for, e.g., nuclear power plants. We propose a fault tree formalism that combines both static and dynamic features, called SD fault trees. It gives the user the freedom to express each equipment failure either statically, without modeling temporal information, or dynamically, allowing repairs and other timed interdependencies. We introduce an analysis algorithm for an important subclass of SD fault trees. The algorithm (1) scales similarly to static algorithms and (2) allows for a more realistic analysis compared to static algorithms as it takes into account temporal interdependencies. Finally, we demonstrate the applicability of the method by an experimental evaluation on fault trees of nuclear power plants.

  • 195.
    Krzywda, Jakub
    et al.
    Umea Univ, Dept Comp Sci, SE-90187 Umea, Sweden..
    Ali-Eldin, Ahmed
    Umea Univ, Dept Comp Sci, SE-90187 Umea, Sweden..
    Carlson, Trevor E.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik. Natl Univ Singapore, Sch Comp, 13 Comp Dr, Singapore 117417, Singapore.
    Östberg, Per-Olov
    Umea Univ, Dept Comp Sci, SE-90187 Umea, Sweden..
    Elmroth, Erik
    Umea Univ, Dept Comp Sci, SE-90187 Umea, Sweden..
    Power-performance tradeoffs in data center servers: DVFS, CPU pinning, horizontal, and vertical scaling2018Inngår i: Future generations computer systems, ISSN 0167-739X, E-ISSN 1872-7115, Vol. 81, s. 114-128Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Dynamic Voltage and Frequency Scaling (DVFS), CPU pinning, horizontal, and vertical scaling, are four techniques that have been proposed as actuators to control the performance and energy consumption on data center servers. This work investigates the utility of these four actuators, and quantifies the power-performance tradeoffs associated with them. Using replicas of the German Wikipedia running on our local testbed, we perform a set of experiments to quantify the influence of DVFS, vertical and horizontal scaling, and CPU pinning on end-to-end response time (average and tail), throughput, and power consumption with different workloads. Results of the experiments show that DVFS rarely reduces the power consumption of underloaded servers by more than 5%, but it can be used to limit the maximal power consumption of a saturated server by up to 20% (at a cost of performance degradation). CPU pinning reduces the power consumption of underloaded server (by up to 7%) at the cost of performance degradation, which can be limited by choosing an appropriate CPU pinning scheme. Horizontal and vertical scaling improves both the average and tail response time, but the improvement is not proportional to the amount of resources added. The load balancing strategy has a big impact on the tail response time of horizontally scaled applications.

  • 196.
    Kumar, Rakesh
    et al.
    Norwegian Univ Sci & Technol NTNU, Trondheim, Norway.
    Alipour, Mehdi
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Black-Schaffer, David
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Freeway: Maximizing MLP for Slice-Out-of-Order Execution2019Inngår i: 2019 25th IEEE International Symposium On High Performance Computer Architecture (HPCA), IEEE, 2019, s. 558-569Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Exploiting memory level parallelism (MLP) is crucial to hide long memory and last level cache access latencies. While out-of-order (OoO) cores, and techniques building on them, are effective at exploiting MLP, they deliver poor energy efficiency due to their complex hardware and the resulting energy overheads. As energy efficiency becomes the prime design constraint, we investigate low complexity/energy mechanisms to exploit MLP. This work revisits slice-out-of-order (sOoO) cores as an energy efficient alternative to OoO cores for MLP exploitation. These cores construct slices of MLP generating instructions and execute them out-of-order with respect to the rest of instructions. However, the slices and the remaining instructions, by themselves, execute in-order. Though their energy overhead is low compared to full OoO cores, sOoO cores fall considerably behind in terms of MLP extraction. We observe that their dependence-oblivious inorder slice execution causes dependent slices to frequently block MLP generation. To boost MLP generation in sOoO cores, we introduce Freeway, a sOoO core based on a new dependence-aware slice execution policy that tracks dependent slices and keeps them out of the way of MLP extraction. The proposed core incurs minimal area and power overheads, yet approaches the MLP benefits of fully OoO cores. Our evaluation shows that Freeway outperforms the state-of-the-art sOoO core by 12% and is within 7% of the MLP limits of full OoO execution.

  • 197.
    Kumar, Rakesh
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik. Univ Edinburgh, Edinburgh, Midlothian, Scotland.
    Grot, Boris
    Univ Edinburgh, Edinburgh, Midlothian, Scotland.
    Nagarajan, Vijay
    Univ Edinburgh, Edinburgh, Midlothian, Scotland.
    Blasting Through The Front-End Bottleneck With Shotgun2018Inngår i: ACM Sigplan Notices, 2018, Vol. 53, nr 2, s. 30-42Konferansepaper (Fagfellevurdert)
    Abstract [en]

    The front-end bottleneck is a well-established problem in server workloads owing to their deep software stacks and large instruction working sets. Despite years of research into effective L1-I and BTB prefetching, state-of-the-art techniques force a trade-off between performance and metadata storage costs. This work introduces Shotgun, a BTB-directed front-end prefetcher powered by a new BTB organization that maintains a logical map of an application's instruction footprint, which enables high-efficacy prefetching at low storage cost. To map active code regions, Shotgun precisely tracks an application's global control flow (e.g., function and trap routine entry points) and summarizes local control flow within each code region. Because the local control flow enjoys high spatial locality, with most functions comprised of a handful of instruction cache blocks, it lends itself to a compact region-based encoding. Meanwhile, the global control flow is naturally captured by the application's unconditional branch working set (calls, returns, traps). Based on these insights, Shotgun devotes the bulk of its BTB capacity to branches responsible for the global control flow and a spatial encoding of their target regions. By effectively capturing a map of the application's instruction footprint in the BTB, Shotgun enables highly effective BTB-directed prefetching. Using a storage budget equivalent to a conventional BTB, Shotgun outperforms the state-of-the-art BTB-directed front-end prefetcher by up to 14% on a set of varied commercial workloads.

  • 198.
    Lampka, Kai
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Bondorf, Steffen
    TU Kaiserslautern, Kaiserslautern, Germany..
    Schmitt, Jens
    TU Kaiserslautern, Kaiserslautern, Germany..
    Achieving Efficiency Without Sacrificing Model Accuracy: Network Calculus on Compact Domains2016Inngår i: 2016 IEEE 24Th International Symposium On Modeling, Analysis And Simulation Of Computer And Telecommunication Systems (MASCOTS), 2016, s. 313-318Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Messages traversing a network commonly experience waiting times due to sharing the forwarding resources. During those times, the crossed systems must provide sufficient buffer space for queueing messages. Network Calculus (NC) is a mathematical methodology for bounding flow delays and system buffer requirements. The accuracy of these performance bounds depends mainly on two factors: the principles manifesting in the NC flow equation and the functions describing the system. We focus on the latter aspect. Common implementations of NC overapproximate these functions in order to keep the analysis computationally feasible. However, overapproximation often results in a loss of accuracy of the performance bounds. In this paper, we make such compromising tradeoffs between model accuracy and computational effort obsolete. We limit the accurate system description to functions of a compact domain, such that the accuracy of the NC analysis is preserved. Tying the domain bound to the algebraic operators of NC instead of the operational semantics of components, allows us to directly apply our solution to algebraic NC analyses that implement principles such as pay burst only once and pay multiplexing only once.

  • 199.
    Lampka, Kai
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik. Elektrobit Automot, Erlangen, Germany..
    Bondorf, Steffen
    Univ Kaiserslautern, Distributed Comp Syst DISCO Lab, Kaiserslautern, Germany..
    Schmitt, Jens B.
    Univ Kaiserslautern, Distributed Comp Syst DISCO Lab, Kaiserslautern, Germany..
    Guan, Nan
    Hong Kong Polytech Univ, Dept Comp, Hong Kong, Hong Kong, Peoples R China..
    Wang, Yi
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Generalized Finitary Real-Time Calculus2017Inngår i: IEEE INFOCOM 2017 - IEEE Conference on Computer Communications, IEEE, 2017Konferansepaper (Annet vitenskapelig)
    Abstract [en]

    Real-time Calculus (RTC) is a non-stochastic queuing theory to the worst-case performance analysis of distributed real-time systems. Workload as well as resources are modelled as piece-wise linear, pseudo-periodic curves and the system under investigation is modelled as a sequence of algebraic operations over these curves. The memory footprint of computed curves increases exponentially with the sequence of operations and RTC may become computationally infeasible fast. Recently, Finitary RTC has been proposed to counteract this problem. Finitary RTC restricts curves to finite input domains and thereby counteracts the memory demand explosion seen with pseudo periodic curves of common RTC implementations. However, the proof to the correctness of Finitary RTC specifically exploits the operational semantic of the greed processing component (GPC) model and is tied to the maximum busy window size. This is an inherent limitation, which prevents a straight-forward generalization. In this paper, we provide a generalized Finitary RTC that abstracts from the operational semantic of a specific component model and reduces the finite input domains of curves even further. The novel approach allows for faster computations and the extension of the Finitary RTC idea to a much wider range of RTC models.

  • 200.
    Lampka, Kai
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Forsberg, Björn
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Keep it slow and in time: Online DVFS with hard real-time workloads2016Inngår i: Proc. 19th Conference on Design, Automation and Test in Europe, Piscataway, NJ: IEEE , 2016, s. 385-390Konferansepaper (Fagfellevurdert)
    Abstract [en]

    To handle hot spots or power shortages, modern multicore processors are equipped with a supervisory dynamic thermal and power management (DTPM) system. When necessary, the DTPM system autonomously adapts the capacity of the cooling system or throttles the speed of core-local clocks via dynamic voltage and frequency scaling (DVFS) techniques. Opposed to best-effort scenarios, online DVFS with real-time workloads also needs to consider completion times of computations. Whereas execution times can be bounded adequately with worst-case estimates, arrival times of computation requests are potentially unknown. A deadline for completing a computation can easily be missed, if workloads suddenly peak and past clock speed assignments have built-up a non-negligible backlog of computations. To overcome this problem, we introduce an online DVFS management scheme which is history-aware. It operates a core at higher speed levels only if the future workload has the potential to result in timing violations, if not anticipated by rising clock speed assignments. We present an implementation of the scheme running on the GemS hardware simulator.

1234567 151 - 200 of 363
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf