Seminar (mit Bakkalaureatsarbeit)
LVA 185.188, SE 3.0, 2004 S
Wissenschaftliches Arbeiten
LVA 185.217, PS 2.0, 2004 S


  1. P. Cousot, R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of the 6th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Los Angeles, California, 1977. ACM Press, New York.
  2. P. Cousot, R. Cousot. Systematic Design of Program Transformations by Abstract Interpretation. In Conference Record of the 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Portland, OR, 2002.
  3. Th. Jensen. F. Spoto. Class Analysis of Object-Oriented Programs through Abstract Interpretation. In Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures (FOSSACS 2001), Joint European Conferences on Theory and Practice of Software, ETAPS 2001, Genova, Italy, April 2-6, 2001, Lecture Notes in Computer Science (LNCS), Vol. 2030, pp. 261-275, 2001.
  4. R. Cleaveland, M. Klein, B. Steffen. Faster Model Checking for the Modal Mu-Calculus. In Computer Aided Verification (CAV'92) (eds.: G.v. Bochmann, D.K. Probst), Lecture Notes in Computer Science (LNCS), Vol. 663, pp. 410-422. Springer-Verlag, Heidelberg, Germany, 1992.
  5. J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, L.J. Hwang. Symbolic Model Checking: 10E20 States and Beyond. Information and Computation, 98(2), 142-170, 1992.
  6. M. Checkik, B. Devereux, S. Easterbrook, A.Y.C. Lai, V. Petrovykh. Efficient Multiple-Valued Model-Checking Using Lattice Representations. In Proceedings of the 12th International Conference on Concurrency (CONCUR'01), LNCS 2154, Springer-Verlag, Heidelberg, 441-455, 2001.
  7. M.B. Dwyer, D.A. Schmidt. Limiting State Explosion with Filter-Based Refinement. In Proceedings of the International Workshop on Verification, Model Checking and Abstract Interpretation, (Annalisa Bossi, ed.), Port Jefferson, Long Island, N.Y., October 1997.
  8. C. Stirling, D. Walker. Local Model Checking in the Modal mu-Calculus. Theoretical Computer Science 89(1), 161-177, 1991.
    (nicht online verfügbar)
  9. G. Baht, R. Cleaveland. Efficient on-the-fly model checking for CTL*. In Tenth Annual Symposium on Logic in Computer Science (LICS '95), 388-397, San Diego, June 1995. IEEE Computer Society Press.
  10. D.A. Schmidt, B. Steffen. Data-flow analysis as model checking of abstract interpretations. In Proceedings of the 5th Static Analysis Symposium, G. Levi. ed., Pisa, September, 1998. Springer LNCS 1503, 351-380, 1998.
  11. B. Steffen. Generating Data Flow Analysis Algorithms from Modal Specifications. International Journal on Science of Computer Programming, Vol. 21, pp. 115-139, 1993.
  12. E.M. Clarke, O. Grumberg, D.E. Long. Model Checking and Abstraction. ACM Transactions on Programming Languages and Systems, 16(5), 1512-1542, 1994.
  13. R. Cleaveland, P. Iyer, D. Yankelevich. Optimality in Abstraction of Model Checking. In Proceedings of the 2nd Static Analysis Symposium (SAS'95), LNCS 983, 51-63, 1995.
      frühere Lehre
         LVAs 2017 W
         LVAs 2017 S
         LVAs 2016 W
         LVAs 2016 S
         LVAs 2015 W
         LVAs 2015 S
         LVAs 2014 W
         LVAs 2014 S
         LVAs 2013 W
         LVAs 2013 S
         LVAs 2012 W
         LVAs 2012 S
         LVAs 2011 W
         LVAs 2011 S
         LVAs 2010 W
         LVAs 2010 S
         LVAs 2009 W
         LVAs 2009 S
         LVAs 2008 W
         LVAs 2008 S
         LVAs 2007 W
         LVAs 2007 S
         LVAs 2006 W
         LVAs 2006 S
         LVAs 2005 W
         LVAs 2005 S
         LVAs 2004 W
         LVAs 2004 S
            Seminar, WA
               1. Aufgabe
               Wiss. Lit.
         LVAs 2003 W
Fakultät für Informatik
Technische Universität Wien
Anfang | HTML 4.01 | Datenschutzerklärung | letzte Änderung: 2004-05-04 (Puntigam)