Fork algebras as a sufficiently rich universal institution
Algebraization of computational logics in the theory of fork algebras has been a research topic for a while. This research allowed us to interpret classical first-order logic, several prepositional monomodal logics, prepositional and first-order dynamic logic, and prepositional and first-order linea...
Guardado en:
| Autor principal: | |
|---|---|
| Otros Autores: | |
| Formato: | Acta de conferencia Capítulo de libro |
| Lenguaje: | Inglés |
| Publicado: |
Springer Verlag
2006
|
| Materias: | |
| Acceso en línea: | Registro en Scopus Handle Registro en la Biblioteca Digital |
| Aporte de: | Registro referencial: Solicitar el recurso aquí |
| LEADER | 06872caa a22006257a 4500 | ||
|---|---|---|---|
| 001 | PAPER-7078 | ||
| 003 | AR-BaUEN | ||
| 005 | 20230518203649.0 | ||
| 008 | 190411s2006 xx ||||fo|||| 00| 0 eng|d | ||
| 024 | 7 | |2 scopus |a 2-s2.0-33746042977 | |
| 040 | |a Scopus |b spa |c AR-BaUEN |d AR-BaUEN | ||
| 100 | 1 | |a Pombo, C.G.L. | |
| 245 | 1 | 0 | |a Fork algebras as a sufficiently rich universal institution |
| 260 | |b Springer Verlag |c 2006 | ||
| 270 | 1 | 0 | |m Pombo, C.G.L.; Department of Computer Science, FCEyN, Ciudad Universitaria, Pabelló I, Buenos Aires (1428), Argentina; email: clpombo@dc.uba.ar |
| 506 | |2 openaire |e Política editorial | ||
| 504 | |a Booch, G., Rumbaugh, J., Jacobson, I., (1998) The Unified Modeling Language User Guide, , Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA | ||
| 504 | |a Frias, M.F., Fork algebras in algebra, logic and computer science (2002) Advances in Logic, 2. , World Scientific Publishing Co., Singapore | ||
| 504 | |a Frias, M.F., Orlowska, E., Equational reasoning in non-classical logics (1998) Journal of Applied Non-classical Logics, 8, pp. 27-66 | ||
| 504 | |a Frias, M.F., Baum, G.A., Maibaum, T.S.E., Interpretability of first-order dynamic logic in a relational calculus (2002) Lecture Notes in Computer Science, 2561, pp. 66-80. , de Swart, H., ed.: Proceedings of the 6th. Conference on Relational Methods in Computer Science (ReIMiCS) - TARSKI. Oisterwijk, The Netherlands, Springer-Verlag | ||
| 504 | |a Frias, M.F., Lopez Pombo, C.G., Time is on my side (2003) Proceedings of the 7th. Conference on Relational Methods in Computer Science (RelMiCS) - 2nd. International Workshop on Applications of Kleene Algebra, pp. 105-111. , Berghammer, R., Möller, B., eds.: Malente, Germany | ||
| 504 | |a Frias, M.F., Lopez Pombo, C.G., Interpretability of first-order linear temporal logics in fork algebras (2006) Journal of Logic and Algebraic Programming, 66, pp. 161-184 | ||
| 504 | |a Goguen, J.A., Burstall, R.M., Introducing institutions (1984) Lecture Notes in Computer Science, 184, pp. 221-256. , Clarke, E.M., Kozen, D., eds.: Proceedings of the Carnegie Mellon Workshop on Logic of Programs. Springer-Verlag | ||
| 504 | |a Meseguer, J., General logics (1989) Proceedings of the Logic Colloquium '87, 129, pp. 275-329. , Ebbinghaus, H.D., Fernandez-Prida, J., Garrido, M., Lascar, D., Artalejo, M.R., eds.: Granada, Spain, North Holland | ||
| 504 | |a Tarlecki, A., Moving between logical systems (1996) Lecture Notes in Computer Science, 1130, pp. 478-502. , Haveraaen, M., Owe, O., Dahl, O.J., eds,: Selected papers from the 11th Workshop on Specification of Abstract Data Types Joint with the 8th COMPASS Workshop on Recent Trends in Data Type Specification. Springer-Verlag | ||
| 504 | |a Frias, M.F., Gamarra, R., Steren, G., Bourg, L., A strategy for efficient verification of relational specification, based in monotonicity analysis (2005) Proceedings of the 20th. IEEE/ACM International Conference on Automated Software Engineering, pp. 305-308. , Redmiles, D.F., Ellman, T., Zisman, A., eds.: Long Beach, California, USA, Association for the Computer Machinery and IEEE Computer Society, ACM Press | ||
| 504 | |a Lopez Pombo, C.G., Owre, S., Shankar, N., A semantic embedding of the Ag dynamic logic in PVS (2002) Technical Report, SRI-CSL-02-04. , Computer Science Laboratory, SRI International | ||
| 504 | |a Tarski, A., On the calculus of relations (1941) Journal of Symbolic Logic, 6, pp. 73-89 | ||
| 504 | |a Maddux, R.D., Finitary algebraic logic (1989) Zeitschrift fur Mathematisch Logik und Grundlagen der Mathematik, 35, pp. 321-332 | ||
| 504 | |a Burris, S., Sankappanavar, H.P., (1981) A Course in Universal Algebra. Graduate Texts in Mathematics, , Springer-Verlag, Berlin, Germany | ||
| 504 | |a Fiadeiro, J.L., Sernadas, A., Structuring theories on consequence (1987) Lecture Notes in Computer Science, pp. 44-72. , Tarlecki, A., Sannella, D., eds.: Selected papers from the 5th Workshop on Specification of Abstract Data Types. Gullane, Scotland, Springer-Verlag | ||
| 504 | |a Fiadeiro, J.L., (2005) Categories for Software Engineering, , Springer-Verlag | ||
| 504 | |a Fiadeiro, J.L., On the emergence of properties in component-based systems (1996) Lecture Notes in Computer Science, 1101. , Wirsing, M., Nivat, M., eds.: Proceedings of the 1996 Algebraic Methodology and Software Technology - AMAST 96. Munich, Germany, Springer-VerlagA4 - Estonian Ministry of Education and Research, NCEP; Tallinn University of Technol., Inst. of Cybern., Estonia | ||
| 520 | 3 | |a Algebraization of computational logics in the theory of fork algebras has been a research topic for a while. This research allowed us to interpret classical first-order logic, several prepositional monomodal logics, prepositional and first-order dynamic logic, and prepositional and first-order linear temporal logic in the theory of fork algebras. In this paper we formalize these interpretability results as institution representations from the institution of the corresponding logics to that of fork algebra. We also advocate for the institution of fork algebras as a sufficiently rich universal institution into which institutions meaningful in software development can be represented. © Springer-Verlag Berlin Heidelberg 2006. |l eng | |
| 593 | |a Department of Computer Science, FCEyN, Ciudad Universitaria, Pabelló I, Buenos Aires (1428), Argentina | ||
| 593 | |a CONICET, Argentina | ||
| 690 | 1 | 0 | |a ARTIFICIAL INTELLIGENCE |
| 690 | 1 | 0 | |a COMPUTATIONAL COMPLEXITY |
| 690 | 1 | 0 | |a COMPUTER SCIENCE |
| 690 | 1 | 0 | |a FORMAL LOGIC |
| 690 | 1 | 0 | |a SOFTWARE ENGINEERING |
| 690 | 1 | 0 | |a COMPUTATIONAL LOGICS |
| 690 | 1 | 0 | |a FORK ALGEBRAS |
| 690 | 1 | 0 | |a MONOMODAL LOGICS |
| 650 | 1 | 7 | |2 spines |a ALGEBRA |
| 700 | 1 | |a Frias, M.F. | |
| 711 | 2 | |c Kuressaare |d 5 July 2006 through 8 July 2006 |g Código de la conferencia: 67877 | |
| 773 | 0 | |d Springer Verlag, 2006 |g v. 4019 LNCS |h pp. 235-247 |p Lect. Notes Comput. Sci. |n Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |x 03029743 |w (AR-BaUEN)CENRE-983 |z 3540356339 |z 9783540356332 |t 11th International Conference on Algebraic Methodology and Software Technology, AMAST 2006 | |
| 856 | 4 | 1 | |u https://www.scopus.com/inward/record.uri?eid=2-s2.0-33746042977&partnerID=40&md5=34d95214d45e0c0ac534a33fb4349414 |y Registro en Scopus |
| 856 | 4 | 0 | |u https://hdl.handle.net/20.500.12110/paper_03029743_v4019LNCS_n_p235_Pombo |y Handle |
| 856 | 4 | 0 | |u https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v4019LNCS_n_p235_Pombo |y Registro en la Biblioteca Digital |
| 961 | |a paper_03029743_v4019LNCS_n_p235_Pombo |b paper |c PE | ||
| 962 | |a info:eu-repo/semantics/article |a info:ar-repo/semantics/artículo |b info:eu-repo/semantics/publishedVersion | ||
| 963 | |a VARI | ||
| 999 | |c 68031 | ||