Graph proof procedure for real time logic

Jung Hong Kao; Lawrence Joseph Henschen

Graph proof procedure for real time logic

Jung Hong Kao^*, Lawrence Joseph Henschen

^*Corresponding author for this work

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

The Real Time Logic (RTL) have been successful in specifying and verifying a class of timing requirements in real-time systems. We proposed a graph proof procedure for RTL formulae. First, we represent the RTL formulae in a connection graph like structure. Based on this graph, we have found some useful deduction rules and reduction rules. From some preliminary experiments, we show that our proof procedure is very efficient.

Original language	English (US)
Title of host publication	Proceedings of the 4th International Conference on Software Engineering and Knowledge Engineering
Publisher	Publ by IEEE
Pages	300-306
Number of pages	7
ISBN (Print)	0818628308
State	Published - Dec 1 1992
Event	Proceedings of the 4th International Conference on Software Engineering and Knowledge Engineering - Capri, Italy Duration: Jun 15 1992 → Jun 20 1992

Other

Other	Proceedings of the 4th International Conference on Software Engineering and Knowledge Engineering
City	Capri, Italy
Period	6/15/92 → 6/20/92

ASJC Scopus subject areas

General Engineering

Cite this

@inproceedings{60e8ff4177ee40a7a96e2f7413a75636,

title = "Graph proof procedure for real time logic",

abstract = "The Real Time Logic (RTL) have been successful in specifying and verifying a class of timing requirements in real-time systems. We proposed a graph proof procedure for RTL formulae. First, we represent the RTL formulae in a connection graph like structure. Based on this graph, we have found some useful deduction rules and reduction rules. From some preliminary experiments, we show that our proof procedure is very efficient.",

author = "Kao, {Jung Hong} and Henschen, {Lawrence Joseph}",

year = "1992",

month = dec,

day = "1",

language = "English (US)",

isbn = "0818628308",

pages = "300--306",

booktitle = "Proceedings of the 4th International Conference on Software Engineering and Knowledge Engineering",

publisher = "Publ by IEEE",

note = "Proceedings of the 4th International Conference on Software Engineering and Knowledge Engineering ; Conference date: 15-06-1992 Through 20-06-1992",

}

TY - GEN

T1 - Graph proof procedure for real time logic

AU - Kao, Jung Hong

AU - Henschen, Lawrence Joseph

PY - 1992/12/1

Y1 - 1992/12/1

N2 - The Real Time Logic (RTL) have been successful in specifying and verifying a class of timing requirements in real-time systems. We proposed a graph proof procedure for RTL formulae. First, we represent the RTL formulae in a connection graph like structure. Based on this graph, we have found some useful deduction rules and reduction rules. From some preliminary experiments, we show that our proof procedure is very efficient.

AB - The Real Time Logic (RTL) have been successful in specifying and verifying a class of timing requirements in real-time systems. We proposed a graph proof procedure for RTL formulae. First, we represent the RTL formulae in a connection graph like structure. Based on this graph, we have found some useful deduction rules and reduction rules. From some preliminary experiments, we show that our proof procedure is very efficient.

UR - http://www.scopus.com/inward/record.url?scp=0026958421&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026958421&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0026958421

SN - 0818628308

SP - 300

EP - 306

BT - Proceedings of the 4th International Conference on Software Engineering and Knowledge Engineering

PB - Publ by IEEE

T2 - Proceedings of the 4th International Conference on Software Engineering and Knowledge Engineering

Y2 - 15 June 1992 through 20 June 1992

ER -

Graph proof procedure for real time logic

Abstract

Other

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this