Zobrazeno 1 - 10
of 204
pro vyhledávání: '"Aziz, Abdulla"'
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.
Publikováno v:
Journal of University of Raparin. 9:206-232
The Princedom of Tahiri in Khorasan area during Abbasid caliphate followed a strict policy in front of the regions of Tabristan and Jurjan aiming to expand their ruling range in these areas supported by Abbasid caliphate. The Tahiris’ were consider
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9ba80d8af4e5efda4e52aacc2099c26f
https://doi.org/10.26750/vol(9).no(2).paper9
https://doi.org/10.26750/vol(9).no(2).paper9
Autor:
Aziz, Abdulla Ibrahim1 abdulla.aziz@raparinuni.org, Mohammed, Sarkhel Shawkat2 sarkhel.mohammed@charmouniversity.org, Muhammed, Hazhar Omer3 hazharbus@gmail.com, Sadq, Zana Majed4 zans.sadq@koyauniversity.org, Othman, Bestoon Abdulmaged5 bestoon2011@yahoo.com
Publikováno v:
UKH Journal of Social Sciences (UKHJSS). 2021, Vol. 5 Issue 2, p25-33. 9p.
Autor:
Parosh Aziz Abdulla, Mohamad Faouzi Atig, Florian Furbach, Adwait A. Godbole, Yacoub G. Hendi, Shankara N. Krishna, Stephan Spengler
Publikováno v:
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783031308222
We consider parameterized verification of systems executing according to the total store ordering (TSO) semantics. The processes manipulate abstract data types over potentially infinite domains. We present a framework that translates the reachability
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::360ff67fd386085e91472f2ba7dd32c4
https://doi.org/10.1007/978-3-031-30823-9_30
https://doi.org/10.1007/978-3-031-30823-9_30
Autor:
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Stefanos Kaxiras, Carl Leonardsson, Alberto Ros, Yunyun Zhu
Publikováno v:
Logical Methods in Computer Science, Vol Volume 14, Issue 1 (2018)
Cache coherence protocols based on self-invalidation and self-downgrade have recently seen increased popularity due to their simplicity, potential performance efficiency, and low energy consumption. However, such protocols result in memory instructio
Externí odkaz:
https://doaj.org/article/312a3fcfaf2148e288118a8328f83217
Publikováno v:
Logical Methods in Computer Science, Vol Volume 14, Issue 1 (2018)
We address the problem of verifying safety properties of concurrent programs running over the Total Store Order (TSO) memory model. Known decision procedures for this model are based on complex encodings of store buffers as lossy channels. These proc
Externí odkaz:
https://doaj.org/article/7ea9fc58bb434f19ab745e50c9296321
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 140, Iss Proc. INFINITY 2013, Pp 35-47 (2014)
Timed pushdown automata are pushdown automata extended with a finite set of real-valued clocks. Additionaly, each symbol in the stack is equipped with a value representing its age. The enabledness of a transition may depend on the values of the clock
Externí odkaz:
https://doaj.org/article/8086d28ed4a04e11bd9998ffbf14c0af
Autor:
Parosh Aziz Abdulla, Richard Mayr
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 107, Iss Proc. Infinity 2012, Pp 9-24 (2013)
We consider timed Petri nets, i.e., unbounded Petri nets where each token carries a real-valued clock. Transition arcs are labeled with time intervals, which specify constraints on the ages of tokens. Our cost model assigns token storage costs per ti
Externí odkaz:
https://doaj.org/article/dc91df8162824f3a89c1f30284fc2d9d
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 103, Iss Proc. QFM 2012, Pp 1-16 (2012)
In this tutorial, we illustrate through examples how we can combine two classical models, namely those of pushdown automata (PDA) and timed automata, in order to obtain timed pushdown automata (TPDA). Furthermore, we describe how the reachability pro
Externí odkaz:
https://doaj.org/article/c1e7ba0fcf4344f085e1cbfee2661714
Publikováno v:
Programming Languages and Systems ISBN: 9783030993351
We present $\textit{Probabilistic Total Store Ordering (PTSO)}$ -- a probabilistic extension of the classical TSO semantics. For a given (finite-state) program, the operational semantics of PTSO induces an infinite-state Markov chain. We resolve the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d94cb5dcffd6b6356d2f7d3bee6db455
http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-474198
http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-474198