On name generation and set-based analysis in the Dolev-Yao model RM Amadio, W Charatonik International Conference on Concurrency Theory, 499-514, 2002 | 111 | 2002 |

The decidability of model checking mobile ambients W Charatonik, JM Talbot International Workshop on Computer Science Logic, 339-354, 2001 | 82 | 2001 |

Set constraints with projections are in NEXPTIME W Charatonik, L Pacholski Proceedings 35th Annual Symposium on Foundations of Computer Science, 642-653, 1994 | 82 | 1994 |

Negative set constraints with equality W Charatonik, L Pacholski Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science, 128-136, 1994 | 69 | 1994 |

Finite-control mobile ambients W Charatonik, AD Gordon, JM Talbot European Symposium on Programming, 295-313, 2002 | 66 | 2002 |

Set-based analysis of reactive infinite-state systems W Charatonik, A Podelski International Conference on Tools and Algorithms for the Construction and …, 1998 | 58 | 1998 |

Set constraints with intersection W Charatonik, A Podelski Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science …, 1997 | 58 | 1997 |

Automata on DAG representations of finite trees W Charatonik Max-Planck-Institut für Informatik, 1999 | 50 | 1999 |

Model checking mobile ambients W Charatonik, S Dal Zilio, AD Gordon, S Mukhopadhyay, JM Talbot Theoretical Computer Science 308 (1-3), 277-331, 2003 | 42 | 2003 |

The complexity of model checking mobile ambients W Charatonik, S Dal Zilio, AD Gordon, S Mukhopadhyay, JM Talbot International Conference on Foundations of Software Science and Computation …, 2001 | 39 | 2001 |

Co-definite set constraints W Charatonik, A Podelski International Conference on Rewriting Techniques and Applications, 211-225, 1998 | 38 | 1998 |

Two-variable logic with counting and trees W Charatonik, P Witkowski ACM Transactions on Computational Logic (TOCL) 17 (4), 1-27, 2016 | 31 | 2016 |

Complexity of two-variable logic on finite trees S Benaim, M Benedikt, W Charatonik, E Kieroński, R Lenhardt, ... ACM Transactions on Computational Logic (TOCL) 17 (4), 1-38, 2016 | 28 | 2016 |

Directional type inference for logic programs W Charatonik, A Podelski International Static Analysis Symposium, 278-294, 1998 | 27 | 1998 |

Word equations with two variables W Charatonik, L Pacholski International Workshop on Word Equations and Related Topics, 43-56, 1991 | 23 | 1991 |

The Horn mu-calculus W Charatonik, D McAllester, D Niwinski, A Podelski, I Walukiewicz Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science …, 1998 | 21 | 1998 |

Set constraints in some equational theories W Charatonik Information and computation 142 (1), 40-75, 1998 | 21 | 1998 |

The independence property of a class of set constraints W Charatonik, A Podelski International Conference on Principles and Practice of Constraint …, 1996 | 21 | 1996 |

Paths vs. trees in set-based program analysis W Charatonik, A Podelski, JM Talbot Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of …, 2000 | 19 | 2000 |

Solving set constraints for greatest models W Charatonik, A Podelski | 17 | 1997 |