• Polski
  • English

publikacje w roku  

Zakład Języków Programowania - 2011

  1. M. Kamburelis, Compositing Shaders in X3D, Theory and Practice of Computer Graphics, Eurographics UK Chapter Proceedings, 2011, pp. 101-108. (http://diglib.eg.org/EG/DL/LocalChapterEvents/TPCG/TPCG11)
  2. J. de Nivelle, Classical Logic with Partial Functions, J. Autom. Reasoning 47(4): 399-425 (2011).
  3. M. Biernacka, D. Biernacki, S. Lenglet, Typing control operators in the CPS hierarchy, w: Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming /Peter Schneider-Kamp, Michael Hanus (Eds.), New York: ACM, 2011, 149-160. (http://dx.doi.org/10.1145/2003476.2003498)
  4. D. Biernacki, M. Materzok, Subtyping delimited continuations, w: Proceedings of the 16th ACM SIGPLAN international conference on Functional programming; ICFP 2011, Tokyo, Japan, September 19-21, 2011 /Manuel M.T. Chakravarty, Zhenjiang Hu, Olivier Danvy Eds.), New York: ACM, 2011, 81-93. (http://dx.doi.org/10.1145/2034773.2034786)
  5. 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)
  6. E. Kieroński, Decidability issues for two-variable logics with several linear orders, w: Computer Science Logic (CSL'11), 25th International Workshop/20th Annual Conference of the EACSL / Marc Bezem ed., Wadern, Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2011 (Leibniz International Proceedings in Informatics (LIPIcs), 12), 337-351, CSL 2011, September 12-15, 2011, Bergen, Norway. (http://dx.doi.org/10.4230/LIPIcs.CSL.2011.337)
  7. R. Küsters, T. Truderung, Reducing protocol analysis with XOR to the XOR-free case in the Horn theory based approach, Journal of Automated Reasoning, Vol. 46, iss. 3-4 (2011), 325-352. (http://dx.doi.org/10.1007/s10817-010-9188-8)
  8. R. Küsters, T. Truderung, A. Vogt, Verifiability, privacy, and coercion-resistance: new insights from a case study, w: IEEE Symposium on Security and Privacy (SP), 2011, 22-25 May 2011, Berkeley/Oakland, California - Piscataway, IEEE, 2011, 538-553. (http://www.ieee-security.org/TC/SP2011/sp11-toc.html)
  9. M. Biernacka, D. Biernacki, F. Sieczkowski, Automating derivations of abstract machines from reduction semantics: a generic formalization of refocusing in coq, w: Implementation and Application of Functional Languages: 22nd International Symposium, IFL 2010, Alphen aan den Rijn, The Netherlands, September 1-3, 2010, Revised Selected Papers /edited by Jurriaan Hage, Marco T. Morazán, Berlin, Heidelberg: Springer-Verlag, 2011, (Lecture Notes in Computer Science, 6647), 72-88. (http://dx.doi.org/10.1007/978-3-642-24276-2_5)
  10. E. Kieroński, J. Michaliszyn, J. Otop, Modal logics definable by universal three-variable formulas, w: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011) /Supratik Chakraborty, Amit Kumar (eds.), Wadern: Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2011 (Leibniz International Proceedings in Informatics (LIPIcs), 13), 264-275, FSTTCS 2011, December 12-14, 2011, Mumbai, India. (http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2011.264)
  11. J. Marcinkowski, J. Michaliszyn, The ultimate undecidability result for the Halpern-Shoham Logic, Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, LICS 2011, 377-386.
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