Programmeerimiskeelte semantika uurimisseminar

• Aine kood: MTAT.03.204
• Vastutav õppejõud: Varmo Vene
• Ainepunkte: 5
• Konverentsi ajakava

• 08. 09., kell 14.15, Liivi 2, 403
  • Sissejuhatus.
  • Teemade tutvustus.
  • Ajakava paikapanek.
• 22. 09., kontakt e-mailiga
  • Igalt osalejalt tagasiside maili teel.
  • Teema peab olema valitud.
• 29. 09., kontakt e-mailiga
  • Teema lühisissejuhatus; sisukord ja kava; Lähtematerjali lühitutvustus.
  • Kirjalikus vormis ca 1-3 lk.
• 13. 10., kell 14.15, Liivi 2, 403
  • Vahekokkuvõte.
  • Vormistuslikud küsimused.
  • Esitada kirjatöö mustand (ca 2/3 ulatuses valmis).
  • Ettekanded (ca. 5 min, 1-2 slaidi) oma teema tutvustamiseks.
  • Slaidid.
• 03. 11., kontakt e-mailiga
  • Artiklid hindamisele kaastudengitele.
  • Retsenseerimisvormid (Est, Eng).
• 17. 11., kontakt e-mailiga
  • Retsensioonide kokkukogumine, laialijagamine.
• 27. 11., kontakt e-mailiga
  • Lõppversioonide esitamine.
• 08.12., Liivi 2, Konverents (1. päev)
  • Teemade kaupa grupeeritud-järjestatud loengud.
  • Iga ettekanne arvestuslikult 1 tund (40-45 + 10).
• 22.12., Liivi 2, Konverents (2. päev)

Programmianalüüs

• Mudelikontrollija Blast [Raivo Laanemets]
  • Blast: Berkeley Lazy Abstraction Software Verification Tool. http://mtc.epfl.ch/software-tools/blast/
  • The Software Model Checker Blast. Dirk Beyer, Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar (STTT 9(5-6):505-525) http://www.cs.sfu.ca/%7Edbeyer/Publications/2007-STTT.The_Software_Model_Checker_BLAST.pdf
• Staatiline andmejooksude analüüs [Vesal Vojdani]
  • LOCKSMITH: Context-sensitive correlation analysis for detecting races. Polyvios Pratikakis, Jeffrey S. Foster, Michael Hicks. (PLDI'06). http://www.cs.umd.edu/~jfoster/papers/pldi06.html
  • Fast and accurate static data-race detection for concurrent programs. Vineet Kahlon, Yu Yang, Sriram Sankaranarayanan, Aarti Gupta. (CAV'07). http://www.cs.utexas.edu/~kahlon/papers/cav07.pdf
• Klassihierarhia analüüs OO-keeltele [Sander Sõnajalg]
  • Fast static analysis of C++ virtual function calls. David Bacon, Peter Sweeney (OOPSLA'96). http://portal.acm.org/citation.cfm?id=236371
  • Fragment Class Analysis for Testing of Polymorphism in Java Software. Atanas Rountev, Ana Milanova, Barbara Ryder (ICSE'03). http://www.cs.rpi.edu/~milanova/docs/icse03.pdf
  • Optimization of Object-Oriented Programs Using Static Class Hierarchy Analysis. Jeffrey Dean, David Grove, Craig Chambers (ECOOP'95). http://portal.acm.org/citation.cfm?id=679523
• Turvalise infovoo analüüs [Jaak Ristioja]
  • Language-Based Information-Flow Security. A. Sabelfeld, A.C. Myers (JSAC 2003) http://www.cs.cornell.edu/andru/papers/jsac/sm-jsac03.pdf

Varia

• Erindid Haskellis [Jaak Randmets]
  • Handling Exceptions in Haskell. Alastair Reid, 1999. http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.1584
  • A Semantics for Imprecise Exceptions. Simon L. Peyton Jones, Alastair Reid, Fergus Henderson, C. A. R. Hoare, Simon Marlow. PLDI 1999. http://portal.acm.org/citation.cfm?doid=301618.301637
  • An extensible dynamically-typed hierarchy of exceptions. Simon Marlow, Haskell 2006. http://portal.acm.org/citation.cfm?doid=1159842.1159854
• Laiendatavad andmetüübid ja funktsioonid [Priit Haamer]
  • The Expression Problem Revisited. Torgersen, M. ECOOP 2004. http://www.daimi.au.dk/~madst/ecoop04/main.pdf
  • Extensible Algebraic Datatypes with Defaults. Zenger, M., Odersky, M. ICFP 2001. http://lampwww.epfl.ch/~zenger/papers/icfp01.pdf
  • Open Data Types and Open Functions. Löh, A., Hinze, R. PPDP 2006. http://people.cs.uu.nl/andres/OpenDatatypes.pdf
• Tüübikontrollijate genereerimine [Andrey Breslav]
  • A Generator for Type Checkers. Holger Gast. (PhD thesis 2004) http://www-pu.informatik.uni-tuebingen.de/users/gast/tcg.html
• Randomiseeritud algoritmide omaduste tõestamine [Martin Pettai]
  • Proofs of randomized algorithms in Coq. P. Audebaud and C. Paulin-Mohring (SCP 2008) http://www.lri.fr/~paulin/ALEA/random-scp.pdf
• Magasin- vs registermasinad [Silver Aabjõe]
  • The case against stack-oriented instruction sets. G. J. Myers (Comp. Arch. News, 1977) http://portal.acm.org/citation.cfm?doid=859402.859403
  • Reply to the case against stack-oriented instruction sets. P. Schulthess, E. Mumprecht (Comp. Arch. News, 1977) http://portal.acm.org/citation.cfm?doid=859412.859416
  • The case for virtual register machines. B. Davis, A. Beatty, K. Casey, D. Gregg, J. Waldron (IVME 2003) http://portal.acm.org/citation.cfm?id=858575
  • Virtual machine showdown: Stack versus registers. Y. Shi, K. Casey, A. Ertl, D. Gregg (TACO 2008) http://portal.acm.org/citation.cfm?id=1328195.1328197
• DSL-ide loomise ja kasutamise vahendid [Aivar Annamaa]
  • Language Oriented Programming. M. Ward (1994) http://www.cse.dmu.ac.uk/~mward/martin/papers/middle-out-t.pdf
  • Language Oriented Programming: The Next Programming Paradigm. S. Dmitriev (2004) http://www.jetbrains.com/mps/docs/Language_Oriented_Programming.pdf
  • Intentional Software. C. Simonyi, M. Christerson, S. Clifford (OOPSLA 2006) http://intentsoft.com/technology/IS_OOPSLA_2006_paper.pdf

• I. Parberry, "A Guide for New Referees in Theoretical Computer Science". Information and Computation, Vol. 112, No. 1, pp. 96-116, 1994.
• Vormistusjuhend (J.Vilo)
• 2003 a. J.Vilo organiseeritud "Andmekaevanduse uurimisseminari" veebileht