From boxes to worlds
- Autores
- Hirsch, Dan Francisco; Areces, Carlos Eduardo
- Año de publicación
- 1995
- Idioma
- inglés
- Tipo de recurso
- documento de conferencia
- Estado
- versión publicada
- Descripción
- In this paper we show an innovative way to represent graphic designs 01 systems and to verify design properties. The graphic designs are thought as models of an extended modal logic; and the methods used to verify properties are developed from techniques typical of classic modal logic, extended to cover the differences in the underlying formalism. We present the procedures orlogical tools to derive the modal model associated to a given design, the filtration of models and the construction 01 modal descriptions. A higher level of abstraction is obtained in this way, and it lets us reason over designs in a strictly formal manner. The power of formal provability is also achieved. We use a working example to show how our tools help to veri1y properties 01 design like the detection of cycles (self loops).
Eje: Diseño de software
Red de Universidades con Carreras en Informática (RedUNCI) - Materia
-
Ciencias Informáticas
Software Design
Graphic Languages
Modal Logics
Formal Verification
Languages
Software - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
- Repositorio
.jpg)
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/24296
Ver los metadatos del registro completo
| id |
SEDICI_7ff90358c974698d6ecd5dae15658ca6 |
|---|---|
| oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/24296 |
| network_acronym_str |
SEDICI |
| repository_id_str |
1329 |
| network_name_str |
SEDICI (UNLP) |
| spelling |
From boxes to worldsHirsch, Dan FranciscoAreces, Carlos EduardoCiencias InformáticasSoftware DesignGraphic LanguagesModal LogicsFormal VerificationLanguagesSoftwareIn this paper we show an innovative way to represent graphic designs 01 systems and to verify design properties. The graphic designs are thought as models of an extended modal logic; and the methods used to verify properties are developed from techniques typical of classic modal logic, extended to cover the differences in the underlying formalism. We present the procedures orlogical tools to derive the modal model associated to a given design, the filtration of models and the construction 01 modal descriptions. A higher level of abstraction is obtained in this way, and it lets us reason over designs in a strictly formal manner. The power of formal provability is also achieved. We use a working example to show how our tools help to veri1y properties 01 design like the detection of cycles (self loops).Eje: Diseño de softwareRed de Universidades con Carreras en Informática (RedUNCI)1995-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf266-276http://sedici.unlp.edu.ar/handle/10915/24296enginfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-11-05T12:35:42Zoai:sedici.unlp.edu.ar:10915/24296Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-11-05 12:35:42.853SEDICI (UNLP) - Universidad Nacional de La Platafalse |
| dc.title.none.fl_str_mv |
From boxes to worlds |
| title |
From boxes to worlds |
| spellingShingle |
From boxes to worlds Hirsch, Dan Francisco Ciencias Informáticas Software Design Graphic Languages Modal Logics Formal Verification Languages Software |
| title_short |
From boxes to worlds |
| title_full |
From boxes to worlds |
| title_fullStr |
From boxes to worlds |
| title_full_unstemmed |
From boxes to worlds |
| title_sort |
From boxes to worlds |
| dc.creator.none.fl_str_mv |
Hirsch, Dan Francisco Areces, Carlos Eduardo |
| author |
Hirsch, Dan Francisco |
| author_facet |
Hirsch, Dan Francisco Areces, Carlos Eduardo |
| author_role |
author |
| author2 |
Areces, Carlos Eduardo |
| author2_role |
author |
| dc.subject.none.fl_str_mv |
Ciencias Informáticas Software Design Graphic Languages Modal Logics Formal Verification Languages Software |
| topic |
Ciencias Informáticas Software Design Graphic Languages Modal Logics Formal Verification Languages Software |
| dc.description.none.fl_txt_mv |
In this paper we show an innovative way to represent graphic designs 01 systems and to verify design properties. The graphic designs are thought as models of an extended modal logic; and the methods used to verify properties are developed from techniques typical of classic modal logic, extended to cover the differences in the underlying formalism. We present the procedures orlogical tools to derive the modal model associated to a given design, the filtration of models and the construction 01 modal descriptions. A higher level of abstraction is obtained in this way, and it lets us reason over designs in a strictly formal manner. The power of formal provability is also achieved. We use a working example to show how our tools help to veri1y properties 01 design like the detection of cycles (self loops). Eje: Diseño de software Red de Universidades con Carreras en Informática (RedUNCI) |
| description |
In this paper we show an innovative way to represent graphic designs 01 systems and to verify design properties. The graphic designs are thought as models of an extended modal logic; and the methods used to verify properties are developed from techniques typical of classic modal logic, extended to cover the differences in the underlying formalism. We present the procedures orlogical tools to derive the modal model associated to a given design, the filtration of models and the construction 01 modal descriptions. A higher level of abstraction is obtained in this way, and it lets us reason over designs in a strictly formal manner. The power of formal provability is also achieved. We use a working example to show how our tools help to veri1y properties 01 design like the detection of cycles (self loops). |
| publishDate |
1995 |
| dc.date.none.fl_str_mv |
1995-10 |
| dc.type.none.fl_str_mv |
info:eu-repo/semantics/conferenceObject info:eu-repo/semantics/publishedVersion Objeto de conferencia http://purl.org/coar/resource_type/c_5794 info:ar-repo/semantics/documentoDeConferencia |
| format |
conferenceObject |
| status_str |
publishedVersion |
| dc.identifier.none.fl_str_mv |
http://sedici.unlp.edu.ar/handle/10915/24296 |
| url |
http://sedici.unlp.edu.ar/handle/10915/24296 |
| dc.language.none.fl_str_mv |
eng |
| language |
eng |
| dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) |
| eu_rights_str_mv |
openAccess |
| rights_invalid_str_mv |
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) |
| dc.format.none.fl_str_mv |
application/pdf 266-276 |
| dc.source.none.fl_str_mv |
reponame:SEDICI (UNLP) instname:Universidad Nacional de La Plata instacron:UNLP |
| reponame_str |
SEDICI (UNLP) |
| collection |
SEDICI (UNLP) |
| instname_str |
Universidad Nacional de La Plata |
| instacron_str |
UNLP |
| institution |
UNLP |
| repository.name.fl_str_mv |
SEDICI (UNLP) - Universidad Nacional de La Plata |
| repository.mail.fl_str_mv |
alira@sedici.unlp.edu.ar |
| _version_ |
1847978373075173376 |
| score |
13.087074 |