Computer Aided Verification of Relational Models by Strategic Rewriting
Binary relational algebra provides semantic foundations for major areas of computing, such as database design, state-based modeling and functional programming. Remarkably, static checking support in these areas fails to exploit the full semantic content of relations. In particular, properties such a...
Main Authors: | Claudia Mónica Necco, José N. Oliveira, Joost Visser, Roberto Uzal |
---|---|
Format: | Article |
Language: | English |
Published: |
Postgraduate Office, School of Computer Science, Universidad Nacional de La Plata
2017-10-01
|
Series: | Journal of Computer Science and Technology |
Subjects: | |
Online Access: | https://journal.info.unlp.edu.ar/JCST/article/view/437 |
Similar Items
-
Exploiting model structure in CEGAR verification method
by: Chucri, Farès
Published: (2012) -
Abstraction for Verification and Refutation in Model Checking
by: Wei, Ou
Published: (2009) -
Abstraction for Verification and Refutation in Model Checking
by: Wei, Ou
Published: (2009) -
The Omnibus language and integrated verification approach
by: Wilson, Thomas
Published: (2007) -
A Determined Algorithm of Code Analysis of Commodity Software
by: Ilya Viktorovich Arzamartsev, et al.
Published: (2013-12-01)