Author of the publication

An abort-aware model of transactional programming.

, and . Int. J. Softw. Tools Technol. Transf., 13 (6): 537-551 (2011)

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.

 

Other publications of authors with the same name

From Rule-based to Automata-based Testing., and . FORTE, volume 183 of IFIP Conference Proceedings, page 53-68. Kluwer, (2000)A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes., , and . SIAM J. Comput., 46 (5): 1515-1553 (2017)Realizability and Verification of MSC Graphs., , and . ICALP, volume 2076 of Lecture Notes in Computer Science, page 797-808. Springer, (2001)Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes., , and . ICALP (2), volume 9135 of Lecture Notes in Computer Science, page 184-196. Springer, (2015)Stochastic Context-Free Grammars, Regular Languages, and Newton's Method., , and . ICALP (2), volume 7966 of Lecture Notes in Computer Science, page 199-211. Springer, (2013)Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems.. LATA, volume 7810 of Lecture Notes in Computer Science, page 12. Springer, (2013)Special Section on the Forty-Third Annual ACM Symposium on Theory of Computing (STOC 2011)., , , , and . SIAM J. Comput., 41 (5): 1233-1234 (2012)Multi-Objective Model Checking of Markov Decision Processes., , , and . Logical Methods in Computer Science, (2008)Reachability and the Power of Local Ordering., and . Theor. Comput. Sci., 148 (2): 261-279 (1995)The complexity of computing a (quasi-)perfect equilibrium for an n-player extensive form game.. Games Econ. Behav., (2021)