Zobrazeno 1 - 10
of 75
pro vyhledávání: '"Logics of programs"'
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:
De Giacomo, Giuseppe
Publikováno v:
Journal of Logic, Language, and Information, 1996 Apr 01. 5(2), 193-208.
Externí odkaz:
https://www.jstor.org/stable/40180095
Autor:
Lepigre, Rodolphe
Publikováno v:
Programming Languages [cs.PL]. Université Grenoble Alpes, 2017. English. ⟨NNT : 2017GREAM034⟩
Computer Science [cs]. Grenoble 1 UGA-Université Grenoble Alpes, 2017. English
Computer Science [cs]. Grenoble 1 UGA-Université Grenoble Alpes, 2017. English
In recent years, proof assistant have reached an impressive level of maturity. They have led to the certification of complex programs such as compilers and operating systems. Yet, using a proof assistant requires highly specialised skills and it rema
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::f9d04e1169b3924484461f845dc088aa
https://tel.archives-ouvertes.fr/tel-01682908/file/LEPIGRE_2017_archivage.pdf
https://tel.archives-ouvertes.fr/tel-01682908/file/LEPIGRE_2017_archivage.pdf
Autor:
Cécé, Gérard
Publikováno v:
Symposium on Logic in Computer Science
Symposium on Logic in Computer Science, Jun 2017, Reykjavik, Iceland
Symposium on Logic in Computer Science, Jun 2017, Reykjavik, Iceland
Compute the coarsest simulation preorder included in an initial preorder is used to reduce the resources needed to analyze a given transition system. This technique is applied on many models like Kripke structures, labeled graphs, labeled transition
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::de3d148f2f346d65a84474b4180c50ad
https://hal.archives-ouvertes.fr/hal-01579331/file/fsesa_cece_hal.pdf
https://hal.archives-ouvertes.fr/hal-01579331/file/fsesa_cece_hal.pdf
Autor:
Montin, Mathieu, Pantel, Marc
CCSL is a concurrency modeling language defined inside the MARTE UML profile. It was designed to provide system designers with requirement modeling facilities that are easier to master than temporal logics. It allows the expression of event occurrenc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::fc942ee034ecd8772df02dfc9cbbde84
https://hal.archives-ouvertes.fr/hal-01503384
https://hal.archives-ouvertes.fr/hal-01503384
Autor:
Lepigre, Rodolphe
Publikováno v:
Computer Science [cs]. Grenoble 1 UGA-Université Grenoble Alpes, 2017. English
In recent years, proof assistant have reached an impressive level of maturity. They have led to the certification of complex programs such as compilers and operating systems. Yet, using a proof assistant requires highly specialised skills and it rema
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::2d97d9f59b483f814a15d9bc3b321964
https://hal.inria.fr/tel-01590363
https://hal.inria.fr/tel-01590363
Autor:
De Rijke, Maarten
Publikováno v:
Journal of Logic, Language, and Information, 1995 Jan 01. 4(3), 227-250.
Externí odkaz:
https://www.jstor.org/stable/40180073
Publikováno v:
FOSSACS 2016
FOSSACS 2016, Apr 2016, Eindhoven, Netherlands
Lecture Notes in Computer Science ISBN: 9783662496299
FoSSaCS
FOSSACS 2016, Apr 2016, Eindhoven, Netherlands
Lecture Notes in Computer Science ISBN: 9783662496299
FoSSaCS
It follows from known results in the literature that least and greatest fixed-points of monotone polynomials on Heyting algebras—that is, the algebraic models of the Intuitionistic Propositional Calculus—always exist, even when these algebras are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::16d89cc85903000b0b7f81fd56928c1e
https://hal.archives-ouvertes.fr/hal-01249822
https://hal.archives-ouvertes.fr/hal-01249822
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:
J., Hilston, de Alfaro, Luca, Faella, Marco, M.Z., Kwiatkowska, Telek, M., Stoelinga, Mariëlle Ida Antoinette
Publikováno v:
IEEE transactions on software engineering, 35(2):10.1109/TSE.2008.106, 258-273. IEEE
We extend the classical system relations of trace inclusion, trace equivalence, simulation, and bisimulation to a quantitative setting in which propositions are interpreted not as boolean values, but as elements of arbitrary metric spaces. Trace incl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b810f2da492b29d48f1d786cdd96b384
https://doi.org/10.1109/tse.2008.106
https://doi.org/10.1109/tse.2008.106