( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Ensuring completeness of symbolic verification methods for infinite-state systems.

, и . Theor. Comput. Sci., 256 (1-2): 145-167 (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Walied Abdulla

Walied Abdulla

Abdulla Aschtari

Abdulla Amin

Abdulla Ali

 

Другие публикации лиц с тем же именем

Bisimulation Minimization of Tree Automata., , и . Int. J. Found. Comput. Sci., 18 (4): 699-713 (2007)What is Decidable about Perfect Timed Channels?, , и . CoRR, (2017)An Improved Search Strategy for Lossy Channel Systems., , и . FORTE, том 107 из IFIP Conference Proceedings, стр. 251-264. Chapman & Hall, (1997)Adding Time to Pushdown Automata, , и . QFM, том 103 из EPTCS, стр. 1-16. (2012)Optimal stateless model checking for reads-from equivalence under sequential consistency., , , , , и . Proc. ACM Program. Lang., 3 (OOPSLA): 150:1-150:29 (2019)SAT-Solving the Coverability Problem for Petri Nets., , и . Formal Methods Syst. Des., 24 (1): 25-43 (2004)Verification of heap manipulating programs with ordered data by extended forest automata., , , , , и . Acta Informatica, 53 (4): 357-385 (2016)Context-Bounded Analysis for POWER., , , и . TACAS (2), том 10206 из Lecture Notes in Computer Science, стр. 56-74. (2017)Analysis of Message Passing Programs Using SMT-Solvers., , и . ATVA, том 8172 из Lecture Notes in Computer Science, стр. 272-286. Springer, (2013)Minimal Cost Reachability/Coverability in Priced Timed Petri Nets., и . FoSSaCS, том 5504 из Lecture Notes in Computer Science, стр. 348-363. Springer, (2009)