Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Purandar Bhaduri"'
Autor:
Purandar Bhaduri
Publikováno v:
Logical Methods in Computer Science, Vol Volume 19, Issue 1 (2023)
Weighted automata are a generalization of nondeterministic automata that associate a weight drawn from a semiring $K$ with every transition and every state. Their behaviours can be formalized either as weighted language equivalence or weighted bisimu
Externí odkaz:
https://doaj.org/article/3572b6e9b39f4f08964d4394aa562c62
Autor:
Lalatendu Behera, Purandar Bhaduri
Publikováno v:
Design Automation for Embedded Systems. 24:79-109
Real-time safety-critical systems are getting more complicated due to the introduction of mixed-criticality systems. The increasing use of mixed-criticality systems has motivated the real-time systems research community to investigate various non-fun
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c2deefd0ee4e7a9744490964e0deb1c9
https://doi.org/10.1007/s10617-019-09232-3
https://doi.org/10.1007/s10617-019-09232-3
Publikováno v:
IET Software. 13:280-285
Path-based equivalence checkers (PBECs) have been successfully applied for verification of programmes from diverse domains and from various stages of high-level synthesis. In the case of non-equivalence, PBEC provides very little information which is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::586a0ee9ab0a1c349a0a5e4ab359f2f1
https://doi.org/10.1049/iet-sen.2018.5203
https://doi.org/10.1049/iet-sen.2018.5203
Publikováno v:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 38:1378-1382
Translation validation is the process of proving that the target code is a correct translation of the source program being compiled. In this paper, we propose a translation validation method to verify code motion transformations involving loops appli
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::411908ee0d6fc7f5680900957c4bd58e
https://doi.org/10.1109/tcad.2018.2846654
https://doi.org/10.1109/tcad.2018.2846654
Autor:
Purandar Bhaduri, Lalatendu Behera
Publikováno v:
ACM Transactions on Design Automation of Electronic Systems. 22:1-25
Real-time and embedded systems are moving from the traditional design paradigm to integration of multiple functionalities onto a single computing platform. Some of the functionalities are safety critical and subject to certification. The rest of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7aea03c7b560320d60377db06a93b36c
https://doi.org/10.1145/3073415
https://doi.org/10.1145/3073415
Publikováno v:
International Journal of Algebra and Computation. 27:273-297
In order to study the axiomatization of the if-then-else construct over possibly non-halting programs and tests, this paper introduces the notion of [Formula: see text]-sets by considering the tests from an abstract [Formula: see text]-algebra. When
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::11650c44a0bdc39d0e26a7a30b562737
https://doi.org/10.1142/s0218196717500138
https://doi.org/10.1142/s0218196717500138
Publikováno v:
ISEC
Translation validation is the process of proving that the target code is a correct translation of the source program being compiled. In this work, we propose a translation validation method to verify code motion transformations involving loops applie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::48de443616405d2d8785143c1f71a557
https://doi.org/10.1145/3299771.3299797
https://doi.org/10.1145/3299771.3299797
Publikováno v:
VLSI Design
Path-based equivalence checkers (PBECs) have been successfully applied for verification of programs from diverse domains and at various stages of high-level synthesis. These verifiers can be sound but not complete. Therefore, non-equivalence cases re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d0d6730cf51bb4e6d7a7ed071bfa8e97
https://doi.org/10.1109/vlsid.2019.00083
https://doi.org/10.1109/vlsid.2019.00083
Publikováno v:
Algebra universalis. 79
In order to study the axiomatization of the if-then-else construct over possibly non-halting programs and tests, the notion of C-sets was introduced in the literature by considering the tests from an abstract C-algebra. This paper extends the notion
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::165095c3ed74226914bd756212216e1a
https://doi.org/10.1007/s00012-018-0490-3
https://doi.org/10.1007/s00012-018-0490-3
This paper investigates the notions of atoms and atomicity in C-algebras and obtains a characterisation of atoms in the C-algebra of transformations. In this connection, various characterisations for the existence of suprema of subsets of C-algebras
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f77b0ff271fb5220df2534191d4255a1
