Zobrazeno 1 - 10
of 52
pro vyhledávání: '"Oliveira, José N."'
Based on the connection between the categorical derivation of classical programs from specifications and the category-theoretic approach to quantum physics, this paper contributes to extending the laws of classical program algebra to quantum programm
Externí odkaz:
http://arxiv.org/abs/2010.10510
Autor:
Afonso, João M., Fernandes, Gabriel D., Fernandes, João P., Oliveira, Filipe, Ribeiro, Bruno M., Pontes, Rogério, Oliveira, José N., Proença, Alberto J.
This paper uses typed linear algebra (LA) to represent data and perform analytical querying in a single, unified framework. The typed approach offers strong type checking (as in modern programming languages) and a diagrammatic way of expressing queri
Externí odkaz:
http://arxiv.org/abs/1809.00641
Autor:
Macedo, Hugo Daniel, Oliveira, José N.
Interested in formalizing the generation of fast running code for linear algebra applications, the authors show how an index-free, calculational approach to matrix algebra can be developed by regarding matrices as morphisms of a category with biprodu
Externí odkaz:
http://arxiv.org/abs/1312.4818
Autor:
Oliveira, Jose N.
Inspired by the trend on unifying theories of programming, this paper shows how the algebraic treatment of standard data dependency theory equips relational data with functional types and an associated type system which is useful for type checking da
Externí odkaz:
http://arxiv.org/abs/1210.4661
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Runge, Tobias, Thüm, Thomas, Cleophas, Loek, Schaefer, Ina, Watson, Bruce W., Sekerinski, Emil, Moreira, Nelma, Oliveira, José N., Ratiu, Daniel, Guidotti, Riccardo, Farrell, Marie, Luckcuck, Matt, Marmsoler, Diego, Campos, José, Astarte, Troy, Gonnord, Laure, Cerone, Antonio, Couto, Luis, Dongol, Brijesh, Kutrib, Martin, Monteiro, Pedro, Delmas, David
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030549961
FM Workshops (2)
Formal Methods. FM 2019 International Workshops-Revised Selected Papers, 388-405
STARTPAGE=388;ENDPAGE=405;TITLE=Formal Methods. FM 2019 International Workshops-Revised Selected Papers
FM Workshops (2)
Formal Methods. FM 2019 International Workshops-Revised Selected Papers, 388-405
STARTPAGE=388;ENDPAGE=405;TITLE=Formal Methods. FM 2019 International Workshops-Revised Selected Papers
Correctness-by-construction (CbC) is a refinement-based methodology to incrementally create formally correct programs. Programs are constructed using refinement rules which guarantee that the resulting implementation is correct with respect to a pre-
Autor:
Jongmans, Sung-Shik, Lamers, Arjan, van Eekelen, M.C.J.D., ter Beek, Maurice H., McIver, Annabelle, Oliveira, José N.
Publikováno v:
Formal Methods – The Next 30 Years: Third World Congress, FM 2019, Porto, Portugal, October 7–11, 2019, Proceedings, 689-706
STARTPAGE=689;ENDPAGE=706;TITLE=Formal Methods – The Next 30 Years
Beek, M.H. ter (ed.), Formal Methods – The Next 30 Years: Third World Congress, FM 2019, Porto, Portugal, October 7–11, 2019. Proceedings, pp. 689-706
Jongmans, S-S, Lamers, A & van Eekelen, M C J D 2019, SOA and the Button Problem . in M H ter Beek, A McIver & J N Oliveira (eds), Formal Methods – The Next 30 Years : Third World Congress, FM 2019, Porto, Portugal, October 7–11, 2019, Proceedings . Springer, Cham, Lecture Notes in Computer Science, vol. 11800, pp. 689-706, 3rd World Congress on Formal Methods, Porto, Portugal, 7/10/19 . https://doi.org/10.1007/978-3-030-30942-8_40
Beek, M.H. ter (ed.), Formal Methods – The Next 30 Years: Third World Congress, FM 2019, Porto, Portugal, October 7–11, 2019. Proceedings, 689-706. Cham : Springer
STARTPAGE=689;ENDPAGE=706;ISSN=0302-9743;TITLE=Beek, M.H. ter (ed.), Formal Methods – The Next 30 Years: Third World Congress, FM 2019, Porto, Portugal, October 7–11, 2019. Proceedings
Lecture Notes in Computer Science ISBN: 9783030309411
FM
STARTPAGE=689;ENDPAGE=706;TITLE=Formal Methods – The Next 30 Years
Beek, M.H. ter (ed.), Formal Methods – The Next 30 Years: Third World Congress, FM 2019, Porto, Portugal, October 7–11, 2019. Proceedings, pp. 689-706
Jongmans, S-S, Lamers, A & van Eekelen, M C J D 2019, SOA and the Button Problem . in M H ter Beek, A McIver & J N Oliveira (eds), Formal Methods – The Next 30 Years : Third World Congress, FM 2019, Porto, Portugal, October 7–11, 2019, Proceedings . Springer, Cham, Lecture Notes in Computer Science, vol. 11800, pp. 689-706, 3rd World Congress on Formal Methods, Porto, Portugal, 7/10/19 . https://doi.org/10.1007/978-3-030-30942-8_40
Beek, M.H. ter (ed.), Formal Methods – The Next 30 Years: Third World Congress, FM 2019, Porto, Portugal, October 7–11, 2019. Proceedings, 689-706. Cham : Springer
STARTPAGE=689;ENDPAGE=706;ISSN=0302-9743;TITLE=Beek, M.H. ter (ed.), Formal Methods – The Next 30 Years: Third World Congress, FM 2019, Porto, Portugal, October 7–11, 2019. Proceedings
Lecture Notes in Computer Science ISBN: 9783030309411
FM
Service-oriented architecture (SOA) is a popular architectural style centered around services, loose coupling, and interoperability. A recurring problem in SOA development is the Button Problem; how to ensure that whenever a “button is pressed” o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c82b9201aa82ecc773b72586e51d2aba
https://doi.org/10.1007/978-3-030-30942-8_40
https://doi.org/10.1007/978-3-030-30942-8_40
Autor:
Barbosa, Luís S. e1, Oliveira, José N.
Publikováno v:
In Theoretical Computer Science 2006 365(1):2-22