Semantics and Analysis of Instruction List Programs

Authors:
Ralf Huuck
Affiliations:
National ICT Australia University of New South Wales 2052 Sydney, Australia
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 4
Cited 1

Static analysis of linear congruence equalities among variables of a program

TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Colloquium on trees in algebra and programming (CAAP '91): vol 1
Array abstractions using semantic analysis of trapezoid congruences

ICS '92 Proceedings of the 6th international conference on Supercomputing
Automatic discovery of linear restraints among variables of a program

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Systematic design of program analysis frameworks

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages

Verification of PLC properties based on formal semantics in Coq

SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods

Quantified Score

Hi-index	0.00

Visualization

Abstract

Instruction List (IL) is a simple typed assembly language commonly used in embedded control. There is little tool support for IL and, although defined in the IEC 61131-3 standard, there is no formal semantics. In this work we develop a formal operational semantics. Moreover, we present an abstract semantics, which allows approximative program simulation for a (possibly infinte) set of inputs in one simulation run. We also extended this framework to an abstract interpretation based analysis, which is implemented in our tool Homer. All these analyses can be carried out without knowledge of formal methods, which is typically not present in the IL community.