( en | de | ru )

 

Disambiguation of "Azzopardi, Shaun"

Author of the publication

copydeleteadd this publication to your clipboard
Control-Flow Residual Analysis for Symbolic Automata.

, , and . PrePost@iFM, volume 254 of EPTCS, page 29-43. (2017)

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. You can also use the button next to the name to display some publications already assigned to the person.

Shaun Gittens

Shaun Howell

Shaun Richard Presow

 

Other publications of authors with the same name

R-CHECK: A Model Checker for Verifying Reconfigurable MAS., , and . AAMAS, page 1518-1520. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), (2022)Compliance Checking in the Open Payments Ecosystem., , , and . SEFM, volume 9763 of Lecture Notes in Computer Science, page 337-343. Springer, (2016)Runtime Verification of Kotlin Coroutines., , , and . RV, volume 13498 of Lecture Notes in Computer Science, page 221-239. Springer, (2022)A Technique for Automata-based Verification with Residual Reasoning., , and . MODELSWARD, page 237-248. SCITEPRESS, (2020)ppLTLTT : Temporal Testing for Pure-Past Linear Temporal Logic Formulae., , , and . ATVA, volume 14216 of Lecture Notes in Computer Science, page 276-287. Springer, (2023)Model Checking Reconfigurable Interacting Systems., , and . ISoLA (3), volume 13703 of Lecture Notes in Computer Science, page 373-389. Springer, (2022)CLARVA: Model-based Residual Verification of Java Programs., , and . MODELSWARD, page 352-359. SCITEPRESS, (2020)A Model-Based Approach to Combining Static and Dynamic Verification Techniques., , and . ISoLA (1), volume 9952 of Lecture Notes in Computer Science, page 416-430. (2016)On Observing Contracts: Deontic Contracts Meet Smart Contracts., , and . JURIX, volume 313 of Frontiers in Artificial Intelligence and Applications, page 21-30. IOS Press, (2018)Control-Flow Residual Analysis for Symbolic Automata., , and . PrePost@iFM, volume 254 of EPTCS, page 29-43. (2017)