( en | de | ru )

 

Disambiguation of "Wijs, Anton"

Author of the publication

copydeleteadd this publication to your clipboard
Dependency Safety for Java: Implementing Failboxes.

, , , , , , , , and . PPPJ, page 15:1-15:6. ACM, (2016)

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.

Sacha Alain Christophe Wijs

Media and transition in central and eastern Europe: a comparison between the German Democratic Republic and Hungary. HU Berlin, (2009)

Dinah Wijsenbeek

Sacha Alain Christophe Wijs

Elmar Antony

Helmut Anton

 

Other publications of authors with the same name

Forgetting the Time in Timed Process Algebra.. FMOODS/FORTE, volume 6117 of Lecture Notes in Computer Science, page 110-124. Springer, (2010)Analyzing a chi model of a turntable system using Spin, CADP and Uppaal., , , , , , , and . J. Log. Algebraic Methods Program., 65 (2): 51-104 (2005)GPUexplore 2.0: Unleashing GPU Explicit-State Model Checking., , and . FM, volume 9995 of Lecture Notes in Computer Science, page 694-701. (2016)Survey on Directed Model Checking., , , , , and . MoChArt, volume 5348 of Lecture Notes in Computer Science, page 65-89. Springer, (2008)Compositional Model Checking Is Lively., and . FACS, volume 10487 of Lecture Notes in Computer Science, page 117-136. Springer, (2017)The HIVE Tool for Informed Swarm State Space Exploration. PDMC, volume 72 of EPTCS, page 91-98. (2011)From chi-t to µCRL: Combining Performance and Functional Analysis., and . ICECCS, page 184-193. IEEE Computer Society, (2005)Parallel SAT Simplification on GPU Architectures., and . TACAS (1), volume 11427 of Lecture Notes in Computer Science, page 21-40. Springer, (2019)The mCRL2 Toolset for Analysing Concurrent Systems - Improvements in Expressivity and Usability., , , , , , , , and . TACAS (2), volume 11428 of Lecture Notes in Computer Science, page 21-39. Springer, (2019)An O(m log n) algorithm for branching bisimilarity on labelled transition systems., , , and . TACAS (2), volume 12079 of Lecture Notes in Computer Science, page 3-20. Springer, (2020)