liu.seSök publikationer i DiVA
Ändra sökning
Avgränsa sökresultatet
1 - 12 av 12
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Träffar per sida
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
Markera
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 1.
    Ganjei, Zeinab
    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.
    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.
    Abstracting and Counting Synchronizing Processes2014Rapport (Övrigt vetenskapligt)
    Abstract [en]

    We address the problem of automatically establishing synchronization dependent correctness (e.g. due to using barriers or ensuring absence of deadlocks) of programs generating an arbitrary number of concurrent processes and manipulating variables ranging over an infinite domain. Automatically checking such properties for these programs is beyond the capabilities of current verification techniques. For this purpose, we describe an original logic that mixes two sorts of variables: those shared and manipulated by the concurrent processes, and ghost variables refering to the number of processes satisfying predicates on shared and local program variables. We then combine existing works on counter, predicate, and constrained monotonic abstraction and nest two cooperating counter example based refinement loops for establishing correctness (safety expressed as non reachability of configurations satisfying formulas in our logic). We have implemented a tool (Pacman, for predicated constrained monotonic abstraction) and used it to perform parameterized verification for several programs whose correctness crucially depends on precisely capturing the number of synchronizing processes. 

    Ladda ner fulltext (pdf)
    fulltext
  • 2.
    Lifa, Adrian Alin
    et al.
    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.
    Execution Time Minimization Based on Hardware/Software Partitioning and Speculative Prefetch2012Rapport (Övrigt vetenskapligt)
    Abstract [en]

    This report addresses the problem of minimizing the average execution time of an application, based on speculative FPGA configuration prefetch. Dynamically reconfigurable systems (like FPGAs) provide both the performance of hardware acceleration and the flexibility and adaptability that modern applications require. Unfortunately, one of their main drawbacks that significantly impacts performance is the high reconfiguration overhead. Configuration prefetching is one method to reduce this penalty by overlapping FPGA reconfigurations with useful computations. In order to make it effective and to avoid very high misprediction penalties, it is important to prefetch the configurations that provide the highest performance improvement, and to do this early enough to hide the reconfiguration overhead. In this report we propose a speculative approach that schedules prefetches at design time and simultaneously performs HW/SW partitioning, in order to minimize the expected execution time of an application. Our method prefetches and executes in hardware those configurations that provide the highest performance improvement. The algorithm takes into consideration profiling information (such as branch probabilities and execution time distributions), correlated with the application characteristics. We demonstrate the effectiveness of our approach compared to the previous state-of-art using extensive experiments, including real-life case studies.

    Ladda ner fulltext (pdf)
    Execution Time Minimization Based on Hardware/Software Partitioning and Speculative Prefetch
  • 3.
    Fritzson, Peter
    et al.
    Linköpings universitet, Institutionen för datavetenskap, PELAB - Laboratoriet för programmeringsomgivningar. Linköpings universitet, Tekniska högskolan.
    Pop, Adrian
    Linköpings universitet, Institutionen för datavetenskap, PELAB - Laboratoriet för programmeringsomgivningar. Linköpings universitet, Tekniska högskolan.
    Meta-Programming and Language Modeling with MetaModelica 1.02011Rapport (Övrigt vetenskapligt)
    Abstract [en]

    This report gives a language definition and tutorial on how to model languages using MetaModelica 1.0 – an extended subset of Modelica designed for efficient language modeling. Starting from an extremely simple language, a series of small languages are modeled by gradually adding features. Both interpretive and translational language semantics are modeled. Exercises with solutions are given.

    The approach of allowing the modeling language to model language semantics in principle allows the definition of language semantics in libraries, which could be used to reverse the current trend of model compilers becoming very large and complex.

    MetaModelica 1.0 is the first Modelica language version that supports  language modeling, and has been in extensive use since 2005, primarily in the development of the OpenModelica compiler.

    MetaModelica 1.0 is strongly related to the RML specification language for Natural Semantics/Structural Operational Semantics, and is implemented using the RML compiler kernel but with a new compiler frontend. Thus, it lacks many standard language features in Modelica and requires a strictly functional modeling style.

    The next version of MetaModelica, becoming available during the spring 2011, is implemented within the standard OpenModelica compiler. Therefore it also supports the standard Modelica 3 language features as well as additional features for expressiveness and conciseness.

    Ladda ner fulltext (pdf)
    Meta-Programming and Language Modeling with MetaModelica 1.0
  • 4.
    Fritzson, Peter
    et al.
    Linköpings universitet, Institutionen för datavetenskap, PELAB - Laboratoriet för programmeringsomgivningar. Linköpings universitet, Tekniska högskolan.
    Pop, Adrian
    Linköpings universitet, Institutionen för datavetenskap, PELAB - Laboratoriet för programmeringsomgivningar. Linköpings universitet, Tekniska högskolan.
    Sjölund, Martin
    Linköpings universitet, Institutionen för datavetenskap, PELAB - Laboratoriet för programmeringsomgivningar. Linköpings universitet, Tekniska högskolan.
    Towards Modelica 4 Meta-Programming and Language Modeling with MetaModelica 2.02011Rapport (Övrigt vetenskapligt)
    Abstract [en]

    This report gives a language definition and tutorial on how to model languages using MetaModelica 2.0 – an extension of Modelica 3.2 designed for efficient language modeling. Starting from an extremely simple language, a series of small languages are modeled by gradually adding features. Both interpretive and translational language semantics are modeled. Exercises with solutions are given.

    The approach of allowing the modeling language to model language semantics in principle allows the definition of language semantics in libraries, which could be used to reverse the current trend of model compilers becoming very large and complex.

    MetaModelica 2.0 builds on MetaModelica 1.0 which was the first Modelica language version that supports language modeling, and has been in extensive use since 2005, primarily in the development of the OpenModelica compiler.

    The following version of MetaModelica, called MetaModelica 2.0, is described in this report. It is easier to use since it also supports the standard Modelica 3 language features as well as additional modeling features for expressiveness and conciseness. It is implemented within the OpenModelica compiler itself. This means that the OpenModelica compiler supporting MetaModelica 2.0 is bootstrapped, i.e., it compiles itself.

    This work is strongly connected to the Modelica 4 effort announced by Modelica Association in September 2010, which includes moving language functionality into library packages to achieve more extensible and modular Modelica model compilers. The MetaModelica language features contribute to realizing that goal. The language features have been proven in large-scale usage in the packages within the OpenModelica compiler. However, much work still remains in improving the modularity and interface properties that are expected by library packages.

    Ladda ner fulltext (pdf)
    fulltext
  • 5.
    Kuiper, Erik
    Linköpings universitet, Institutionen för datavetenskap, RTSLAB - Laboratoriet för realtidssystem. Linköpings universitet, Tekniska högskolan.
    Details on Packet Level Design for Two Delay-Tolerant Routing Protocols2010Rapport (Övrigt vetenskapligt)
    Abstract [en]

    The purpose of this report is to provide the implementation details for work that has been published in a scholarly article and in which space limitation have not allowed the detailed descriptions. In this paper we describe, in detail, the implementation of Location Aware Routing for Opportunistic Delay-tolerant Networks (LAROD) and Spray and Wait as implemented in the ns-2 simulator. Spray and Wait was originally evaluated using a custom simulator where the MAC protocol provided services that were not modeled by packet exchanges.

    Ladda ner fulltext (pdf)
    Details on Packet Level Design for Two Delay-Tolerant Routing Protocols
  • 6.
    Bivall, Petter
    et al.
    Linköpings universitet, Institutionen för datavetenskap. Linköpings universitet, Tekniska högskolan.
    Forsell, Camilla
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Tekniska högskolan.
    Haptic Just Noticeable Difference in Continuous Probing of Volume Data2010Rapport (Övrigt vetenskapligt)
    Abstract [en]

    Just noticeable difference (JND) describes how much two perceptual sensory inputs must differ in order to be distinguishable from each other. Knowledge of the JND is vital when two features in a dataset are to be separably represented. JND has received a lot of attention in haptic research and this study makes a contribution to the field by determining JNDs during users' probing of volumetric data at two force levels. We also investigated whether these JNDs were affected by where in the haptic workspace the probing occurred. Reference force magnitudes were 0.1 N and 0.8 N, and the volume data was presented in rectangular blocks positioned at the eight corners of a cube 10 cm3 in size. Results showed that the JNDs varied significantly for the two force levels, with mean values of 38.5% and 8.8% obtained for the 0.1 N and 0.8 N levels, respectively, and that the JND was influenced by where the data was positioned.

    Ladda ner fulltext (pdf)
    Haptic Just Noticeable Difference in Continuous Probing of Volume Data
  • 7.
    Kuiper, Erik
    Linköpings universitet, Institutionen för datavetenskap, RTSLAB - Laboratoriet för realtidssystem. Linköpings universitet, Tekniska högskolan.
    Node density, connectivity and the percolation threshold2010Rapport (Övrigt vetenskapligt)
    Abstract [en]

    The purpose of this study is to document a background analysis that has been performed in order to set the parameters for simulation studies used by the author in scholarly published articles. The background information has not been in the published material due to space restrictions, but it may be of interest for a wider audience in the field.

    When evaluating routing protocols and other protocols in mobile ad hoc networks (MANETs) and delay-tolerant networks (DTNs) one factor influencing the result is the node density. To understand what a certain node density means in term of connectivity properties we have by simulation evaluated how well connected a system of randomly placed nodes are for different node densities and network sizes. We have compared these densities to the percolation threshold to understand how much we need to increase the density over the percolation threshold to, with high probability, have a fully connected system provided that the number of nodes are finite. The percolation threshold is the node density above which it is almost surely guaranteed that the largest connected component in an infinite system is of infinite size. Finally we provide a survey of node densities used in some recent MANET and DTN studies.

    Ladda ner fulltext (pdf)
    Node density, connectivity and the percolation threshold
  • 8.
    Bao, Min
    et al.
    Linköpings universitet, Institutionen för datavetenskap, ESLAB - Laboratoriet för inbyggda system. Linköpings universitet, Tekniska högskolan.
    Andrei, Alexandru
    Linköpings universitet, Institutionen för datavetenskap, ESLAB - Laboratoriet för inbyggda system. Linköpings universitet, Tekniska högskolan.
    Eles, Petru
    Linköpings universitet, Institutionen för datavetenskap, ESLAB - Laboratoriet för inbyggda system. Linköpings universitet, Tekniska högskolan.
    Peng, Zebo
    Linköpings universitet, Institutionen för datavetenskap, ESLAB - Laboratoriet för inbyggda system. Linköpings universitet, Tekniska högskolan.
    An Energy Efficient Technique for Temperature-Aware Voltage Selection2009Rapport (Övrigt vetenskapligt)
    Abstract [en]

    High power densities in current SoCs result in both huge energy consumption and increased chip temperature. This paper proposes a temperature-aware dynamic voltage selection technique for energy minimization and presents a thorough analysis of the parameters that influence the potential gains that can be expected from such a technique, compared to a voltage selection approach that ignores temperature. In addition to demonstrating the actual percentages of energy that can be saved by being temperature aware, we explore some significant issues in this context, such as the relevance of taking into consideration transient temperature effects at optimization, the impact of the percentage of leakage power relative to the total power consumed and of the degree to which leakage depends on temperature.

    Ladda ner fulltext (pdf)
    An Energy Efficient Technique for Temperature-Aware Voltage Selection
  • 9.
    Schamai, Wladimir
    Linköpings universitet, Institutionen för datavetenskap. Linköpings universitet, Tekniska högskolan.
    Modelica Modeling Language (ModelicaML): A UML Profile for Modelica2009Rapport (Övrigt vetenskapligt)
    Abstract [en]

    This document presents the Modelica Modeling Language (ModelicaML) a UML Profile for Modelica. The purpose of the ModelicaML is to enable an efficient and effective way to create, read or understand, and maintain Modelica models. ModelicaML is defined as a graphical notation and facilitates different views (composition, inheritance, behavior) on Modelica models. It is based on a subset of the OMG Unified Modeling Language (UML) and reuses concepts from the OMG Systems Modeling Language (SysML). ModelicaML is defined towards generation of executable Modelica code from graphical models.

    Ladda ner fulltext (pdf)
    Modelica Modeling Language (ModelicaML) : A UML Profile for Modelica
  • 10.
    Emanuelsson, Pär
    et al.
    Ericsson AB, Linköping, Sweden.
    Nilsson, Ulf
    Linköpings universitet, Institutionen för datavetenskap, TCSLAB - Laboratoriet för teoretisk datalogi. Linköpings universitet, Tekniska högskolan.
    A Comparative Study of Industrial Static Analysis Tools (extended version)2008Rapport (Övrigt vetenskapligt)
    Abstract [en]

    Almost all software contains defects. Some defects are found easily while others are never found, typically because they emerge seldom or not at all. Some defects that emerge relatively often even go unnoticed simply because they are not perceived as errors or are not suffciently severe. Software defects may give rise to several types of errors, ranging from logical/functional ones (the program sometimes computes incorrect values) to runtime errors (the program typically crashes), or resource leaks (performance of the program degrades possibly until the program freezes or crashes). Programs may also contain subtle security vulnerabilities that can be exploited by malicious attackers to gain control over computers.    Fixing defects that suddenly emerge can be extremely costly in particular if found at the end of the development cycle, or worse: after deployment. Many simple defects in modern programming languages can be found by modern compilers, e.g. in statically typed languages. But the predominating method for finding defects is testing. Testing has the potential of finding most types of defects, however, testing is costly and no amount of testing will find all defects. Testing is also problematic because it can be applied only to executable code, i.e. rather late in the development process. Alternatives to testing, such as data°ow analysis and formal verification, have been known since the 1970s but have not gained widespread acceptance outside academia|that is, until recently; lately several commercial tools for detecting runtime error conditions at compile time have emerged. The tools build on static analysis and can be used to find runtime errors as well as resource leaks and even some security vulnerabilities statically, i.e. without executing the code. This paper is a survey and comparison of three market leading static analysis tools: PolySpace Verifier, Coverity Prevent and Klocwork K7. The list is by no means exhaustive, and the list of competitors is steadily increasing, but the three tools represent state-of-the-art in the field at the moment.

    The main objective of this study is (1) to identify significant static analysis functionality provided by the tools, but not addressed in a normal compiler, and (2) to survey the underlying supporting technology. The goal is not to provide a ranking of the tools; nor is it to provide a comprehensive survey of all functionality provided by the tools. Providing such a ranking is problematic for at least two reasons: Static analysis is generally only part of the functionality provided by the tool; for instance, Klocwork K7 supports both refactoring and software metrics which are not supported by the two other tools. Even if restricting attention only to static analysis functionality the tools provide largely non-overlapping functionality. Secondly, even when the tools seemingly provide the same functionality (e.g. detection of dereferencing of null pointers) their solutions are often not comparable; each tool typically finds defects which are not found by any of the other tools.

    Studying the internals of commercial and proprietary tools is not without problems|in particular, it is impossible to get full information about technical solutions. However, some technical information is publicly available in manuals and white papers; some of the tools also originate from academic tools which have been extensively described in research journals and conference proceedings. While technical solutions may have changed since then, we believe that such information is still largely valid. We have also consulted representatives from all three providers with the purpose to validate our descriptions of the tools. Still it must be pointed out that the descriptions of suggested technical solutions is subject to a certain amount of guessing in some respects.

    The rest of the report is organized as follows: In Section 2 we define what we mean by the term static analysis and survey some elementary concepts and preconditions; in particular, the trade off between precision and analysis time. Section 3 contains a description of basic principles of static analysis. In Sections 4{6 we survey the static analysis functionality provided by PolySpace Verifier/Desktop, Coverity Prevent and Klocwork K7 focusing in particular on the support for the C and C++ programming languages. Section 7 addresses the complementary issue of programming guidelines such as those of The Motor Software Reliability Association (MISRA). Section 8 contains a qualitative comparison of the three tools summing up their relative merits and shortcomings. The section also surveys several industrial evaluations of the tools over time at Ericsson, in particular involving the products from Coverity and Klocwork. Section 9 contains conclusions.

    Ladda ner fulltext (pdf)
    A Comparative Study of Industrial Static Analysis Tools (extended version)
  • 11.
    Lundvall, Håkan
    et al.
    Linköpings universitet, Institutionen för datavetenskap, PELAB - Laboratoriet för programmeringsomgivningar. Linköpings universitet, Tekniska högskolan.
    Fritzson, Peter
    Linköpings universitet, Institutionen för datavetenskap, PELAB - Laboratoriet för programmeringsomgivningar. Linköpings universitet, Tekniska högskolan.
    Bachmann, Bernhard
    Dept. Mathematics and Engineering, University of Applied Sciences, Bielefeld, Germany.
    Event Handling in the OpenModelica Compiler and Runtime System2008Rapport (Övrigt vetenskapligt)
    Abstract [en]

    This paper gives an introduction and overview of problems and solutions regarding simulating hybrid DAEs (systems of Differential Algebraic Equations) with event-handling, in the context of producing such equations from models in the Modelica language. Iimplementation and measurements are done in the OpenModelica environment. The basic hybrid DAE solution algorithm is presented, followed by a discussion of handling possibly varying structure of the active part of the hybrid DAE, and how to find consistent initial values at start or restart of simulation. The problem of detecting events during continuous-time simulation is dealt with using crossing functions and an algorithm for proper integration with a numerical solver, here DASRT. Event-related aspects of code generation from models are presented, followed by an example showing how the event mechanism works. Finally, preliminary results from translating and simulating two examples models, the bouncing ball and the full wave rectifier, are presented and compared with those from a commercial simulation tool (Dymola), giving identical results.

    Ladda ner fulltext (pdf)
    Event Handling in the OpenModelica Compiler and Runtime System
  • 12.
    Broman, David
    Linköpings universitet, Institutionen för datavetenskap, PELAB - Laboratoriet för programmeringsomgivningar. Linköpings universitet, Tekniska högskolan.
    Flow Lambda Calculus for Declarative Physical Connection Semantics2007Rapport (Övrigt vetenskapligt)
    Abstract [en]

    One of the most fundamental language constructs of equation-based object-oriented languages is the possibility to state acausal connections, where both potential variables and flow variables exist. Several of the state-of-the art languages in this category are informally specified using natural language. This can make the languages hard to interpret, reason about, and disable the possibility to guarantee the absence of certain errors. In this work, we construct a formal operational small-step semantics based on the lambda-calculus. The calculus is then extended with more convenient modeling capabilities. Examples are given that demonstrate the expressiveness of the language, and some tests are made to verify the correctness of the semantics.

    Ladda ner fulltext (pdf)
    Flow Lambda Calculus for Declarative Physical Connection Semantics
1 - 12 av 12
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf