Tse Min Lin | IFPE (original) (raw)
Uploads
Papers by Tse Min Lin
Lecture Notes in Computer Science, 2003
The dynamic aspects of the object-oriented paradigm have prevented the adoption of the latter for... more The dynamic aspects of the object-oriented paradigm have prevented the adoption of the latter for the implementation of high integrity systems using the SPARK approach. This paper presents a proposal that allows object-oriented programming in SPARK95, whereas supporting SPARK’s static approach for verification by imposing a notion of behavioural sub-typing between a type and all its subtypes. Behavioural sub-typing supports
Lecture Notes in Computer Science, 2000
The SPARK programming language and associated tools are specifically intended for the implementat... more The SPARK programming language and associated tools are specifically intended for the implementation of high integrity systems. SPARK2000 is an extension to the SPARK95 language to support object-oriented programming. This paper presents how polymorphism can take place in SPARK2000 through restrictions on the use of access types. Those restrictions ensure that neither aliasing nor definition of recursive types can occur
Lecture Notes in Computer Science, 2003
This paper presents a proposal for extending the Ravenscar Tasking Profile with annotations that ... more This paper presents a proposal for extending the Ravenscar Tasking Profile with annotations that can be used to express temporal properties. An approach using model checking for the verification of compliance to the annotations is also presented. An extended example is used to illustrate the application of the proposed approach.
Electronic Notes in Theoretical Computer Science, 2006
We propose a format of predicate diagrams for the verification of real-time systems. We consider ... more We propose a format of predicate diagrams for the verification of real-time systems. We consider systems that are defined as extended timed graphs, a format that combines timed automata and constructs for modeling data, possibly over infinite domains. Predicate diagrams are succinct and intuitive representations of Boolean abstractions. They also represent an interface between deductive tools used to establish the correctness of an abstraction, and model checking tools that can verify behavioral properties of finite-state models. The contribution of this paper is to extend the format of predicate diagrams to timed systems. We also establish a set of verification conditions that are sufficient to prove that a given predicate diagram is a correct abstraction of an extended timed graph. The formalism is supported by a toolkit, and we demonstrate its use at the hand of Fischer's real-time mutualexclusion protocol.
Lecture Notes in Computer Science, 2003
The dynamic aspects of the object-oriented paradigm have prevented the adoption of the latter for... more The dynamic aspects of the object-oriented paradigm have prevented the adoption of the latter for the implementation of high integrity systems using the SPARK approach. This paper presents a proposal that allows object-oriented programming in SPARK95, whereas supporting SPARK’s static approach for verification by imposing a notion of behavioural sub-typing between a type and all its subtypes. Behavioural sub-typing supports
Lecture Notes in Computer Science, 2000
The SPARK programming language and associated tools are specifically intended for the implementat... more The SPARK programming language and associated tools are specifically intended for the implementation of high integrity systems. SPARK2000 is an extension to the SPARK95 language to support object-oriented programming. This paper presents how polymorphism can take place in SPARK2000 through restrictions on the use of access types. Those restrictions ensure that neither aliasing nor definition of recursive types can occur
Lecture Notes in Computer Science, 2003
This paper presents a proposal for extending the Ravenscar Tasking Profile with annotations that ... more This paper presents a proposal for extending the Ravenscar Tasking Profile with annotations that can be used to express temporal properties. An approach using model checking for the verification of compliance to the annotations is also presented. An extended example is used to illustrate the application of the proposed approach.
Electronic Notes in Theoretical Computer Science, 2006
We propose a format of predicate diagrams for the verification of real-time systems. We consider ... more We propose a format of predicate diagrams for the verification of real-time systems. We consider systems that are defined as extended timed graphs, a format that combines timed automata and constructs for modeling data, possibly over infinite domains. Predicate diagrams are succinct and intuitive representations of Boolean abstractions. They also represent an interface between deductive tools used to establish the correctness of an abstraction, and model checking tools that can verify behavioral properties of finite-state models. The contribution of this paper is to extend the format of predicate diagrams to timed systems. We also establish a set of verification conditions that are sufficient to prove that a given predicate diagram is a correct abstraction of an extended timed graph. The formalism is supported by a toolkit, and we demonstrate its use at the hand of Fischer's real-time mutualexclusion protocol.