You are in : Home » Results & submissions » Select UOA » 11 - Computer Science and Informatics » View submission: University of Westminster » Outputs » Detail

Output details

11 - Computer Science and Informatics

University of Westminster

Return to search Previous output Next output

Output 41 of 79 in the submission

Output title

Handling periodic properties: deductive verification for quantified temporal logic specifications

Type

E - Conference contribution

DOI

10.1109/SSIRI-C.2011.41

Name of conference/published proceedings

5th International Conference on Secure Software Integration and Reliability Improvement Companion

Volume number

Issue number

First page of article

179

ISSN of proceedings

Year of publication

2011

URL

http://westminsterresearch.wmin.ac.uk/10951/

Number of additional authors

Additional information

<10> Originality: Periodic properties are important in many areas, in particular in software integration. One of them, that “event or process occurs at every even moment of a computation”, is a famous milestone in mathematical modelling of reliable integration. Quantified propositional temporal logic can express this property but it lacked an efficient deductive based verification method – the problem which is solved in this paper.

Significance: The paper introduces natural deduction based proof technique for the above formalism thus opening prospects for the efficient implementation.

Rigour: Mathematical proofs of the soundness and completeness of the proposed method are established.

Interdisciplinary

Cross-referral requested

Research group

None

Citation count

Proposed double-weighted

Double-weighted statement

Reserve for a double-weighted output

Non-English

English abstract