Change search
Link to record
Permanent link

Direct link
BETA
Nordlander, Johan
Publications (10 of 34) Show all publications
Wallin, S., Nordlander, J. & Leijon, V. (2014). Semantic Alarms (ed.). In: (Ed.), Alex Galis; Gaby Lenhart (Ed.), 3rd ETSI Future Networks Workshop, 9-11 april 2013, Sophia Antipolis, France: . Paper presented at ETSI Future Networks Workshop : 09/04/2013 - 11/04/2013 (pp. 145-153).
Open this publication in new window or tab >>Semantic Alarms
2014 (English)In: 3rd ETSI Future Networks Workshop, 9-11 april 2013, Sophia Antipolis, France / [ed] Alex Galis; Gaby Lenhart, 2014, p. 145-153Conference paper, Published paper (Other (popular science, discussion, etc.))
Abstract [en]

Functions Virtualisation (NFV) and Software Driven Networks (SDN) aggregate resources across multiple domains. This puts requirements on understanding the overall alarm status across these domains and dependencies between them. Current practice of low-quality alarm documentation and confusion around fundamental concepts like alarm states, alarm-types and the underlying protocols like syslog and SNMP traps makes it hard to create one unified alarm interface as part of the SDN API.If alarm interfaces for the various components were expressed in a more formal manner including dependencies and propagation between the alarms the NFV/SDN interface could automatically present an integrated alarm API as well as a synthesized alarm state across the virtualized functions.We present a novel approach to alarm interfaces by providing a formal alarm model together with a domain-specific language that allows us to specify both the alarm models and the constraints placed on the alarm models in a consistent manner. This means that we can verify the consistency of an alarm interfaces and automatically generate interfaces, multi-domain correlation and aggregated states.

National Category
Media and Communication Technology
Research subject
Mobile and Pervasive Computing
Identifiers
urn:nbn:se:ltu:diva-34312 (URN)87b4f50c-cfae-4297-ad39-f454428300c1 (Local ID)979-10-92620-00-9 (ISBN)87b4f50c-cfae-4297-ad39-f454428300c1 (Archive number)87b4f50c-cfae-4297-ad39-f454428300c1 (OAI)
Conference
ETSI Future Networks Workshop : 09/04/2013 - 11/04/2013
Note
Godkänd; 2014; 20140110 (stewal)Available from: 2016-09-30 Created: 2016-09-30 Last updated: 2018-01-14Bibliographically approved
Lisper, B. & Nordlander, J. (2012). A simple and flexible timing constraint logic (ed.). In: (Ed.), Tiziana Margaria ; Bernhard Steffen (Ed.), Leveraging applications of formal methods, verification and validation: technologies for mastering change : 5th International Symposium, ISoLA 2012, Heraklion, Crete, Greece, October 15-18, 2012 : proceedings / Part II. Paper presented at International Symposium on Leveraging Applications of Formal Methods, Verification and Validation : 15/10/2012 - 18/10/2012 (pp. 80-95). Heidelberg: Encyclopedia of Global Archaeology/Springer Verlag, 2
Open this publication in new window or tab >>A simple and flexible timing constraint logic
2012 (English)In: Leveraging applications of formal methods, verification and validation: technologies for mastering change : 5th International Symposium, ISoLA 2012, Heraklion, Crete, Greece, October 15-18, 2012 : proceedings / Part II / [ed] Tiziana Margaria ; Bernhard Steffen, Heidelberg: Encyclopedia of Global Archaeology/Springer Verlag, 2012, Vol. 2, p. 80-95Conference paper, Published paper (Refereed)
Abstract [en]

Formats for describing timing behaviors range from fixed menus of standard patterns, to fully open-ended behavioral definitions; of which some may be supported by formal semantic underpinnings, while others are better characterized as primarily informal notations. Timing descriptions that allow flexible extension within a fully formalized framework constitute a particularly interesting area in this respect. We present a small logic for expressing timing constraints in such an open-ended fashion, sprung out of our work with timing constraint semantics in the TIMMO-2-USE project [15]. The result is a non-modal, first-order logic over reals and sets of reals, which references the constrained objects solely in terms of event occurrences. Both finite and infinite behaviors may be expressed, and a core feature of the logic is the ability to restrict any constraint to just the finite ranges when a certain system mode is active. Full syntactic and semantic definitions of our formula language are given, and as an indicator of its expressiveness, we show how to express all constraint forms currently defined by TIMMO-2-USE and AUTOSAR. A separate section deals with the support for mode-dependencies that have been proposed for both frameworks, and we demonstrate by an example how our generic mode-restriction mechanism formalizes the details of such an extension.

Place, publisher, year, edition, pages
Heidelberg: Encyclopedia of Global Archaeology/Springer Verlag, 2012
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 7610
National Category
Computer Sciences
Research subject
Dependable Communication and Computation Systems
Identifiers
urn:nbn:se:ltu:diva-39955 (URN)10.1007/978-3-642-34032-1_12 (DOI)2-s2.0-84868273940 (Scopus ID)ee69017c-f222-4e51-adfe-837fda4b5a6b (Local ID)9783642340321 (ISBN)ee69017c-f222-4e51-adfe-837fda4b5a6b (Archive number)ee69017c-f222-4e51-adfe-837fda4b5a6b (OAI)
Conference
International Symposium on Leveraging Applications of Formal Methods, Verification and Validation : 15/10/2012 - 18/10/2012
Note
Validerad; 2012; 20121113 (andbra)Available from: 2016-10-03 Created: 2016-10-03 Last updated: 2018-07-10Bibliographically approved
Wallin, S., Nordlander, J. & Åhlund, C. (2012). Rethinking network management: models, data-mining and self-learning (ed.). In: (Ed.), (Ed.), Proceedings of the 2012 IEEE Network Operations and Management Symposium: Maui, HI 16- 20 April 2012. Paper presented at IEEE/IFIP Network Operations and Management Symposium : 16/04/2012 - 19/04/2012 (pp. 880-886). Piscataway, NJ: IEEE Communications Society
Open this publication in new window or tab >>Rethinking network management: models, data-mining and self-learning
2012 (English)In: Proceedings of the 2012 IEEE Network Operations and Management Symposium: Maui, HI 16- 20 April 2012, Piscataway, NJ: IEEE Communications Society, 2012, p. 880-886Conference paper, Published paper (Refereed)
Abstract [en]

Network Service Providers are struggling to re- duce cost and still improve customer satisfaction. We have looked at three underlying challenges to achieve these goals; an overwhelming flow of low-quality alarms, understanding the structure and quality of the delivered services, and automation of service configuration. This thesis proposes solutions in these areas based on domain-specific languages, data-mining and self- learning. Most of the solutions have been validated based on data from a large service provider.We look at how domain-models can be used to capture explicit knowledge for alarms and services. In addition, we apply data- mining and self-learning techniques to capture tacit knowledge. The validation shows that models improve the quality of alarm and service models, and automatically render functions like root cause correlation, service and SLA status, as well as service configuration automation.The data-mining and self-learning solutions show that we can learn from available decisions made by experts and automatically assign alarm priorities.

Place, publisher, year, edition, pages
Piscataway, NJ: IEEE Communications Society, 2012
Series
I E E E - I F I P Network Operations and Management Symposium, ISSN 1542-1201
National Category
Computer Sciences Media and Communication Technology
Research subject
Dependable Communication and Computation Systems; Mobile and Pervasive Computing
Identifiers
urn:nbn:se:ltu:diva-29298 (URN)10.1109/NOMS.2012.6212003 (DOI)2-s2.0-84864217904 (Scopus ID)2b9e6f6e-7e84-4edb-b7bb-979ccd10f5e8 (Local ID)978-1-4673-0267-8 (ISBN)978-1-4673-0268-5 (ISBN)2b9e6f6e-7e84-4edb-b7bb-979ccd10f5e8 (Archive number)2b9e6f6e-7e84-4edb-b7bb-979ccd10f5e8 (OAI)
Conference
IEEE/IFIP Network Operations and Management Symposium : 16/04/2012 - 19/04/2012
Note
Godkänd; 2012; 20111223 (stewal)Available from: 2016-09-30 Created: 2016-09-30 Last updated: 2018-07-10Bibliographically approved
Wallin, S., Leijon, V., Nordlander, J. & Bystedt, N. (2012). The semantics of alarm definitions: enabling systematic reasoning about alarms (ed.). Paper presented at . International Journal of Network Management, 22(3), 181-198
Open this publication in new window or tab >>The semantics of alarm definitions: enabling systematic reasoning about alarms
2012 (English)In: International Journal of Network Management, ISSN 1055-7148, E-ISSN 1099-1190, Vol. 22, no 3, p. 181-198Article in journal (Refereed) Published
Abstract [en]

The development and integration of an alarm interface between network elements and a network management system is a costly process, largely because of the informal way in which alarm interfaces are expressed and communicated. Low-quality alarm documentation and confusion around fundamental concepts like alarm states and alarm types are typical consequences of current practices. If alarm interfaces were expressed in a more formal manner, costs could be reduced and more advanced analysis and automation would be enabled. We present a novel approach to alarm interfaces by providing a formal alarm model together with a domain-specific language that allows us to specify both the alarm models and the constraints placed on the alarm models in a consistent manner. This means that we can verify the consistency of an alarm interface and automatically generate artifacts such as alarm correlation rules or alarm documentation based only on the model

National Category
Computer Sciences Embedded Systems Media and Communication Technology
Research subject
Dependable Communication and Computation Systems; Embedded System; Mobile and Pervasive Computing
Identifiers
urn:nbn:se:ltu:diva-9940 (URN)10.1002/nem.800 (DOI)000304086500002 ()2-s2.0-84861228987 (Scopus ID)8a85d927-d9c0-4374-a663-db3161ee6034 (Local ID)8a85d927-d9c0-4374-a663-db3161ee6034 (Archive number)8a85d927-d9c0-4374-a663-db3161ee6034 (OAI)
Note
Validerad; 2012; 20110207 (stewal)Available from: 2016-09-29 Created: 2016-09-29 Last updated: 2018-07-10Bibliographically approved
Lisper, B., Nordlander, J. & Quinton, S. (2012). Timing constraints: theory meets practice (ed.). In: (Ed.), Tiziana Margaria ; Bernhard Steffen (Ed.), Leveraging applications of formal methods, verification and validation: technologies for mastering change : 5th International Symposium, ISoLA 2012, Heraklion, Crete, Greece, October 15-18, 2012 : proceedings / Part II.. Paper presented at International Symposium on Leveraging Applications of Formal Methods, Verification and Validation : 15/10/2012 - 18/10/2012 (pp. 78-79). Heidelberg: Encyclopedia of Global Archaeology/Springer Verlag, 2
Open this publication in new window or tab >>Timing constraints: theory meets practice
2012 (English)In: Leveraging applications of formal methods, verification and validation: technologies for mastering change : 5th International Symposium, ISoLA 2012, Heraklion, Crete, Greece, October 15-18, 2012 : proceedings / Part II. / [ed] Tiziana Margaria ; Bernhard Steffen, Heidelberg: Encyclopedia of Global Archaeology/Springer Verlag, 2012, Vol. 2, p. 78-79Conference paper, Published paper (Refereed)
Abstract [en]

Many embedded systems must satisfy timing requirements, which describe how these systems should behave with respect to timing. Such requirements must be dealt with throughout the system development process: from their initial specification, expressed at an abstract level, through the increasingly concrete layers, to the final implementation level. There is a growing awareness that this process needs support from languages, tools, and methodologies

Place, publisher, year, edition, pages
Heidelberg: Encyclopedia of Global Archaeology/Springer Verlag, 2012
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 7610
National Category
Computer Sciences
Research subject
Dependable Communication and Computation Systems
Identifiers
urn:nbn:se:ltu:diva-34820 (URN)10.1007/978-3-642-34032-1_11 (DOI)2-s2.0-84868282389 (Scopus ID)91f2549b-b6a7-4f5e-8ba8-d21b8a1fc763 (Local ID)9783642340321 (ISBN)91f2549b-b6a7-4f5e-8ba8-d21b8a1fc763 (Archive number)91f2549b-b6a7-4f5e-8ba8-d21b8a1fc763 (OAI)
Conference
International Symposium on Leveraging Applications of Formal Methods, Verification and Validation : 15/10/2012 - 18/10/2012
Note
Validerad; 2012; 20121113 (andbra)Available from: 2016-09-30 Created: 2016-09-30 Last updated: 2018-07-10Bibliographically approved
Wiklander, J., Kruglyak, A., Nordlander, J. & Lindgren, P. (2011). Personal alarm device: a case study in component-based design of embedded real-time software (ed.). Paper presented at Real-Time in Sweden : 13/06/2011 - 14/06/2011. Paper presented at Real-Time in Sweden : 13/06/2011 - 14/06/2011.
Open this publication in new window or tab >>Personal alarm device: a case study in component-based design of embedded real-time software
2011 (English)Conference paper, Oral presentation only (Other academic)
Abstract [en]

Designing software for embedded systems is complicated by such factors as the tight integration between software and hardware, scarceness of available resources, and hard real-time requirements. In our earlier work we proposed a component-based approach based on modeling both hardware and software using reactive objects and time-constrained reactions, which should allow us to overcome these difficulties. We also presented a software design methodology for embedded real-time systems.Here we describe a system developed using this methodology and discuss its advantages. The system is a personal alarm device that should be worn at the waist of a person and that should detect his or her fall and send an alarm signal. The implementation of the system was verified using a Simulink-based simulator. The simulation demonstrated that, even though calculation of acceleration was simplified to allow for an efficient execution on a resource-constrained platform, fall detection remained satisfactory.The case study demonstrates the advantages of the proposed software design methodology, including the fact that functional and timing properties of a system model can be preserved during implementation process by means of a seamless transition between a model and an implementation.

Keywords
component-based design, embedded system, real-time, reactive objects, reactive component, time-constrained reaction, Timber, Information technology - Systems engineering, Informationsteknik - Systemteknik
National Category
Computer Sciences Embedded Systems
Research subject
Dependable Communication and Computation Systems; Embedded System
Identifiers
urn:nbn:se:ltu:diva-32680 (URN)73e705b7-a17c-46e7-950e-528d292f6d88 (Local ID)73e705b7-a17c-46e7-950e-528d292f6d88 (Archive number)73e705b7-a17c-46e7-950e-528d292f6d88 (OAI)
Conference
Real-Time in Sweden : 13/06/2011 - 14/06/2011
Note
Godkänd; 2011; 20110605 (jimmie)Available from: 2016-09-30 Created: 2016-09-30 Last updated: 2018-01-14Bibliographically approved
van Deventer, J., Kruglyak, A., Nordlander, J. & Delsing, J. (2011). Platform independent system integration (ed.). In: (Ed.), SAE 2011 World Congress & Exhibition Technical Papers: April 12 - 14, 2011, Detroit, Michigan, USA ; [papers]. Paper presented at SAE World Congress : 12/04/2011 - 14/04/2011. Warrendale, Pa: Society of Automotive Engineers, Incorporated
Open this publication in new window or tab >>Platform independent system integration
2011 (English)In: SAE 2011 World Congress & Exhibition Technical Papers: April 12 - 14, 2011, Detroit, Michigan, USA ; [papers], Warrendale, Pa: Society of Automotive Engineers, Incorporated , 2011Conference paper, Published paper (Refereed)
Abstract [en]

This paper presents and demonstrates a paradigm to implement automotive systems based on their specifications in a manner that is platform independent. The advantage is to have the same software used in simulation as on different types of micro-controller in a vehicle as well as to ease the integration of different systems. The paradigm is to model the system’s components as reactive objects and to use the Timber kernel to schedule their (re)actions. The demonstration is done by developing an anti-lock braking system within the simulation software CarSim and Simulink, which is then evaluated on a braking maneuver over a surface with different coefficient of adhesion from side to side (split mu).

Place, publisher, year, edition, pages
Warrendale, Pa: Society of Automotive Engineers, Incorporated, 2011
Series
S A E Technical Papers, ISSN 0148-7191
Keywords
Anti-lock braking system, real time system, Timber, Technology - Electrical engineering, electronics and photonics, Teknikvetenskap - Elektroteknik, elektronik och fotonik
National Category
Other Electrical Engineering, Electronic Engineering, Information Engineering Embedded Systems Computer Sciences
Research subject
Industrial Electronics; Embedded System; Dependable Communication and Computation Systems
Identifiers
urn:nbn:se:ltu:diva-39474 (URN)10.4271/2011-01-0211 (DOI)2-s2.0-79959843793 (Scopus ID)e3f94552-890c-45fd-b514-fcd8e6cc2409 (Local ID)e3f94552-890c-45fd-b514-fcd8e6cc2409 (Archive number)e3f94552-890c-45fd-b514-fcd8e6cc2409 (OAI)
Conference
SAE World Congress : 12/04/2011 - 14/04/2011
Projects
CASTT - Centre for Automotive Systems Technologies and Testing
Note

Validerad; 2011; 20110405 (deventer)

Available from: 2016-10-03 Created: 2016-10-03 Last updated: 2018-07-10Bibliographically approved
Jonsson, P. & Nordlander, J. (2011). Taming code explosion in supercompilation (ed.). In: (Ed.), (Ed.), Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation: PEMP 11 (pp. 33-42). New York: ACM Digital Library
Open this publication in new window or tab >>Taming code explosion in supercompilation
2011 (English)In: Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation: PEMP 11, New York: ACM Digital Library, 2011, p. 33-42Conference paper, Published paper (Refereed)
Abstract [en]

Supercompilation algorithms can perform great optimizations but sometimes suffer from the problem of code explosion. This results in huge binaries which might hurt the performance on a modern processor. We present a supercompilation algorithm that is fast enough to speculatively supercompile expressions and discard the result if it turned out bad. This allows us to supercompile large parts of the imaginary and spectral parts of nofib in a matter of seconds while keeping the binary size increase below 5%.

Place, publisher, year, edition, pages
New York: ACM Digital Library, 2011
National Category
Computer Sciences
Research subject
Dependable Communication and Computation Systems
Identifiers
urn:nbn:se:ltu:diva-39898 (URN)10.1145/1929501.1929507 (DOI)2-s2.0-79952127127 (Scopus ID)ed11791a-f6cb-43c8-a76e-f94de65fef03 (Local ID)978-1-4503-0485-6 (ISBN)ed11791a-f6cb-43c8-a76e-f94de65fef03 (Archive number)ed11791a-f6cb-43c8-a76e-f94de65fef03 (OAI)
Projects
ESIS
Note
Godkänd; 2011; 20110214 (pj)Available from: 2016-10-03 Created: 2016-10-03 Last updated: 2018-07-10Bibliographically approved
Kero, M., Pietrzak, P. & Nordlander, J. (2010). Live heap space bounds for real-time systems (ed.). In: (Ed.), (Ed.), Programming languages and systems: 8th Asian symposium, APLAS 2010, Shanghai, China, November28 - December 1 2010 : proceedings. Paper presented at Asian Symposium on Programming Languages and Systems : 28/11/2010 - 01/12/2010 (pp. 287-303). Berlin: Encyclopedia of Global Archaeology/Springer Verlag
Open this publication in new window or tab >>Live heap space bounds for real-time systems
2010 (English)In: Programming languages and systems: 8th Asian symposium, APLAS 2010, Shanghai, China, November28 - December 1 2010 : proceedings, Berlin: Encyclopedia of Global Archaeology/Springer Verlag, 2010, p. 287-303Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
Berlin: Encyclopedia of Global Archaeology/Springer Verlag, 2010
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 6164
National Category
Embedded Systems Computer Sciences
Research subject
Embedded System; Dependable Communication and Computation Systems
Identifiers
urn:nbn:se:ltu:diva-31616 (URN)10.1007/978-3-642-17164-2_20 (DOI)2-s2.0-78650753664 (Scopus ID)5db77730-c1aa-11df-a707-000ea68e967b (Local ID)978-3-642-17163-5 (ISBN)5db77730-c1aa-11df-a707-000ea68e967b (Archive number)5db77730-c1aa-11df-a707-000ea68e967b (OAI)
Conference
Asian Symposium on Programming Languages and Systems : 28/11/2010 - 01/12/2010
Note
Validerad; 2011; 20100916 (keero)Available from: 2016-09-30 Created: 2016-09-30 Last updated: 2018-07-10Bibliographically approved
Jonsson, P. & Nordlander, J. (2010). Positive supercompilation for a higher-order call-by-value language (ed.). Paper presented at . Logical Methods in Computer Science, 6(3), 1-39
Open this publication in new window or tab >>Positive supercompilation for a higher-order call-by-value language
2010 (English)In: Logical Methods in Computer Science, ISSN 1860-5974, E-ISSN 1860-5974, Vol. 6, no 3, p. 1-39Article in journal (Refereed) Published
Abstract [en]

Previous deforestation and supercompilation algorithms may introduce accidental termination when applied to call-by-value programs. This hides looping bugs from the programmer, and changes the behavior of a program depending on whether it is optimized or not. We present a supercompilation algorithm for a higher-order call-by-value language and prove that the algorithm both terminates and preserves termination properties. This algorithm utilizes strictness information to decide whether to substitute or not and compares favorably with previous call-by-name transformations

National Category
Computer Sciences
Research subject
Dependable Communication and Computation Systems
Identifiers
urn:nbn:se:ltu:diva-6478 (URN)10.2168/LMCS-6(3:5)2010 (DOI)000282653500005 ()4b397840-da84-11df-8b36-000ea68e967b (Local ID)4b397840-da84-11df-8b36-000ea68e967b (Archive number)4b397840-da84-11df-8b36-000ea68e967b (OAI)
Note
Validerad; 2010; 20101018 (andbra)Available from: 2016-09-29 Created: 2016-09-29 Last updated: 2018-07-10Bibliographically approved
Organisations

Search in DiVA

Show all publications