Logowanie

Języki

  • Polski
  • English
fotopracownik

Nawigacja

prof. Witold Charatonik

Pracownik  

2015

  1. W. Charatonik, P. Witkowski, Two-variable logic with counting and a linear order, 24th EACSL Annual Conference on Computer Science Logic (CSL 2015) / Stephan Kreutzer (ed.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. - (LIPIcs - Leibniz International Proceedings in Informatics ; 41).- S. 631-647. (http://dx.doi.org/10.4230/LIPIcs.CSL.2015.631)

2014

  1. W. Charatonik, E. Kieroński, F. Mazowiecki, Decidability of Weak Logics with Deterministic Transitive Closure, CSL-LICS 2014. Vienna, Austria, July 14 - 18, 2014. Proceedings, pp. 29:1--29:10. (http://dl.acm.org/citation.cfm?doid=2603088.2603134)

2013

  1. W. Charatonik, E. Kieroński, S. Benaim, M. Benedikt, R. Lenhardt, F. Mazowiecki, J. Worrell, Complexity of two-variable logic on finite trees, Automata, languages, and programming : 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8 - 12, 2013, Part II / Fedor V. Fomin, Rusinš Freivalds, Marta Kwiatkowska, David Peleg (eds.). - Berlin, Heidelberg : Springer, 2013. - (Lecture Notes in Computer Science ; Vol. 7966). - S. 74-88. (http://dx.doi.org/10.1007/978-3-642-39212-2_10)
  2. W. Charatonik, P. Witkowski, Two-variable logic with counting and trees, 28th Annual IEEE/ACM Symposium on Logic in Computer Science (LICS), 2013 : 25 - 28 June 2013, New Orleans, Louisiana. - Piscataway : IEEE Computer Society, 2013. - S. 73-82. (http://doi.ieeecomputersociety.org/10.1109/LICS.2013.12)
  3. A. Barecka, W. Charatonik, Parameterized complexity of basic decision problems for tree automata, International Journal of Computer Mathematics. - Vol. 90, iss. 6 (2013), s. 1150-1170. (http://dx.doi.org/10.1080/00207160.2012.762451)

2011

  1. A. Barecka, W. Charatonik, The parameterized complexity of chosen problems for finite automata on trees, w: Language and automata theory and applications: 5th international conference, LATA 2011, Tarragona, Spain, May 26-31, 2011, proceedings /Adrian-Horia Dediu, Shunsuke Inenaga, Carlos Martín Vide (eds.), Berlin, Springer, 2011, (Lecture Notes in Computer Science, 6638), 129-141. (http://dx.doi.org/10.1007/978-3-642-21254-3_9)

2010

  1. W. Charatonik, P. Witkowski, On the Complexity of the Bernays-Schönfinkel Class with Datalog (red. C. G. Fermüller, A. Voronkov), Logic for Programming, Artificial Intelligence, and Reasoning – 17th International Conference, LPAR-17, Yogyakarta, Indonesia, October 10-15, 2010. Lecture Notes in Computer Science, Volume 6397, 187-201, 2010.
  2. W. Charatonik, L. Pacholski, Set constraints with projections, Journal of the ACM, 57(4), 1-37, 2010.

2009

  1. W. Charatonik, M. Gębala, M. Kutyłowski, Fundamentals of Computation Theory, 17th International Symposium, FCT 2009, Wrocław, Poland, September 2-4, 2009. Proceedings, Lecture Notes in Computer Science, vol. 5699, Springer 2009, 371. (http://www.springerlink.com/content/u86775512p68/)

2008

  1. W. Charatonik, M. Wrona, Tractable Quantified Constraint Satisfaction Problems over Positive Temporal Templates, Logic for Programming, Artificial Intelligence, and Reasoning, 15th International Conference, LPAR 2008, Doha, Qatar, November 22-27, 2008. Proceedings. Springer Lecture Notes in Computer Science, Vol. 5330, 543-557.
  2. W. Charatonik, M. Wrona, Quantified Positive Temporal Constraints, Computer Science Logic, 22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Bertinoro, Italy, September 16-19, 2008. Proceedings. Springer Lecture Notes in Computer Science, Volume 5213, 94-108.

2007

  1. W. Charatonik, M. Wrona, 2-SAT Problems in Some Multi-valued Logics Based on Finite Lattices, 37th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2007), 2007, IEEE Computer Society 2007, 21-21.
  2. W. Charatonik, Regular directional types for logic programs, Proceedings of the 9th International ACM SIGPLAN Conference on Principles and practice of Declarative Programming, July 14-16, 2007, Wrocław, Poland. Page 209, ACM Press 2007.
  3. W. Charatonik, Set Constraints and Language Equations, Theory and Applications of Language Equations, Proceedings of the 1st International Workshop, Turku, Finland, 2 July 2007, number 44 in General Publications, 1-4. Turku Centre for Computer Science, Jun 2007.

2005

  1. W. Charatonik, L. Georgieva, P. Maier, Bounded model checking of pointer programs, Proceedings of the 19th Annual Conference of the European Association for Computer Science Logic (CSL'05), LNCS 3634, 2005, 397-412.

2003

  1. W. Charatonik, S. DalZilio, A.D. Gordon, S. Mukhopadhyay, J-M. Talbot, Model checking mobile ambients, Theoretical Computer Science, 308/1-3: 277-331, Elsevier, 2003.

2002

  1. W. Charatonik, A. Podelski, Set Constraints with Intersection, Information and Computation 179(2): 213-229, Elsevier, December 2002.
  2. R. Amadio, W. Charatonik, On name generation and set-based analysis in the Dolev-Yao model, Proceedings of the 13th International Conference on Concurrency Theory (CONCUR'02), LNCS 2421, pp 499-514, Springer-Verlag, 2002.
  3. W. Charatonik, S. Mukhopadhyay, A. Podelski, Constraint-Based Infinite Model Checking and Tabulation for Stratified CLP, Proceedings of the 19th International Conference on Logic Programming (ICLP'02), LNCS 2401, 115-129, Springer-Verlag, 2002.
  4. W. Charatonik, J-M. Talbot, Atomic Set Constraints with Projection, Proceedings of the 13th Conference on Rewriting Techniques and Applications (RTA'02), Springer LNCS 2378, 311-325, Springer-Verlag, 2002. Full version in a technical report.
  5. W. Charatonik, A. D. Gordon, J-M. Talbot, Finite-Control Mobile Ambients, Proceedings of the European Symposium on Programming (ESOP'02), Springer LNCS 2305, 295-313, Springer-Verlag, 2002.
  6. W. Charatonik, S. Mukhopadhyay, A. Podelski, Compositional Termination Analysis of Symbolic Forward Analysis, Verification, Model Checking, and Abstract Interpretation (VMCAI'02), Third International Workshop, Revised Papers. Springer LNCS 2294, 109-125, Springer-Verlag, 2002.
  7. R. M. Amadio, W. Charatonik, On name generation and set-based analysis in Dolev-Yao model, INRIA Research Report 4379, January 2002.
  8. W. Charatonik, Symposium on the Effectiveness of Logic in Computer Science in Honour of Moshe Vardi (red. W. Charatonik, H. Ganzinger), Technical report MPI-I-2002-2-007, Max-Planck-Institut für Informatik, March 2002, 63 pages.
  9. W. Charatonik, J-M. Talbot, Atomic set constraints with projection, Technical report MPI-I-2002-2-008, Max-Planck-Institut für Informatik, May 2002.

2001

  1. W. Charatonik, A.D. Gordon, S. Mukhopadhyay, J-M. Talbot, S. Dal Zilio, The complexity of model checking mobile ambients, Proceedings of of the 4th International Conference on Foundations of Software Science and Computation Structures, volume 2030 of Lecture Notes in Computer Science, pages 152-167, Genova, Italy, March 2001, Springer.
  2. W. Charatonik, J-M. Talbot, The Decidability of Model Checking Mobile Ambients, Proceedings of the 15th Annual Conference of the European Association for Computer Science Logic, volume 2142 of Lecture Notes in Computer Science, pages 339-354, Paris, France, September 2001, Springer.
  3. W. Charatonik, A.D. Gordon, S. Mukhopadhyay, J-M. Talbot, S. Dal Zilio, The Complexity of Model Checking Mobile Ambients, Technical Report MSR-TR-2001-03, Microsoft Research, May 2001.

2000

  1. W. Charatonik, Andreas Podelski, Jean-Marc Talbot, Paths vs. Trees in Set-based Program Analysis, Proceedings of the 27th Annual ACM Symposium on Principles of Programming Languages (POPL), Boston, Massachusetts, USA 2000, pp 330-338.
  2. W. Charatonik, Directional type checking for logic programs: Beyond discriminative types, Gert Smolka, editor, Proceedings of the 8th European Symposium on Programming (ESOP'00), volume 1782 of Lecture Notes in Computer Science, pages 72-87, Berlin, Germany, March 2000. Springer.

1999

  1. W. Charatonik, M. Muller, A. Podelski, Set-based Failure Analysis for Logic Programs and Concurrent Constraint Programs, Proceedings of the European Symposium on Programming (ESOP), LNCS 1576, pp 177-192.

1998

  1. W. Charatonik, An undecidable fragment of the theory of set constraints, Information Processing Letters 68 (1998), 147-151.
  2. W. Charatonik, Set constraints in some equational theories, Information and Computation 142 (1998), 40-75.
  3. W. Charatonik, D. McAllester, D. Niwiński, A. Podelski, I. Walukiewicz, The Horn Mu-calculus, Proceedings of the 13th IEEE Symposium on Logic in Computer Science, Indianapolis 1998, 58-69.
  4. W. Charatonik, A. Podelski, Co-definite set constraints, Proceedings of the 9th Conference on Rewriting Techniques and Applications, Tsukuba, Japan, 1998, Lecture Notes in Computer Science 1379, Springer, Berlin 1998, 211-225.
  5. W. Charatonik, A. Podelski, Set-based analysis of reactive infinite-state systems, Proceedings of the 4th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Lisbon, Portugal, March 28-April 4, 1998, Lecture Notes in Computer Science1384, Springer, Berlin 1998, 358-375.
  6. W. Charatonik, A. Podelski, Directional type inference for logic programs, Proceedings of the Fifth International Static Analysis Symposium (SAS), Pisa, Italy, September 1998, Lecture Notes in Computer Science 1503, Springer, Berlin 1998, 278-294.

1997

  1. W. Charatonik, A. Podelski, Set constraints with intersection, Proceedings of the 12th IEEE Symposium on Logic in Computer Science (LICS), Warsaw 1997, 362-372.
  2. W. Charatonik, A. Podelski, Solving set constraints for greatest models, Technical Report MPI-I-97-004, Max-Planck-Institut fur Informatik, April 1997.

1996

  1. W. Charatonik, A. Podelski, The independence property of a class set constraints, Proc. of the Conference on Principles and Practice of Constraint Programming, Cambridge, USA, 1996, Lecture Notes in Computer Science 1118, Springer, 76-90.

1995

  1. W. Charatonik, Set constraints in some equational theories, praca doktorska, Instytut Matematyczny PAN, Warszawa, maj 1995.

1994

  1. W. Charatonik, Set constraints in some equational theories, Proc. 1st International Conference Constraints in Computational Logics, LNCS 845, Springer-Verlag, 1994, 304-319.
  2. W. Charatonik, L. Pacholski, Negative set constraints with equality, Proc. 9th IEEE Symposium on Logic in Computer Science (LICS), Paris 1994, 128-136.
  3. W. Charatonik, L. Pacholski, Set constraints with projections are in NEXPTIME, Proc. 35th Symposium on Foundations of Computer Science (FOCS), Santa Fe 1994, 642-653.

1993

  1. W. Charatonik, L. Pacholski, Word Equations with Two Variables, Proceedings of 2nd Workshop on Word Equations and Related Topics, IWWERT'91, Lecture Notes in Computer Science, vol. 677, Springer-Verlag, Berlin 1993, 43-56.

Adres:
Instytut Informatyki
Uniwersytetu Wroclawskiego
ul. Joliot-Curie 15
50-383 Wroclaw
Sekretariat
tel.: 71 375 7800
tel.: 71 325 1271
fax: 71 375 7801
sekretariat@ii.uni.wroc.pl
Dziekanat
tel.: 71 375 7892
dziekan@ii.uni.wroc.pl
sprawy studenckie:
dziekanat@ii.uni.wroc.pl
Portiernia
tel.: 71 375 7958
Redaktor strony WWW
redaktor@ii.uni.wroc.pl
Projekt
MAKOS