Witold Charatonik
Witold Charatonik
Professor of Computer Science, University of Wrocław
Dirección de correo verificada de cs.uni.wroc.pl
Título
Citado por
Citado por
Año
On name generation and set-based analysis in the Dolev-Yao model
RM Amadio, W Charatonik
International Conference on Concurrency Theory, 499-514, 2002
1092002
The decidability of model checking mobile ambients
W Charatonik, JM Talbot
International Workshop on Computer Science Logic, 339-354, 2001
802001
Set constraints with projections are in NEXPTIME
W Charatonik, L Pacholski
Proceedings 35th Annual Symposium on Foundations of Computer Science, 642-653, 1994
801994
Negative set constraints with equality
W Charatonik, L Pacholski
Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science, 128-136, 1994
691994
Finite-control mobile ambients
W Charatonik, AD Gordon, JM Talbot
European Symposium on Programming, 295-313, 2002
662002
The Semantic Web-ISWC 2002: First International Semantic Web Conference, Sardinia, Italy, June 9-12, 2002, Proceedings
I Horrocks
Springer Science & Business Media, 2002
602002
Set constraints with intersection
W Charatonik, A Podelski
Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science …, 1997
571997
Set-based analysis of reactive infinite-state systems
W Charatonik, A Podelski
International Conference on Tools and Algorithms for the Construction and …, 1998
561998
Automata on DAG representations of finite trees
W Charatonik
Max-Planck-Institut für Informatik, 1999
501999
Model checking mobile ambients
W Charatonik, S Dal Zilio, AD Gordon, S Mukhopadhyay, JM Talbot
Theoretical Computer Science 308 (1-3), 277-331, 2003
422003
Co-definite set constraints
W Charatonik, A Podelski
International Conference on Rewriting Techniques and Applications, 211-225, 1998
391998
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
382001
Two-variable logic with counting and trees
W Charatonik, P Witkowski
ACM Transactions on Computational Logic (TOCL) 17 (4), 1-27, 2016
292016
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
282016
Directional type inference for logic programs
W Charatonik, A Podelski
International Static Analysis Symposium, 278-294, 1998
261998
Word equations with two variables
W Charatonik, L Pacholski
International Workshop on Word Equations and Related Topics, 43-56, 1991
231991
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
211998
Set constraints in some equational theories
W Charatonik
Information and computation 142 (1), 40-75, 1998
211998
The independence property of a class of set constraints
W Charatonik, A Podelski
International Conference on Principles and Practice of Constraint …, 1996
211996
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
202000
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20