• Polski
  • English

publikacje w roku  

Zakład Języków Programowania - 2002

  1. W. Charatonik, A. Podelski, Set Constraints with Intersection, Information and Computation 179(2): 213-229, Elsevier, December 2002.
  2. 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.
  3. 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.
  4. 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.
  5. 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.
  6. R. M. Amadio, W. Charatonik, On name generation and set-based analysis in Dolev-Yao model, INRIA Research Report 4379, January 2002.
  7. 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.
  8. 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.
  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.
  10. S. Bala, Intersection of Regular Languages and Star Hierarchy, Proceedings 29th International Colloquium, ICALP 2002, Lecture Notes in Computer Science, Springer-Verlag.
  11. J. Marcinkowski, T. Truderung, Optimal Complexity Bounds for Positive LTL Games, Proceedings of CSL 2002, LNCS 2471, Springer 2002, 262-275.
  12. J. Marcinkowski, The ∃*∀* part of the theory of ground term algebra modulo an AC symbol is undecidable, Information and Computation 178, 2002, 412-421.
  13. D. Dougherty, T. Wierzbicki, A decidable variant of higher order matching, Proc. 13th Conf. on Rewriting Techniques and Applications, RTA'02, Copenhagen, Denmark, July 22-24, 2002, Sophie Tison, ed., LNCS 2378, (c) Springer-Verlag, Berlin, 2002, 340-351.
  14. E. Kieroński, EXPSPACE-Complete Variant of Guarded Fragment with Transitivity, 19th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2002, Antibes – Juan les Pins, France, March 14-16, 2002, Proceedings. LNCS 2285 Springer 2002, 608-619.
Instytut Informatyki
Uniwersytetu Wroclawskiego
ul. Joliot-Curie 15
50-383 Wroclaw
tel.: 71 375 7800
tel.: 71 325 1271
fax: 71 375 7801
tel.: 71 375 7892
sprawy studenckie:
tel.: 71 375 7958
Redaktor strony WWW