Proceedings 16th International Parallel and Distributed Processing Symposium 2002
DOI: 10.1109/ipdps.2002.1016615
|View full text |Cite
|
Sign up to set email alerts
|

Mixed formal specifications with PVS

Abstract: Abstract

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2003
2003
2003
2003

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 13 publications
0
2
0
Order By: Relevance
“…Lastly our approach is different on the semantic target: we choose an homogeneous approach based on partial algebraic data types and the use of a theorem prover. Here we use the Larch Prover tool, however our technique has been extended to PVS in [11]. Our approach is able to check inconsistency and also to prove both dynamic properties and data properties as expected in a real framework.…”
Section: Extensions and Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Lastly our approach is different on the semantic target: we choose an homogeneous approach based on partial algebraic data types and the use of a theorem prover. Here we use the Larch Prover tool, however our technique has been extended to PVS in [11]. Our approach is able to check inconsistency and also to prove both dynamic properties and data properties as expected in a real framework.…”
Section: Extensions and Related Workmentioning
confidence: 99%
“…It allows us to use prover tools like the Larch Prover [7] or PVS [8] for example. Of course we do not address all these problems in this current paper, complementary references are [9,10,5,11,12]. We will restrict our study to the translation of UML sequential and concurrent components with data into formal specifications.…”
Section: Introductionmentioning
confidence: 99%