liu.seSearch for publications in DiVA
Endre søk
Begrens søket
11121314 651 - 673 of 673
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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.
  • 651.
    Wilander, John
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Contributions to Specification, Implementation, and Execution of Secure Software2013Doktoravhandling, med artikler (Annet vitenskapelig)
    Abstract [en]

    This thesis contributes to three research areas in software security, namely security requirements and intrusion prevention via static analysis and runtime detection.

    We have investigated current practice in security requirements by doing a field study of eleven requirement specifications on IT systems. The conclusion is that security requirements are poorly specified due to three things:  inconsistency in the selection of requirements, inconsistency in level of detail, and almost no requirements on standard security solutions. A follow-up interview study addressed the reasons for the inconsistencies and the impact of poor security requirements. It shows that the projects had relied heavily on in-house security competence and that mature producers of software compensate for poor requirements in general but not in the case of security and privacy requirements specific to the customer domain.

    Further, we have investigated the effectiveness of five publicly available static analysis tools for security. The test results show high rates of false positives for the tools building on lexical analysis and low rates of true positives for the tools building on syntactical and semantical analysis. As a first step toward a more effective and generic solution we propose decorated dependence graphs as a way of modeling and pattern matching security properties of code. The models can be used to characterize both good and bad programming practice as well as visually explain code properties to programmers. We have implemented a prototype tool that demonstrates how such models can be used to detect integer input validation flaws.

    Finally, we investigated the effectiveness of publicly available tools for runtime prevention of buffer overflow attacks. Our initial comparison showed that the best tool as of 2003 was effective against only 50 % of the attacks and there were six attack forms which none of the tools could handle. A follow-up study includes the release of a buffer overflow testbed which covers 850 attack forms. Our evaluation results show that the most popular, publicly available countermeasures cannot prevent all of these buffer overflow attack forms.

    Delarbeid
    1. Security Requirements---A Field Study of Current Practice
    Åpne denne publikasjonen i ny fane eller vindu >>Security Requirements---A Field Study of Current Practice
    2005 (engelsk)Inngår i: Symposium on Requirements Engineering for Information Security,2005, 2005Konferansepaper, Publicerat paper (Fagfellevurdert)
    Abstract [en]

    The number of security flaws in software is a costly problem. In 2004 more than ten new security vulnerabilities were found in commercial and open source software every day. More accurate and consistent security requirements could be a driving force towards more secure software. In a field study of eleven software projects including e-business, health care and military applications we have documented current practice in security requirements. The overall conclusion is that security requirements are poorly specified due to three things: inconsistency in the selection of requirements, inconsistency in level of detail, and almost no requirements on standard security solutions. We show how the requirements could have been enhanced by using the ISO/IEC standard for security management.

    Emneord
    security requirements, requirements engineering, public procurement
    HSV kategori
    Identifikatorer
    urn:nbn:se:liu:diva-29496 (URN)14851 (Lokal ID)14851 (Arkivnummer)14851 (OAI)
    Konferanse
    13th IEEE International Requirements Engineering Conference, August 29th-September 2nd, Paris, France
    Tilgjengelig fra: 2009-10-09 Laget: 2009-10-09 Sist oppdatert: 2018-01-13bibliografisk kontrollert
    2. The Impact of Neglecting Domain-Specific Security and Privacy Requirements
    Åpne denne publikasjonen i ny fane eller vindu >>The Impact of Neglecting Domain-Specific Security and Privacy Requirements
    2007 (engelsk)Inngår i: Proceedings of the 12th Nordic Workshop on Secure IT Systems (Nordsec 2007), 2007Konferansepaper, Publicerat paper (Annet vitenskapelig)
    Abstract [en]

    In a previous field study of eleven software projects including e-business, health care and military applications we documented current practice in security requirements. The overall conclusion of the study was that security requirements are poorly and inconsistently specified. However, two important questions remained open; what are the reasons for the inconsistencies, and what is the impact of such poor security requirements? In this paper we seek the answers by performing in-depth interviews with three of the customers from the previous study. The interviews show that mature producers of software (in this case IBM, Cap Gemini, and WM-Data) compensate for poor requirements in areas within their expertise, namely software engineering. But in the case of security and privacy requirements specific to the customer domain, such compensation is not found. In all three cases this has led to security and/or privacy flaws in the systems. Our conclusion is that special focus needs to be put on domain-specific security and privacy needs when eliciting customer requirements.

    Emneord
    security and privacy requirements, requirements engineering
    HSV kategori
    Identifikatorer
    urn:nbn:se:liu:diva-90026 (URN)
    Konferanse
    The 12th Nordic Workshop on Secure IT Systems (Nordsec 2007), October 11-12, 2007, Reykjavik, Iceland
    Tilgjengelig fra: 2013-03-15 Laget: 2013-03-15 Sist oppdatert: 2018-01-11
    3. A Comparison of Publicly Available Tools for Static Intrusion Prevention
    Åpne denne publikasjonen i ny fane eller vindu >>A Comparison of Publicly Available Tools for Static Intrusion Prevention
    2002 (engelsk)Inngår i: Nordic Workshop on Secure IT Systems NordSec,2002, Karlstad, Sweden: Karlstad University Studies , 2002, s. 68-Konferansepaper, Publicerat paper (Fagfellevurdert)
    Abstract [en]

    The size and complexity of today's software systems is growing, increasing the number of bugs and thus the possibility of security vulnerabilities. Two common attacks against such vulnerabilities are buffer overflow and format string attacks. In this paper we implement a testbed of 44 function calls in C to empirically compare five publicly available tools for static analysis aiming to stop these attacks. The results show very high rates of false positives for the tools building on lexical analysis and very low rates of true positives for the tools building on syntactical and semantical analysis.

    sted, utgiver, år, opplag, sider
    Karlstad, Sweden: Karlstad University Studies, 2002
    Emneord
    Security intrusions, intrusion prevention, static analysis, security testing, bu↵er overflow, format string attack
    HSV kategori
    Identifikatorer
    urn:nbn:se:liu:diva-29494 (URN)14849 (Lokal ID)14849 (Arkivnummer)14849 (OAI)
    Konferanse
    7th Nordic Workshop on Secure IT Systems, "Towards Secure and Privacy-Enhanced Systems", 7-8 November 2002, Karlstad University, Sweden
    Tilgjengelig fra: 2009-10-09 Laget: 2009-10-09 Sist oppdatert: 2018-01-13bibliografisk kontrollert
    4. Modeling and Visualizing Security Properties of Code using Dependence Graphs
    Åpne denne publikasjonen i ny fane eller vindu >>Modeling and Visualizing Security Properties of Code using Dependence Graphs
    2005 (engelsk)Konferansepaper, Publicerat paper (Annet vitenskapelig)
    Abstract [en]

    In this paper we discuss the problem of modeling security properties, including what we call the dual modeling problem, and ranking of potential vulnerabilities. The discussion is based on the results of a brief survey of eight existing static analysis tools and our own experience. We propose dependence graphs decorated with type and range information as a generic way of modeling security properties of code. These models can be used to characterize both good and bad programming practice as shown by our examples. They can also be used to visually explain code properties to the programmer. Finally, they can be used for pattern matching in static security analysis of code.

    Emneord
    Security properties; dependence graphs; static analysis
    HSV kategori
    Identifikatorer
    urn:nbn:se:liu:diva-90027 (URN)
    Konferanse
    Fifth Conference on Software Engineering Research and Practice in Sweden, October 2o-21, 2005, Västerås, Sweden
    Tilgjengelig fra: 2013-03-15 Laget: 2013-03-15 Sist oppdatert: 2018-01-11bibliografisk kontrollert
    5. Pattern Matching Security Properties of Code using Dependence Graphs
    Åpne denne publikasjonen i ny fane eller vindu >>Pattern Matching Security Properties of Code using Dependence Graphs
    2005 (engelsk)Konferansepaper, Publicerat paper (Annet vitenskapelig)
    Abstract [en]

    In recent years researchers have presented several tools for statically checking security properties of C code. But they all (currently) focus on one or two categories of security properties each. We have proposed dependencegraphs decorated with type-cast and range information as a more generic formalism allowing both for visual communication with the programmer and static analysis checking several security properties at once. Our prototype tool GraphMatch currently checks code for input validation flaws. But several research questions are still open. Most importantly we need to address the complexity of our algorithm for pattern matching graphs, the accuracy of our security models, and the generality of our formalism. Other questions regard the impact of security property visualization and heuristics for ranking of potential flaws found.

    Emneord
    Security properties; dependence graphs; static analysis
    HSV kategori
    Identifikatorer
    urn:nbn:se:liu:diva-90028 (URN)
    Konferanse
    1st International Workshop on Code Based Software Security Assessments (CoBaSSA 2005), Pittsburgh, Pennsylvania, USA, November 7, 2005
    Tilgjengelig fra: 2013-03-15 Laget: 2013-03-15 Sist oppdatert: 2018-01-11bibliografisk kontrollert
    6. A Comparison of Publicly Available Tools for Dynamic Buffer Overflow Prevention
    Åpne denne publikasjonen i ny fane eller vindu >>A Comparison of Publicly Available Tools for Dynamic Buffer Overflow Prevention
    2003 (engelsk)Inngår i: Proceedings of the 10th Network and Distributed System Security Symposium, 2003, Reston, Virginia, USA: Internet Society , 2003, s. 149-Konferansepaper, Publicerat paper (Fagfellevurdert)
    Abstract [en]

    The size and complexity of software systems is growing, increasing the number of bugs. Many of these bugs constitute security vulnerabilities. Most common of these bugs is the buffer overflow vulnerability. In this paper we implement a testbed of 20 different buffer overflow attacks, and use it to compare four publicly available tools for dynamic intrusion prevention aiming to stop buffer overflows. The tools are compared empirically and theoretically. The best tool is effective against only 50% of the attacks and there are six attack forms which none of the tools can handle.

    sted, utgiver, år, opplag, sider
    Reston, Virginia, USA: Internet Society, 2003
    Emneord
    Security intrusion; buffer overflow; intrusion prevention; dynamic analysis
    HSV kategori
    Identifikatorer
    urn:nbn:se:liu:diva-29495 (URN)14850 (Lokal ID)14850 (Arkivnummer)14850 (OAI)
    Konferanse
    The 10th Network & Distributed System Security Symposium 2003 (NDSS), San Diego, California, USA
    Tilgjengelig fra: 2009-10-09 Laget: 2009-10-09 Sist oppdatert: 2018-01-13bibliografisk kontrollert
    7. RIPE: Runtime Intrusion Prevention Evaluator
    Åpne denne publikasjonen i ny fane eller vindu >>RIPE: Runtime Intrusion Prevention Evaluator
    Vise andre…
    2011 (engelsk)Inngår i: Proceedings of the 27th Annual Computer Security Applications Conference, 2011, s. 41-50Konferansepaper, Publicerat paper (Annet vitenskapelig)
    Abstract [en]

    Despite the plethora of research done in code injection countermeasures, buffer overflows still plague modern software. In 2003, Wilander and Kamkar published a comparative evaluation on runtime buffer overflow prevention technologies using a testbed of 20 attack forms and demonstrated that the best prevention tool missed 50% of the attack forms. Since then, many new prevention tools have been presented using that testbed to show that they performed better, not missing any of the attack forms. At the same time though, there have been major developments in the ways of buffer overflow exploitation.

    In this paper we present RIPE, an extension of Wilander's and Kamkar's testbed which covers 850 attack forms. The main purpose of RIPE is to provide a standard way of testing the coverage of a defense mechanism against buffer overflows. In order to test RIPE we use it to empirically evaluate some of the newer prevention techniques. Our results show that the most popular, publicly available countermeasures cannot prevent all of RIPE's buffer overflow attack forms. ProPolice misses 60%, LibsafePlus+TIED misses 23%, CRED misses 21%, and Ubuntu 9.10 with nonexecutable memory and stack protection misses 11%.

    Emneord
    Security intrusion; buffer overflow; intrusion prevention; dynamic analysis
    HSV kategori
    Identifikatorer
    urn:nbn:se:liu:diva-90030 (URN)10.1145/2076732.2076739 (DOI)978-1-4503-0672-0 (ISBN)
    Konferanse
    27th Annual Computer Security Applications Conference (ACSAC 2011), December 5-9, Orlando, Florida, USA
    Tilgjengelig fra: 2013-03-15 Laget: 2013-03-15 Sist oppdatert: 2018-01-11bibliografisk kontrollert
  • 652.
    Wrona, Michal
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Local-to-Global Consistency Implies Tractability of Abduction2014Konferansepaper (Fagfellevurdert)
  • 653.
    Wrona, Michal
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Syntactically Characterizing Local-to-Global Consistency in ORD-Horn2012Konferansepaper (Annet vitenskapelig)
    Abstract [en]

    Establishing local consistency is one of the most frequently used algorithmic techniques in constraint satisfaction in general and in spatial and temporal reasoning in particular. A collection of constraints is globally consistent if it is completely explicit, that is, every partial solution may be extended to a full solution by greedily assigning values to variables one at a time. We will say that a structure B has local-to-global consistency if establishing local-consistency yields a globally consistent instance of CSP(B) .

    This paper studies local-to-global consistency for ORD-Horn languages, that is, structures definable over the ordered rationals (ℚ; < ) within the formalism of ORD-Horn clauses. This formalism has attracted a lot of attention and is of crucial importance to spatial and temporal reasoning. We provide a syntactic characterization (in terms of first-order definability) of all ORD-Horn languages enjoying local-to-global consistency.

  • 654.
    Wrona, Michal
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Tractability Frontier for Dually-Closed Ord-Horn Quantified Constraint Satisfaction Problems2014Inngår i: MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2014, PT I, Springer Berlin/Heidelberg, 2014, Vol. 8634, s. 535-546Konferansepaper (Fagfellevurdert)
    Abstract [en]

    A temporal constraint language is a relational structure with a first-order definition in the rational numbers with the order. We study here the complexity of the Quantified Constraint Satisfaction Problem (QCSP) for Ord-Horn languages: probably the most widely studied family of all temporal constraint languages.

    We restrict ourselves to a natural subclass that we call dually-closed Ord-Horn languages. The main result of the paper states that the QCSP for a dually-closed Ord-Horn language is either in P or it is coNP-hard.

  • 655.
    Xu, Yang
    et al.
    Lund University, Sweden.
    Årzen, Karl-Erik
    Lund University, Sweden.
    Cervin, Anton
    Lund University, Sweden.
    Bini, Enrico
    Scuola Superiore Sant’Anna, Italy.
    Tanasa, Bogdan
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Exploiting Job Response-Time Information in the Co-Design of Real-Time Control Systems2015Inngår i: 2015 IEEE 21ST INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS, Institute of Electrical and Electronics Engineers (IEEE), 2015, s. 247-256Konferansepaper (Fagfellevurdert)
    Abstract [en]

    We consider a real-time system of multiple tasks, each task having a plant to control. The overall quadratic control cost is to be optimized. We exploit the periodicity of the task response time, which corresponds to a periodic delay pattern in the feedback control loop. Perturbed periods are used as a tool to find a finite hyper period. We present an analytical procedure to design a periodic linear-quadratic-Gaussian (LQG) controller for tasks with fixed execution times as well as a numerical solution to the periodic -- stochastic LQG problem for tasks with variable execution times. The controllers are evaluated using simulations in real-time scheduling and control co-design examples.

  • 656.
    Yang, Ming-Jie
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system.
    Design and Implementation of a Compiler for an XML-based Hardware Description Language to Support Energy Optimization2017Independent thesis Advanced level (degree of Master (Two Years)), 20 poäng / 30 hpOppgave
    Abstract [en]

    GPU-based heterogeneous system architectures are popular as they combine the advantages of CPU with the benefits of GPU. Development of high-performance and power-efficient software for heterogeneous system architecture needs to take both hardware and software specifications into consideration, which leads the software development process to be more complicated. To simplify the software development process, Architecture Description Languages (ADLs) came out. By modeling the target architecture components into structural formats, programmers can adapt their software to the platforms which they used.

    XPDL is a modular and extensible XML-based platform description language which is mainly designed to support optimization.The purposes of this thesis are to design the query API (Application Programming Interface) and develop a compiler which translates the XPDL descriptors to libraries that implement the API to support programmers for the development of adaptive high-performance and energy-optimized software.

    In this thesis, we design and develop a compiler to generate the API according to the XPDL descriptors.The main workflow of the designed compiler is following: first, the toolchain validates the XPDL descriptors against XSDs. Second, it parses the descriptors into DOM trees and transforms them into XPDL model trees. Next, the compiler links all XPDL model trees together, which results in the intermediate representation (IR). Then, any unspecified node values which means the unknown attributes, are handled by microbenchmark generator and executor. In the end, the code generator generates the libraries which expose the API according to the information in the IR. Finally, a few example codes are discussed to show how the API can be used to develop performance adaptive applications on heterogeneous systems.

  • 657.
    Yildiz, George
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system.
    Wallström, Fredrik
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system.
    Evaluation of Couchbase As a Tool to Solve a Scalability Problem with Shared Geographical Objects2019Independent thesis Advanced level (degree of Master (Two Years)), 20 poäng / 30 hpOppgave
    Abstract [en]

    Sharing a large amount of data between many mobile devices can lead to scalability problems. One of these scalability problems is that the data becomes too large to store on mobile devices and that many updates are sent to each device. In this thesis, Couchbase is evaluated as a tool to solve this problem where the data has a geographical position. The scalability problem is solved by partitioning the data with the help of Couchbase channels and Google’s tile-based mapping system. Synchronising and storing only data of interest for each user has been in focus. The result showed that it was effective to use a Couchbase solution together with Google’s tile-based mapping system to reduce the amount of data that was required to be stored for each user. It was shown to be more effective to store objects encoded as base64 data instead of their binary data representation for the data set used in this study. The reason for this is because Couchbase stores Binary Large Objects (BLOBs) as separate files and the BLOBs in the data set had much smaller file size than what the disk sector size was. A test to find how the synchronisation time was affected by the number of channels was conducted. It showed that the synchronisation time increased linearly with an increasing number of channels when the objects were stored in separate files. When the objects were encoded as base64 data, the number of channels used had a minor effect on the synchronisation time. The conclusion is that the approach presented in this study has been effective. However, the results are data dependent and therefore it is recommended to rerun similar tests in order to decide the number of channels to use when partitioning the data.

  • 658.
    Zadegan, Farrokh Ghani
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Carlsson, Gunnar
    Ericsson, Linköping, Sweden.
    Larsson, Erik
    Lund University, Sweden.
    Scenario-Based Network Design for P16872013Inngår i: SSoCC'13, 2013Konferansepaper (Annet vitenskapelig)
    Abstract [en]

    To improve testability of integrated circuits against manufacturing defects, and to better handle the complexity of modern designs during debugging and characterization, it is common to embed testing, debugging, configuration, and monitoring features (called on-chip instruments) within the chip. IEEE P1687 proposes a flexible network for accessing and operating such on-chip instruments from outside the chip, and facilitates reusing instrument access procedures in different usage scenarios throughout the chip's life-cycle-spanning from chip prototyping to in-field test. Efficient access (in terms of time) to on-chip instruments requires careful design of the instrument access network. However, it is shown that a network optimized for one usage scenario, is not necessarily efficient in other scenarios. To address the problem of designing a network which is efficient in terms of instrument access time under multiple scenarios, in this work, we compare a number of network design approaches provided by P1687, in terms of instrument access time and hardware overhead.

  • 659.
    Zadegan, Farrokh Ghani
    et al.
    Linköpings universitet, Institutionen för datavetenskap, ESLAB - Laboratoriet för inbyggda system. Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Ingelsson, Urban
    Linköpings universitet, Institutionen för datavetenskap, ESLAB - Laboratoriet för inbyggda system.
    Asani, Golnaz
    Linköpings universitet, Institutionen för datavetenskap, ESLAB - Laboratoriet för inbyggda system.
    Carlsson, Gunnar
    Ericsson, Linköping, Sweden.
    Larsson, Erik
    Linköpings universitet, Institutionen för datavetenskap, ESLAB - Laboratoriet för inbyggda system.
    Test Scheduling in an IEEE P1687 Environment with Resource and Power Constraints2011Inngår i: Proceedings of the Asian Test Symposium, IEEE , 2011, s. 525-531Konferansepaper (Fagfellevurdert)
    Abstract [en]

    In contrast to IEEE 1149.1, IEEE P1687 allows, through segment insertion bits, flexible scan paths for accessing on-chip instruments, such as test, debug, monitoring, measurement and configuration features. Flexible access to embedded instruments allows test time reduction, which is important at production test. However, the test access scheme should be carefully selected such that resource constraints are not violated and power constraints are met. For IEEE P1687, we detail in this paper session-based and session-less test scheduling, and propose resource and power-aware test scheduling algorithms for the detailed scheduling types. Results using the implementation of our algorithms shows on ITC’02-based benchmarks significant test time reductions when compared to non-optimized test schedules.

  • 660.
    Zadegan, Farrokh Ghani
    et al.
    Linköpings universitet, Institutionen för datavetenskap, ESLAB - Laboratoriet för inbyggda system. Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Ingelsson, Urban
    Linköpings universitet, Institutionen för datavetenskap, ESLAB - Laboratoriet för inbyggda system.
    Carlsson, Gunnar
    Ericsson, Linköping, Sweden.
    Larsson, Erik
    Linköpings universitet, Institutionen för datavetenskap, ESLAB - Laboratoriet för inbyggda system.
    Automated Design for IEEE P16872011Inngår i: The 11th Swedish System-on-Chip Conference, Varberg, Sweden, May 2-3, 2011., 2011Konferansepaper (Annet vitenskapelig)
  • 661.
    Zeng, Haibo
    et al.
    Department of Electrical and Computer Engineering, Virginia Tech, Blacksburg, USA.
    Joshi, Prachi
    Department of Electrical and Computer Engineering, Virginia Tech, USA.
    Thiele, Daniel
    Elektrobit Automotive GmbH, Germany.
    Diemer, Jonas
    Symtavision, Braunschweig, Germany.
    Axer, Philip
    NXP Semiconductors, Hamburg, Germany.
    Ernst, Rolf
    Institut für Datentechnik und Kommunikationsnetze, Technische Universität Braunschweig, Germany.
    Eles, Petru
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Networked Real-Time Embedded Systems2017Inngår i: Handbook of Hardware/Software Codesign / [ed] Soonhoi Ha and Jürgen Teich, Dordrecht: Springer, 2017, s. 753-792Kapittel i bok, del av antologi (Fagfellevurdert)
    Abstract [en]

    This chapter gives an overview on various real-time communication protocols, from the Controller Area Network (CAN) that was standardized over twenty years ago but is still popular, to the FlexRay protocol that provides strong predictability and fault tolerance, to the more recent Ethernet-based networks. The design of these protocols including their messaging mechanisms was driven by diversified requirements on bandwidth, real-time predictability, reliability, cost, etc. The chapter provides three examples of real-time communication protocols: CAN as an example of event-triggered communication, FlexRay as a heterogeneous protocol supporting both time-triggered and event-triggered communications, and different incarnations of Ethernet that provide desired temporal guarantees.

  • 662.
    Zhan, Jinyu
    et al.
    Univ Elect Sci and Technol China, Peoples R China.
    Zhang, Xia
    Univ Texas Dallas, TX 75083 USA.
    Jiang, Wei
    Univ Elect Sci and Technol China, Peoples R China.
    Ma, Yue
    Univ Notre Dame, IN 46556 USA.
    Jiang, Ke
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Energy optimization of security-sensitive mixed-criticality applications for distributed real-time systems2018Inngår i: Journal of Parallel and Distributed Computing, ISSN 0743-7315, E-ISSN 1096-0848, Vol. 117, s. 115-126Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Existing studies on mixed-criticality systems are usually safety-oriented, which seriously ignore the security and energy related requirements. In this paper we are interested in the design of security-sensitive mixed-criticality real-time systems. We first establish the system model to capture security-critical applications in mixed-criticality systems. Higher security-criticality protection always results in significant time and energy overhead in mixed-criticality systems. Thus, this paper proposes a system-level design framework for energy optimization of security-sensitive mixed-criticality system with hard real-time constraints. Since the time complexity of finding optimal solutions grows exponentially as problem size grows, a GA (Genetic Algorithm) based on efficient heuristic algorithm is devised to address the system-level optimization problem. Extensive experiments and a real-life case study have been conducted to show the efficiency of the proposed technique, which can obtain balanced minimal energy consumption while satisfying strict security and timing constraints. The proposed approach can save up to 28.9% energy consumption compared with other three candidates. (C) 2018 Elsevier Inc. All rights reserved.

  • 663.
    Zhang, Xia
    et al.
    University of Electronic Science and Technology, China.
    Zhang, Jinyu
    University of Electronic Science and Technology, China.
    Jiang, Wei
    University of Electronic Science and Technology, China.
    Ma, Yue
    University of Electronic Science and Technology, China.
    Jiang, Ke
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Design Optimization of Security-Sensitive Mixed-Criticality Real-Time Embedded Systems2013Konferansepaper (Fagfellevurdert)
    Abstract [en]

    In this paper we are interested in securitysensitive mixed-criticality real-time systems. Existing researches on mixed-criticality systems usually are safety-oriented, which seriously ignore the security requirements. We firstly establish the system model to capture security-critical applications in mixed-criticality systems. Higher security-criticality protection always results in significant time and energy overhead in mixedcriticality systems. Thus, this paper proposes a system-level design framework for energy optimization of security-sensitive mixed-criticality system. Since the time complexity of finding optimal solutions grows exponentially as problem size grows, a GA based efficient heuristic algorithm is devised to address the system-level optimization problem. Extensive experiments demonstrate the efficiency of the proposed technique, which can obtain balanced minimal energy consumption while satisfying strict security and timing constraints.

  • 664. Zhang, Ying
    et al.
    Chakrabarty, Krishnendu
    Peng, Zebo
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Rezine, Ahmed
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Li, Huawei
    Eles, Petru
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Jiang, Jianhui
    Software-based Self-Testing using Bounded Model Checking for Out-of-Order Superscalar Processors2019Inngår i: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, ISSN 0278-0070, E-ISSN 1937-4151Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Generating functional tests for processors has been a challenging problem for decades in the VLSI testing field. This paper presents a method that generates software-based self-tests (SBST) by leveraging bounded model checking techniques (BMC) and targeting, for the first time, out-of-order (OOE) superscalar processors. To combat the state-space explosion associated with BMC, the proposed method starts by combining module-level abstraction-refinement with slicing to reduce the size of the model under verification. Next, an off-the-shelf BMC solver is used on the obtained extended finite-state machines (EFSM) to generate the leading sequences that are necessary to excite internal processor functions. Finally, constrained automatic test-pattern generation is used to cover all structural faults within every function excited by the obtained leading sequences. Experimental results show that the proposed method leads to extremely high fault coverage on the critical components corresponding to OOE operations in functional mode. The method therefore helps in tackling the over-testing problem that is inherent to the full-scan test approach.

  • 665.
    Zhang, Ying
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Li, Huawei
    Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China.
    Li, Xiaowei
    Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China.
    Automatic Test Program Generation Using Executing Trace Based Constraint Extraction for Embedded Processors2013Inngår i: IEEE Transactions on Very Large Scale Integration (vlsi) Systems, ISSN 1063-8210, E-ISSN 1557-9999, Vol. 21, nr 7, s. 1220-1233Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Software-based self-testing (SBST) has been a promising method for processor testing, but the complexity of the state-of-art processors still poses great challenges for SBST. This paper utilizes the executing trace collected during executing training programs on the processor under test to simplify mappings and functional constraint extraction for ports of inner components, which facilitate structural test generation with constraints at gate level, and automatic test instruction generation (ATIG) even for hidden control logic (HCL). In addition, for sequential HCL, we present a test routine generation technique on the basis of an extended finite state machine, so that structural patterns for combinational subcircuits in the sequential HCL can be mapped into the test routines to form a test program. Experimental results demonstrate that the proposed ATIG method can achieve good structural fault coverage with compact test programs on modern processors.

  • 666.
    Zhang, Ying
    et al.
    School of Software Engineering, Tongji University, China.
    Peng, Zebo
    Linköpings universitet, Institutionen för datavetenskap, ESLAB - Laboratoriet för inbyggda system. Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Jiang, Jianhui
    School of Software Engineering, Tongji University, China.
    Li, Huawei
    State Key Laboratory of Computer Architecture, Institute of Computing Technology, Chinese Academy of Sciences, China.
    Fujita, Masahiro
    VLSI Design and Education Center, University of Tokyo, Japan .
    Temperature-Aware Software-Based Self-Testing for Delay Faults2015Inngår i: Proc. Design, Automation and Test in Europe Conference (DATE’15), Grenoble, France, Mar. 9-13, 2015., 2015Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Delay defects under high temperature have been one of the most critical factors to affect the reliability of computer systems, and the current test methods don’t address this problem properly. In this paper, a temperature-aware software-based selftesting (SBST) technique is proposed to self-heat the processors within a high temperature range and effectively test delay faults under high temperature. First, it automatically generates highquality test programs through automatic test instruction generation (ATIG), and avoids over-testing caused by nonfunctional patterns. Second, it exploits two effective powerintensive program transformations to self-heat up the processors internally. Third, it applies a greedy algorithm to search the optimized schedule of the test templates in order to generate the test program while making sure that the temperature of the processor under test is within the specified range. Experimental results show that the generated program is successful to guarantee delay test within the given temperature range, and achieves high test performance with functional patterns.

  • 667.
    Zhang, Ying
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Rezine, Ahmed
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Eles, Petru
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Peng, Zebo
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Automatic Test Program Generation for Out-of-Order Superscalar Processors2012Inngår i: 21st IEEE Asian Test Symposium (ATS12), Niigata, Japan, November 19-22, 2012., IEEE, 2012Konferansepaper (Fagfellevurdert)
    Abstract [en]

    This paper presents a high-level automatic test instruction generation (HATIG) technical that allows, for the first time, to test the scheduling unit of an out-of-order super scalar processor. This technique leverages on existing bounded model checking tools in order to generate software-based self-testing programs from a global EFSM model of the processor under test. The experimental results have demonstrated the efficiency of the proposed technique.

  • 668.
    Zhou, Yuanbin
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Samii, Soheil
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten. General Motors, USA.
    Eles, Petru Ion
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Peng, Zebo
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Scheduling optimization with partitioning for mixed-criticality systems2019Inngår i: Journal of systems architecture, ISSN 1383-7621, E-ISSN 1873-6165, Vol. 98, s. 191-200Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Modern real-time embedded and cyber-physical systems comprise a large number of applications, often of different criticalities, executing on the same computing platform. Partitioned scheduling is used to provide temporal isolation among tasks with different criticalities. Isolation is often a requirement, for example, in order to avoid the case when a low criticality task overruns or fails in such a way that causes a failure in a high criticality task. When the number of partitions increases in mixed criticality systems, the size of the schedule table can become extremely large, which becomes a critical bottleneck due to design time and memory constraints of embedded systems. In addition, switching between partitions causes CPU overhead due to preemption. In this paper, we propose a design framework comprising the trade-off between schedule table size and system utilization, as well as a re-scheduling algorithm to reduce the effect of preemptions on utilization. Extensive experiments demonstrate the effectiveness of the proposed algorithms and design framework.

  • 669.
    Zhou, Yuanbin
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Samii, Soheil
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten. General Motors, USA.
    Eles, Petru
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Peng, Zebo
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Partitioned and overhead-aware scheduling of mixed-criticality real-time systems2019Inngår i: 24th Asia and South Pacific Design Automation Conference, New York: Association for Computing Machinery (ACM), 2019, s. 39-44Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Modern real-time embedded and cyber-physical systems comprise a large number of applications, often of different criticalities, executing on the same computing platform. Partitioned scheduling is used to provide temporal isolation among tasks with different criticalities. Isolation is often a requirement, for example, in order to avoid the case when a low criticality task overruns or fails in such a way that causes a failure in a high criticality task. When the number of partitions increases in mixed criticality systems, the size of the schedule table can become extremely large, which becomes a critical bottleneck due to design time and memory constraints of embedded systems. In addition, switching between partitions at runtime causes CPU overhead due to preemption. In this paper, we propose a design framework comprising a hyper-period optimization algorithm, which reduces the size of schedule table and preserves schedulability, and a re-scheduling algorithm to reduce the number of preemptions. Extensive experiments demonstrate the effectiveness of proposed algorithms and design framework.

  • 670.
    Ögren, Mikael
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system.
    Wikblad, Ludwig
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system.
    En testprocess för webbutvecklingsprojekt med små team2017Independent thesis Advanced level (degree of Master (Two Years)), 20 poäng / 30 hpOppgave
    Abstract [sv]

    Att hitta ett lämpligt tillvägagångssätt för att utföra testning i små utvecklingsteam är en utmaning. Många små företag upplever traditionella testprocesser och testförbättringsprocesser som alltför resurskrävande. Minimal Test Practice Framework (MTPF) är ett ramverk för testning vars syfte är att tillhandahålla ett minimalistiskt tillvägagångssätt för testförbättring. Målet med denna studie var att undersöka hur MTPF kan implementeras och anpassas till ett litet utvecklingsteam utan att den medför en för stor tidsinvestering. Studien utfördes på avdelningen Webb \& Mobilt i företaget Exsitec där team om 2-6 personer utvecklar webbapplikationer till företagskunder. I nära samarbete med utvecklarna på avdelningen togs en testprocess fram med målet att den skulle anpassas till verksamheten i så stor utsträckning som möjligt. Studien genomfördes som aktionsforskning i tre faser utefter Cooperative Method Development i ett projekt med två utvecklare. Under studiens första fas intervjuades alla utvecklare på avdelningen för att skapa en grundförståelse för verksamheten. Under den andra fasen togs ett antal förbättringsförslag fram tillsammans med utvecklarna. Under den tredje fasen infördes och utvärderades dessa förbättringar. Genom att fokusera på enhetstestning av central affärslogik i applikationen uppnåddes en testprocess som gav utvecklarna ett ökat förtroende för kodens kvalitet utan att upplevas som för resursintensiv.

  • 671.
    Öhberg, Tomas
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system.
    Auto-tuning Hybrid CPU-GPU Execution of Algorithmic Skeletons in SkePU2018Independent thesis Advanced level (degree of Master (Two Years)), 20 poäng / 30 hpOppgave
    Abstract [en]

    The trend in computer architectures has for several years been heterogeneous systems consisting of a regular CPU and at least one additional, specialized processing unit, such as a GPU.The different characteristics of the processing units and the requirement of multiple tools and programming languages makes programming of such systems a challenging task. Although there exist tools for programming each processing unit, utilizing the full potential of a heterogeneous computer still requires specialized implementations involving multiple frameworks and hand-tuning of parameters.To fully exploit the performance of heterogeneous systems for a single computation, hybrid execution is needed, i.e. execution where the workload is distributed between multiple, heterogeneous processing units, working simultaneously on the computation.

    This thesis presents the implementation of a new hybrid execution backend in the algorithmic skeleton framework SkePU. The skeleton framework already gives programmers a user-friendly interface to algorithmic templates, executable on different hardware using OpenMP, CUDA and OpenCL. With this extension it is now also possible to divide the computational work of the skeletons between multiple processing units, such as between a CPU and a GPU. The results show an improvement in execution time with the hybrid execution implementation for all skeletons in SkePU. It is also shown that the new implementation results in a lower and more predictable execution time compared to a dynamic scheduling approach based on an earlier implementation of hybrid execution in SkePU.

  • 672.
    Öhlin, Petra
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system.
    Prioritizing Tests with Spotify’s Test & Build Data using History-based, Modification-based & Machine Learning Approaches2017Independent thesis Advanced level (degree of Master (Two Years)), 20 poäng / 30 hpOppgave
    Abstract [en]

    This thesis intends to determine the extent to which machine learning can be used to solve the regression test prioritization (RTP) problem. RTP is used to order tests with respect to probability of failure. This will optimize for a fast failure, which is desirable if a test suite takes a long time to run or uses a significant amount of computational resources. A common machine learning task is to predict probabilities; this makes RTP an interesting application of machine learning. A supervised learning method is investigated to train a model to predict probabilities of failure, given a test case and a code change. The features investigated are chosen based on previous research of history- based and modification-based RTP. The main motivation for looking at these research areas is that they resemble the data provided by Spotify. The result of the report shows that it is possible to improve how tests run with RTP using machine learning. Nevertheless, a much simpler history- based approach is the best performing approach. It is looking at the history of test results, the more failures recorded for the test case over time, the higher priority it gets. Less is sometimes more. 

  • 673.
    Östman, Nicklas
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system.
    Lindström, Rasmus
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system.
    Vertically Scaling Agile: A Multiple-Case Study2017Independent thesis Advanced level (degree of Master (Two Years)), 20 poäng / 30 hpOppgave
    Abstract [en]

    The conceptual framework of agile software development is an ever-growing movement in the software industry. However, recent studies have shown that large, less software-focused companies, where software development is primarily used for in-house IT-solutions, struggle with giving up traditional command-control type of management. This hits hard on some of the most important principles of agile software development and in many cases this phenomenon has inevitably led to large gaps between development teams and more managerial parts of the organization. This thesis has aimed to study this gap and investigate how it affects software development teams’ ability to carry out their work.

    By comparing three software teams that were internally highly similar but with varying external conditions, impact on the teams’ behaviour based on their different environments was studied. The study was carried out using a multiple-case study approach with primary data sources consisting of survey gathered data from all team members and interviews with a subset of the team members. The results gathered from this study suggest that agile development teams are extremely dependent on a well-functioning interface to business related parts of an organization. Regarding teams’ ability to make decisions and being agile in their way of working, the results primarily isolate impediments with roots in an unwillingness to adhere to and lack of understanding of agile principles.

    In this thesis, our gathered results were also correlated with a modern framework called Flow in order to confirm its relevance regarding analyzing software development teams in large-scale environments. 

11121314 651 - 673 of 673
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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