Automated Verification of Executable UML Models

2011 ◽  
pp. 225-250 ◽  
Author(s):  
Helle Hvid Hansen ◽  
Jeroen Ketema ◽  
Bas Luttik ◽  
MohammadReza Mousavi ◽  
Jaco van de Pol ◽  
...  
Keyword(s):  
Automated Verification ◽  
Uml Models

MADES: A Tool Chain for Automated Verification of UML Models of Embedded Systems

2012 ◽  
pp. 340-351 ◽  
Author(s):  
Alek Radjenovic ◽  
Nicholas Matragkas ◽  
Richard F. Paige ◽  
Matteo Rossi ◽  
Alfredo Motta ◽  
...  
Keyword(s):  
Embedded Systems ◽  
Automated Verification ◽  
Tool Chain ◽  
Uml Models

Effective UML models by using database system

2013 ◽  
Vol 1 (1) ◽  
pp. 1-3
Author(s):  
Faisal Halim ◽  
◽  
Rizal Muttaqin ◽  
Keyword(s):  
Database System ◽  
Uml Models

Teaching UML Models with FLOSS Projects

2020 ◽  
Author(s):  
Fernanda Gomes Silva ◽  
Moara Sousa Brito Lessa ◽  
Nádia da Luz Lopes ◽  
Christina von Flach G. Chavez
Keyword(s):  
Uml Models

scholarly journals Preface of Automated Verification of Critical Systems 2010 (AVoCS 2010)

2014 ◽  
Vol 81 ◽  
pp. 1-2
Author(s):  
Jens Bendisposto ◽  
Michael Leuschel ◽  
Markus Roggenbach
Keyword(s):  
Automated Verification ◽  
Critical Systems

scholarly journals CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates

2011 ◽  
Vol 21 (4) ◽  
pp. 827-859 ◽  
Author(s):  
FRÉDÉRIC BLANQUI ◽  
ADAM KOPROWSKI
Keyword(s):  
Term Rewriting ◽  
Automated Verification ◽  
Proof Assistant ◽  
Proof Assistants ◽  
Active Subject ◽  
Turing Complete

Termination is an important property of programs, and is notably required for programs formulated in proof assistants. It is a very active subject of research in the Turing-complete formalism of term rewriting. Over the years, many methods and tools have been developed to address the problem of deciding termination for specific problems (since it is undecidable in general). Ensuring the reliability of those tools is therefore an important issue.In this paper we present a library formalising important results of the theory of well-founded (rewrite) relations in the proof assistant Coq. We also present its application to the automated verification of termination certificates, as produced by termination tools.The sources are freely available athttp://color.inria.fr/.

Sign in / Sign up

Export Citation Format

Share Document