2005
DOI: 10.1007/s10270-004-0058-x
|View full text |Cite
|
Sign up to set email alerts
|

The KeY tool

Abstract: KeY is a tool that provides facilities for formal specification and verification of programs within a commercial platform for UML based software development. Using the KeY tool, formal methods and object-oriented development techniques are applied in an integrated manner. Formal specification is performed using the Object Constraint Language (OCL), which is part of the UML standard. KeY provides support for the authoring and formal analysis of OCL constraints. The target language of KeY based development is Ja… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
116
0
1

Year Published

2005
2005
2016
2016

Publication Types

Select...
7
1

Relationship

2
6

Authors

Journals

citations
Cited by 178 publications
(117 citation statements)
references
References 35 publications
0
116
0
1
Order By: Relevance
“…The KeY system [1] allows one to verify Java programs against Jml specifications. KeY handles assignable clauses, but not datagroups.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…The KeY system [1] allows one to verify Java programs against Jml specifications. KeY handles assignable clauses, but not datagroups.…”
Section: Related Workmentioning
confidence: 99%
“…Both approaches have already been taken to check assignable clauses, however datagroups pose a problem on both sides. Many static verification tools [1,3,5,9,10,11] support assignable clause to some extent; some partly support static datagroups, but no static verification tool currently supports dynamic datagroups. To precisely reason about dynamic datagroups, a verification environment produces proof obligations that have to be discharged manually, as checking the containment in a dynamic datagroup is essentially a reachability problem, which is not handled well by SMT solvers.…”
Section: Introductionmentioning
confidence: 99%
“…OCL is translatable to first order logics [1,2] and quite capable to represent PIM business rules. As SBVR and ODM standards should be interoperable with other OMG standards it is purposeful to consider them during develment of methodology for modelling PIM business rules.…”
Section: Related Workmentioning
confidence: 99%
“…Considering research related with OCL templates it is worth to mention general OCL templates implemented in Rational Software Architect [31,32]; our own research in developing stereotypes and templates for integrity constraints [16,19]; the work [4]; attempts to transform OCL to natural language [1].…”
Section: Related Workmentioning
confidence: 99%
“…Some special purpose logics such as Hoare-Logic [17], Dynamic Logic [18] or even tools such as KeY [19] could be used to formally show this entailment relationship. The fact that restrictive contracts are comparably weak is also illustrated by the presence of the well-known frame problem [20,21].…”
Section: Restrictive Vs Constructive Languagesmentioning
confidence: 99%