| [1] | Wolfgang Ahrendt, Bernhard Beckert, Richard Bubel, Reiner Hähnle, Peter H. Schmitt, and Mattias Ulbrich, editors. Deductive Software Verification - The KeY Book - From Theory to Practice, volume 10001 of Lecture Notes in Computer Science. Springer, 2016. [ bib | DOI | http ] |
| [2] | Bernhard Beckert, Reiner Hähnle, and Peter H. Schmitt, editors. Verification of Object-Oriented Software: The KeY Approach. LNCS 4334. Springer-Verlag, 2007. [ bib ] |
| [3] | Wolfgang Bibel and Peter H. Schmitt, editors. Automated Deduction - A Basis for Applications. Vol. I. Foundations - Calculi and Methods. Vol II. Systems and Implementation Techniques. Vol. III. Applications, volume 8, 9, 10 of Applied Logic Series. Kluwer Academic Publishers, 1998. [ bib ] |
| [4] | K.-P. Jantke G. Brewka and P. H. Schmitt, editors. Nonmonotonic and Inductive Logic, Second Internat. workshop, Schloß Reinhardsbrunn, volume 659 of Lecture Notes in AI. Springer Verlag, 1993. [ bib ] |
| [5] | Peter H. Schmitt. Theorie der logischen Programmierung. Springer Verlag, 1992. [ bib ] |
| [6] | P. H. Schmitt K.-P. Jantke and J. Dix, editors. Nonmonotonic and Inductive Logic, First Internat. workshop, Karlsruhe, volume 543 of Lecture Notes in AI. Springer Verlag, 1991. [ bib ] |
This file was generated by
Refereed
bibtex2html 1.99.
| [1] | Peter H. Schmitt. Two first-order theories of ordinals. In Andreas Blass, Patrick Cégielski, Nachum Dershowitz, Manfred Droste, and Bernd Finkbeiner, editors, Fields of Logic and Computation III - Essays Dedicated to Yuri Gurevich on the Occasion of His 80th Birthday, volume 12180 of Lecture Notes in Computer Science, pages 247--257. Springer, 2020. [ bib | DOI | http ] |
| [2] | Bernhard Beckert, Jonas Schiffl, Peter H. Schmitt, and Mattias Ulbrich. Proving jdk's dual pivot quicksort correct. In Andrei Paskevich and Thomas Wies, editors, Verified Software. Theories, Tools, and Experiments - 9th International Conference, VSTTE 2017, Heidelberg, Germany, July 22-23, 2017, Revised Selected Papers, volume 10712 of Lecture Notes in Computer Science, pages 35--48. Springer, 2017. [ bib | DOI | http ] |
| [3] | Peter H. Schmitt. A mechanizable first-order theory of ordinals. In Renate A. Schmidt and Cláudia Nalon, editors, Automated Reasoning with Analytic Tableaux and Related Methods - 26th International Conference, TABLEAUX 2017, Brasília, Brazil, September 25-28, 2017, Proceedings, volume 10501 of Lecture Notes in Computer Science, pages 331--346. Springer, 2017. [ bib | DOI | http ] |
| [4] | Peter H. Schmitt and Richard Bubel. Theories. In Wolfgang Ahrendt, Bernhard Beckert, Richard Bubel, Reiner Hähnle, Peter H. Schmitt, and Mattias Ulbrich, editors, Deductive Software Verification - The KeY Book - From Theory to Practice, volume 10001 of Lecture Notes in Computer Science, pages 149--166. Springer, 2016. [ bib | DOI | http ] |
| [5] | Peter H. Schmitt. First-order logic. In Wolfgang Ahrendt, Bernhard Beckert, Richard Bubel, Reiner Hähnle, Peter H. Schmitt, and Mattias Ulbrich, editors, Deductive Software Verification - The KeY Book - From Theory to Practice, volume 10001 of Lecture Notes in Computer Science, pages 23--47. Springer, 2016. [ bib | DOI | http ] |
| [6] | Daniel Grahl, Richard Bubel, Wojciech Mostowski, Peter H. Schmitt, Mattias Ulbrich, and Benjamin Weiß. Modular specification and verification. In Wolfgang Ahrendt, Bernhard Beckert, Richard Bubel, Reiner Hähnle, Peter H. Schmitt, and Mattias Ulbrich, editors, Deductive Software Verification - The KeY Book - From Theory to Practice, volume 10001 of Lecture Notes in Computer Science, pages 289--351. Springer, 2016. [ bib | DOI | http ] |
| [7] | Bernhard Beckert, Reiner Hähnle, Martin Hentschel, and Peter H. Schmitt. Formal verification with key: A tutorial. In Wolfgang Ahrendt, Bernhard Beckert, Richard Bubel, Reiner Hähnle, Peter H. Schmitt, and Mattias Ulbrich, editors, Deductive Software Verification - The KeY Book - From Theory to Practice, volume 10001 of Lecture Notes in Computer Science, pages 541--570. Springer, 2016. [ bib | DOI | http ] |
| [8] | Peter H. Schmitt and Mattias Ulbrich. Axiomatization of typed first-order logic. In Nikolaj Bjørner and Frank D. de Boer, editors, FM 2015: Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26, 2015, Proceedings, volume 9109 of Lecture Notes in Computer Science, pages 470--486. Springer, 2015. [ bib | DOI | http | .pdf ] |
| [9] | Markus Krötzsch, Sebastian Rudolph, and Peter H. Schmitt. A closer look at the semantic relationship between datalog and description logics. Semantic Web, 6(1):63--79, 2015. [ bib | DOI | http ] |
| [10] | Christoph Scheben and Peter H. Schmitt. Efficient self-composition for weakest precondition calculi. In Cliff B. Jones, Pekka Pihlajasaari, and Jun Sun, editors, FM 2014: Formal Methods - 19th International Symposium, Singapore, May 12-16, 2014. Proceedings, volume 8442 of Lecture Notes in Computer Science, pages 579--594. Springer, 2014. [ bib | DOI | http ] |
| [11] | Wolfgang Ahrendt, Bernhard Beckert, Daniel Bruns, Richard Bubel, Christoph Gladisch, Sarah Grebing, Reiner Hähnle, Martin Hentschel, Mihai Herda, Vladimir Klebanov, Wojciech Mostowski, Christoph Scheben, Peter H. Schmitt, and Mattias Ulbrich. The KeY platform for verification and analysis of Java programs. In Dimitra Giannakopoulou and Daniel Kroening, editors, Verified Software: Theories, Tools and Experiments - 6th International Conference, VSTTE 2014, Vienna, Austria, July 17-18, 2014, Revised Selected Papers, volume 8471 of Lecture Notes in Computer Science, pages 55--71. Springer, 2014. [ bib | DOI | http ] |
| [12] | Christoph Scheben and Peter H. Schmitt. Verification of information flow properties of java programs without approximations. In Bernhard Beckert, Ferruccio Damiani, and Dilian Gurov, editors, FoVeOOS, Lecture Notes in Computer Science, pages 232--249. Springer, 2011. [ bib ] |
| [13] | Peter H. Schmitt, Mattias Ulbrich, and Benjamin Weiß. Dynamic frames in Java dynamic logic. In Bernhard Beckert and Claude Marché, editors, FoVeOOS, volume 6528 of Lecture Notes in Computer Science, pages 138--152. Springer, 2010. [ bib ] |
| [14] | Markus Krötzsch, Sebastian Rudolph, and Peter H. Schmitt. On the semantic relationship between datalog and description logics. In Pascal Hitzler and Thomas Lukasiewicz, editors, RR, volume 6333 of Lecture Notes in Computer Science, pages 88--102. Springer, 2010. [ bib ] |
| [15] | David Faragó and Peter H. Schmitt. Improving non-progress cycle checks. In Corina S. Pasareanu, editor, SPIN, volume 5578 of Lecture Notes in Computer Science, pages 50--67. Springer, 2009. [ bib ] |
| [16] | Richard Bubel, Reiner Hähnle, and Peter H. Schmitt. Specification predicates with explicit dependency information. In Bernhard Beckert and Gerwin Klein, editors, VERIFY, volume 372 of CEUR Workshop Proceedings. CEUR-WS.org, 2008. [ bib ] |
| [17] | Peter H. Schmitt and Benjamin Weiß. Inferring invariants by symbolic execution. In Bernhard Beckert, editor, VERIFY, volume 259 of CEUR Workshop Proceedings. CEUR-WS.org, 2007. [ bib ] |
| [18] | Peter H. Schmitt and Isabel Tonin. Verifying the mondex case study. In Fifth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2007), 10-14 September 2007, London, England, UK, pages 47--58. IEEE Computer Society, 2007. [ bib ] |
| [19] | Wolfgang Ahrendt, Bernhard Beckert, Reiner Hähnle, and Peter H. Schmitt. Key: A formal method for object-oriented systems. In Marcello M. Bonsangue and Einar Broch Johnsen, editors, Formal Methods for Open Object-Based Distributed Systems, 9th IFIP WG 6.1 International Conference, FMOODS 2007, Paphos, Cyprus, June 6-8, 2007, Proceedings, volume 4468 of Lecture Notes in Computer Science, pages 32--43. Springer, 2007. [ bib ] |
| [20] | Bernhard Beckert, Reiner Hähnle, and Peter H. Schmitt. Integrating object-oriented design and deductive verification of software. In Fourth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2006), 11-15 September 2006, Pune, India, page 260. IEEE Computer Society, 2006. [ bib ] |
| [21] | Vladimir Klebanov, Philipp Rümmer, Steffen Schlager, and Peter H. Schmitt. Verification of jcsp programs. In Jan F. Broenink, Herman W. Roebbers, Johan P. E. Sunter, Peter H. Welch, and David C. Wood, editors, The 28th Communicating Process Architectures Conference, CPA 2005, organised under the auspices of WoTUG, Philips and the Technische Universiteit Eindhoven, Eindhoven, The Netherlands, 18-21 September 2005, volume 63 of Concurrent Systems Engineering Series, pages 203--218. IOS Press, 2005. [ bib ] |
| [22] | Wolfgang Ahrendt, Thomas Baar, Bernhard Beckert, Richard Bubel, Martin Giese, Reiner Hähnle, Wolfram Menzel, Wojciech Mostowski, Andreas Roth, Steffen Schlager, and Peter H. Schmitt. The KeY tool. Software and System Modeling, 4:32--54, 2005. [ bib | DOI ] |
| [23] | Bernhard Beckert, Steffen Schlager, and Peter H. Schmitt. An improved rule for while loops in deductive program verification. In Kung-Kiu Lau and Richard Banach, editors, Formal Methods and Software Engineering, 7th International Conference on Formal Engineering Methods, ICFEM 2005, Manchester, UK, November 1-4, 2005, Proceedings, volume 3785 of Lecture Notes in Computer Science, pages 315--329. Springer, 2005. [ bib ] |
| [24] | Bernhard Beckert and Peter H. Schmitt. Program verification using change information. In 1st International Conference on Software Engineering and Formal Methods (SEFM 2003), 22-27 September 2003, Brisbane, Australia, pages 91--. IEEE Computer Society, 2003. [ bib ] |
| [25] | Wolfgang Ahrendt, Thomas Baar, Bernhard Beckert, Martin Giese, Elmar Habermalz, Reiner Hähnle, Wolfram Menzel, Wojciech Mostowski, and Peter H. Schmitt. The key system: Integrating object-oriented design and formal methods. In Ralf-Detlef Kutsche and Herbert Weber, editors, Fundamental Approaches to Software Engineering, 5th International Conference, FASE 2002, held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2002, Grenoble, France, April 8-12, 2002, Proceedings, volume 2306 of Lecture Notes in Computer Science, pages 327--330. Springer, 2002. [ bib ] |
| [26] | Thomas Baar, Bernhard Beckert, and Peter H. Schmitt. An extension of dynamic logic for modelling ocl's @pre operator. In Dines Bjørner, Manfred Broy, and Alexandre V. Zamulin, editors, Perspectives of System Informatics, 4th International Andrei Ershov Memorial Conference, PSI 2001, Akademgorodok, Novosibirsk, Russia, July 2-6, 2001, Revised Papers, volume 2244 of Lecture Notes in Computer Science, pages 47--54. Springer, 2001. [ bib ] |
| [27] | Thomas Baar, Reiner Hähnle, Theo Sattler, and Peter H. Schmitt. Entwurfsmustergesteuerte Erzeugung von OCL-Constraints. In K. Mehlhorn and G. Snelting, editors, Informatik 2000, 30. Jahrestagung der Gesellschaft für Infomatik, pages 389--404. Springer, September 2000. [ bib ] |
| [28] | Thomas Baar, Reiner Hähnle, Theo Sattler, and Peter H. Schmitt. Entwurfgesteuerte erzeugung von ocl-constraints. Softwaretechnik-Trends, 20(3), 2000. [ bib ] |
| [29] | Wolfgang Ahrendt, Thomas Baar, Bernhard Beckert, Martin Giese, Elmar Habermalz, Reiner Hähnle, Wolfram Menzel, and Peter H. Schmitt. The key approach: Integrating object oriented design and formal verification. In Manuel Ojeda-Aciego, Inman P. de Guzmán, Gerhard Brewka, and Luís Moniz Pereira, editors, Logics in Artificial Intelligence, European Workshop, JELIA 2000 Malaga, Spain, September 29 - October 2, 2000, Proceedings, volume 1919 of Lecture Notes in Computer Science, pages 21--36. Springer, 2000. [ bib ] |
| [30] | Joachim Posegga and Peter H. Schmitt. Implementing semantic tableaux. In Marcello D'Agostino, Dov M. Gabbay, Reiner Hähnle, and Joachim Posegga, editors, Handbook of Tableau Methods, pages 581--629. Kluwer Academic Publishers, 1999. [ bib ] |
| [31] | Harald Ganzinger, Jörg H. Siekmann, and Peter H. Schmitt. Wohin geht die automatische Deduktion? KI, 12(4):33--37, 1998. [ bib ] |
| [32] | Reiner Hähnle, Wolfram Menzel, and Peter H. Schmitt. Integrierter Deduktiver Software-Entwurf. KI, 12(4):40--41, 1998. [ bib ] |
| [33] | Reiner Hähnle, Wolfram Menzel, and Peter H. Schmitt. Integrierter deduktiver Software-Entwurf. KI, 98(4):40--41, 1998. In German. [ bib ] |
| [34] | W. Ahrendt, B. Beckert, R. Hähnle, W. Menzel, W.Reif, G. Schellhorn, and P. Schmitt. Integration of automated and interactive theorem proving. In W. Bibel and P. Schmitt, editors, Automated Deduction --- A Basis for Applications, volume I, 3. Kluwer, 1998. [ bib ] |
| [35] | Jean Goubault-Larrecq and Peter H. Schmitt. A tableau system for linear-time temporal logic. In Ed Brinksma, editor, Proceedings of the Third International Workshop on Tools and Algorithms for the Construction and Analysis of Systems, TACAS'97, Enschede, the Netherlands April 02-04, volume 1217 of Lecture Notes in Computer Science, pages 130--144. Springer, 1997. [ bib ] |
| [36] | Christian Pape and Peter H. Schmitt. Visualizations for Proof Presentation in Theoretical Computer Science Education. In Z. Halim, Th. Ottmann, and Z. Razak, editors, Proceedings of International Conference on Computers in Education, Kuching, Sarawak, Malaysia, December 2--6, pages 229--236. Association for the Advancement of Computing in Education, 1997. [ bib ] |
| [37] | Egon Börger and Peter H.Schmitt. A description of the tableau method using abstract state machines. J. Logic and Computation, 7(5):661--683, 1997. [ bib ] |
| [38] | W. May and P. H. Schmitt. A tableau calculus for first-order branching time logic. In D. .M. Gabbay and H. J. Ohlbach, editors, Intl. Conf. on Formal and Applied Practical Reasoning, FAPR'96, number 1085 in LNCS, pages 399--413. Springer, 1996. [ bib ] |
| [39] | Joachim Posegga and Peter H. Schmitt. Automated deduction with Shannon graphs. J.Logic and Computation, 5(6):697 -- 729, 1995. [ bib ] |
| [40] | Reiner Hähnle and Peter H. Schmitt. The liberalized δ--rule in free variable semantic tableaux. Journal of Automated Reasoning, 13:211--221, 1994. [ bib ] |
| [41] | Bernhard Beckert, Reiner Hähnle, and Peter H. Schmitt. The even more liberalized δ-rule in free variable semantic tableaux. In Georg Gottlob, Alexander Leitsch, and Daniele Mundici, editors, Proceedings of the third Kurt Gödel Colloquium KGC'93, Brno, Czech Republic, pages 108--119. Springer LNCS 713, August 1993. [ bib ] |
| [42] | Jürgen Dix and Peter H. Schmitt. Nichtmonotones schließen: Wieviel nichtmonotonie ist nötig? Kognitionswissenschaft, 3(1):53--69, 1993. [ bib ] |
| [43] | Ch.Beierle, U. Hedstück, U. Pletat, P. H. Schmitt, and J. Siekmann. An order-sorted logic for knowledge representation. Journal of AI, 55:149--191, 1992. [ bib ] |
| [44] | Peter H. Schmitt. Deductive aspects of three-valued logic. In C.-R. Rollinger and O. Herog, editors, Text Understanding in LILOG, Final Report on the IBM Germany LILOG-Project, volume 546 of Lecture Notes in AI, pages 394 -- 401. Springer Verlag, 1991. [ bib ] |
| [45] | Wernecke Wolfgang and Peter H. Schmitt. Tableau calculus for order-sorted logic. In K. H. Bläsius U. Hedstück, C.-R. Rollinger, editor, Sorts and Types in Artificial Intelligence, Proc. of the Workshop, Ehringerfeld, volume 418 of Lecture Notes in AI, pages 49 -- 60. Springer Verlag, 1990. [ bib ] |
| [46] | Peter H. Schmitt and U. Hedtstück. A calculus for order-sorted predicate logic with sort literals. In K. H. Bläsius U. Hedstück, C.-R. Rollinger, editor, Sorts and Types in Artificial Intelligence, Proc. of the Workshop, Ehringerfeld, volume 418 of Lecture Notes in AI, pages 61--72. Springer Verlag, 1990. [ bib ] |
| [47] | Jürgen Dix, Joachim Posegga, and Peter H. Schmitt. Modal logics for ai planning. In Proc. of the First Internat. Conf. on Expert Planning, volume 322 of IEE Conference Publications, pages 157 -- 162, 1990. [ bib ] |
| [48] | Peter H. Schmitt. Perspectives in multi--valued logic. In Rudi Studer, editor, Proceedings International Scientific Symposium on Natural Language and Logic, Hamburg, volume 459 of Lecture Notes in Artificial Intelligence, pages 206 -- 220. Springer Verlag, 1990. [ bib ] |
| [49] | Egon Börger and Peter H. Schmitt. A formal operational semantics for Prolog III using dynamic algebras. In Proceedings of Computer Science Logic, Heidelberg, volume 533 of Lecture Notes in Computer Science, pages 67 -- 79. Springer Verlag, 1990. [ bib ] |
| [50] | J. Dörre, U. Pletat, C.-R. Rollinger, P. H. Schmitt, R. Studer, and Ch. Beierle. The knowledge representation language lLILOG. In Proc. 2nd CSL workshop, Duisburg, volume 385 of Lecture Notes in Computer Science, pages 14 -- 51. Springer Verlag, 1988. [ bib ] |
| [51] | Marek Karpinski, Hans Kleine Büning, and Peter H. Schmitt. The computational complexity of quantified horn clauses. In Proc. of the 1st workshop on Computer Science Logic, volume 329 of Lecture Notes in Computer Science, pages 129 -- 137. Springer Verlag, 1987. [ bib ] |
| [52] | Peter H. Schmitt. A survey on rewrite systems. In Proc. of the 1st workshop on Computer Science Logic, volume 329 of Lecture Notes in Computer Science, pages 235 -- 262. Springer Verlag, 1987. [ bib ] |
| [53] | Peter H. Schmitt. Eine dreiwertige Logik zur Verarbeitung partieller Information. Informatik Forschung und Entwicklung, 2:182--190, 1987. [ bib ] |
| [54] | Peter H. Schmitt. Model theory for valuated abelian groups. In J. B. Paris, A. J. Wilkie, and G. M. Wilmers, editors, Proc. of the Logic Colloqium, 1984, Manchester, volume 120 of Studies in Logic, pages 245 -- 276. North Holland Publishing Co., 1986. [ bib ] |
| [55] | Peter H. Schmitt. Computational aspects of three--valued logic. In Jörg H. Siekmann, editor, 8th International Conference on Automated Deduction, volume 230 of Lecture Notes in Computer Science, pages 190--198. Springer Verlag, 1986. [ bib ] |
| [56] | Yuri Gurevich and Peter H. Schmitt. The theory of ordered abelian groups does not have the independence property. Transactions of the American Mahematical Society, 284:171 -- 182, 1984. [ bib ] |
| [57] | Peter H. Schmitt. Diamond formulas: A fragment of dynamic logic with recursively enumerable validity problem. Information and Control, 61:147 -- 158, 1984. [ bib ] |
| [58] | Gregory Cherlin and Peter H. Schmitt. Locally pure topological abelian groups: Elementary invariants. Annals of Pure and Applied Logic, 24:49 -- 85, 1983. [ bib ] |
| [59] | Peter H. Schmitt. Undecidable theories of valuated abelian groups. In F. Delon, D. Lascar, M. Parigot, and G. Sabbagh, editors, Compte rendu de la table ronde de Logique, 15. - 16. Oct. 1983, volume 112, pages 67--77. Memoire de la Société Mathématique de France, 1983. [ bib ] |
| [60] | Peter H. Schmitt. Model- and substructure complete theories of ordered Abelian groups. In Models and Sets, Proc. of the Logic Colloqium 1983, Aachen, volume 1103, pages 389--418. Springer Verlag, Lecture Notes in Mathematics, 1983. [ bib ] |
| [61] | Peter H. Schmitt. Algebraically complete lattices. Algebra Universalis, 17:135--142, 1983. [ bib ] |
| [62] | Peter H. Schmitt. The lt-theory of profinite Abelian groups. Fundamenta Mathematicae, 69:135--150, 1983. [ bib ] |
| [63] | Peter H. Schmitt. The elementary theory of torsionfree abelian groups with a predicate specifying a subgroup. Zeitschrift f. Mathematische Logik, 28:323--329, 1982. [ bib ] |
| [64] | Greogry Cherlin and Peter H. Schmitt. Undecidable lt-theories of topological abelian groups. Journal of Symbolic Logic, 46(4):761 -- 772, 1981. [ bib ] |
| [65] | Peter H. Schmitt. Normal double stone algebras. Algebra Universalis, 7:205 -- 209, 1977. [ bib ] |
| [66] | Peter H. Schmitt. The model completion of stone algebras. Annales Sci. de l'Université de Clermont, 60:135--155, 1976. [ bib ] |
This file was generated by
Technical Reports
bibtex2html 1.99.
| [1] | Peter H. Schmitt. Takeuti's first-order theory of ordinals revisited. Technical Report 2, Department of Informatics, Karlsruhe Institute of Technology, 2018. [ bib | DOI | http ] |
| [2] | Peter H. Schmitt. Some notes on permutations. Technical Report 7, Department of Informatics, Karlsruhe Institute of Technology, 2017. [ bib | DOI | http ] |
| [3] | Peter H. Schmitt. A first-order theory of ordinals. Technical Report 6, Department of Informatics, Karlsruhe Institute of Technology, 2017. [ bib | DOI | http ] |
| [4] | Bernhard Beckert, Daniel Bruns, Vladimir Klebanov, Christoph Scheben, Peter H. Schmitt, and Mattias Ulbrich. Information flow in object-oriented software -- extended version --. Technical Report 2013-14, Department of Informatics, Karlsruhe Institute of Technology, 2013. [ bib | http ] |
| [5] | Bernhard Beckert, Daniel Bruns, Ralf Küsters, Christoph Scheben, Peter H. Schmitt, and Tomasz Tomasz Truderung. The key approach for the cryptographic verification of java programs: A case study. Technical Report 2012-8, Department of Informatics, Karlsruhe Institute of Technology, 2012. [ bib | http ] |
| [6] | Peter H. Schmitt. A computer-assisted proof of the Bellman-Ford lemma. Technical Report 2011-15, Department of Informatics, Karlsruhe Institute of Technology, 2011. [ bib | http ] |
| [7] | Christoph Scheben and Peter H. Schmitt. Verification of information flow properties of java programs without approximations. In Bernhard Beckert, editor, Formal Verification of Object-Oriented Software, number 2011-26 in Karlsruhe Reports in Informatics, pages 324--341. 2011. [ bib | http ] |
| [8] | Peter H. Schmitt, Mattias Ulbrich, and Benjamin Weiß. Dynamic frames in java dynamic logic. In Bernhard Beckert and Claude Marché, editors, Formal Verification of Object-Oriented Software, number 2010-13 in Karlsruhe Reports in Informatics, pages 113 -- 127. 2010. [ bib | http ] |
| [9] | Peter H. Schmitt, Mattias Ulbrich, and Benjamin Weiß. Dynamic frames in Java dynamic logic. Technical Report 2010-11, Department of Informatics, Karlsruhe Institute of Technology, 2010. [ bib | http ] |
| [10] | Christian Engel and Peter H. Schmitt. A formalization of the RTSJ scoped memory model in dynamic logic. In Bernhard Beckert and Claude Marché, editors, Formal Verification of Object-Oriented Software, number 2010-13 in Karlsruhe Reports in Informatics, pages 298 -- 313. 2010. [ bib | http ] |
| [11] | Christian Engel, Andreas Roth, Peter H. Schmitt, and Benjamin Weiß. Verification of modifies clauses in dynamic logic with non-rigid functions. Technical Report 2009-9, Department of Informatics, Karlsruhe Institute of Technology, 2009. [ bib | http ] |
| [12] | Peter H. Schmitt and Frank Werner. Model checking for energy efficient scheduling in wireless sensor networks. Technical Report 2007-1, Department of Informatics, Karlsruhe Institute of Technology, 2007. [ bib | http ] |
| [13] | Bernhard Beckert, Martin Giese, Reiner Hähnle, Vladimir Klebanov, Philipp Rümmer, Steffen Schlager, and Peter H. Schmitt. The key system 1.0 (deduction component). In Frank Pfenning, editor, CADE, volume 4603 of Lecture Notes in Computer Science, pages 379--384. Springer, 2007. [ bib ] |
| [14] | Wolfgang Ahrendt, Bernhard Beckert, Reiner Hähnle, Philipp Rümmer, and Peter H. Schmitt. Verifying object-oriented programs with key: A tutorial. In Frank S. de Boer, Marcello M. Bonsangue, Susanne Graf, and Willem P. de Roever, editors, Formal Methods for Components and Objects, 5th International Symposium, FMCO 2006, Amsterdam, The Netherlands, November 7-10, 2006, Revised Lectures, volume 4709 of Lecture Notes in Computer Science, pages 70--101. Springer, 2006. [ bib ] |
| [15] | Bernhard Beckert, Steffen Schlager, and Peter H. Schmitt. An improved rule for while loops in deductive program verification. Technical Report 2005-26, Department of Informatics, Karlsruhe Institute of Technology, 2005. [ bib | http ] |
| [16] | Thomas Baar, Dan Chiorean, Alexandre L. Correa, Martin Gogolla, Heinrich Hußmann, Octavian Patrascoiu, Peter H. Schmitt, and Jos Warmer. Tool support for ocl and related formalisms - needs and trends. In Jean-Michel Bruel, editor, Satellite Events at the MoDELS 2005 Conference, MoDELS 2005 International Workshops, Doctoral Symposium, Educators Symposium, Montego Bay, Jamaica, October 2-7, 2005, Revised Selected Papers, volume 3844 of Lecture Notes in Computer Science, pages 1--9. Springer, 2005. [ bib ] |
| [17] | Peter H. Schmitt. Preface. Electr. Notes Theor. Comput. Sci., 102:1--2, 2004. [ bib | http ] |
| [18] | Andreas Roth and Peter H. Schmitt. Ensuring invariant contracts for modules in java. In Proceedings of the ECOOP Workshop FTfJP 2004 Formal Techniques for Java-like Programs, Oslo, Norwegen,, number NIII-R0426 in Technical Reports University of Nijmegen, pages 93--102. 2004. [ bib ] |
| [19] | Stanislas Nanchen, Hubert Schmid, Peter H. Schmitt, and Robert F. Stärk. The ASMKeY prover. Technical Report 436, Department of Computer Science, ETH Zürich and Institute for Logic, Complexity and Deduction Systems, Universität Karlsruhe, 2004. [ bib | http ] |
| [20] | Jean Bézivin, Thomas Baar, Tracy Gardner, Martin Gogolla, Reiner Hähnle, Heinrich Hußmann, Octavian Patrascoiu, Peter H. Schmitt, and Jos Warmer. Ocl and model driven engineering. In Nuno Jardim Nunes, Bran Selic, Alberto Rodrigues da Silva, and José Ambrosio Toval Álvarez, editors, UML Modeling Languages and Applications, UML 2004 Satellite Activities, Lisbon, Portugal, October 11-15, 2004, Revised Selected Papers, volume 3297 of Lecture Notes in Computer Science, pages 67--75. Springer, 2004. [ bib ] |
| [21] | Bernhard Beckert, Uwe Keller, and Peter H. Schmitt. Translating the object constraint language into first-order predicate logic. In Serge Autexier, editor, Proceedings of VERIFY Workshop at Federated Logic Conferences (FLoC), Copenhagen, Denmark, number 2002/07 in DIKU Technical Reports, pages 113--123. Department of Computer Science, Copenhagen, DIKU, 2002. [ bib ] |
| [22] | Peter H. Schmitt. A model theoretic semantics of OCL. In Bernhard Beckert, editor, IJCAR Workshop on Precise Modelling and Deduction for Object-Oriented Software, Siena, Italy, number D II 07/01 in Technical reports Universita degli Studi di Siena, pages 43--57. 2001. [ bib ] |
| [23] | Peter H. Schmitt. Iterate logic. In Reinhard Kahle, Peter Schroeder-Heister, and Robert F. Stärk, editors, Proof Theory in Computer Science, International Seminar, PTCS 2001, Dagstuhl Castle, Germany, October 7-12, 2001, Proceedings, volume 2183 of Lecture Notes in Computer Science, pages 191--201. Springer, 2001. [ bib ] |
| [24] | Thomas Baar, Bernhard Beckert, and Peter H. Schmitt. An extension of dynamic logic for modelling OCL's (at)pre operator. Interner Bericht 2001-7, Fakultät für Informatik, Universität Karlsruhe, 2001. [ bib ] |
| [25] | Wolfgang Ahrendt, Thomas Baar, Bernhard Beckert, Martin Giese, Elmar Habermalz, Reiner Hähnle, Wolfram Menzel, and Peter H. Schmitt. The KeY approach: Integrating object oriented design and formal verification. Technical Report 2000/4, University of Karlsruhe, Department of Computer Science, January 2000. [ bib ] |
| [26] | Reiner Hähnle, Wolfram Menzel, Wolfgang Reif, and Peter H. Schmitt, editors. Special issue on integration of deduction systems. Journal of Universal Computer Science, 5(3):50--51, 1999. [ bib ] |
| [27] | Reiner Hähnle, Wolfram Menzel, Peter H. Schmitt, and Wolfgang Reif. J.ucs special issue on integration of deduction systems. J. UCS, 5(3), 1999. [ bib ] |
| [28] | Christian Pape and Peter H. Schmitt. Interaktive Visualisierungen in der Lehre der Theoretischen Informatik. In Volker Claus, editor, Informatik und Ausbildung, GI-Fachtagung 98, Stuttgart, Informatik Aktuell, pages 102--111. Springer, 1998. [ bib ] |
| [29] | Peter H. Schmitt. Serviceteil Deduktion und Anwendungen. KI, 12(4):64, 1998. [ bib ] |
| [30] | Reiner Hähnle, Wolfram Menzel, and Peter H. Schmitt. Integrierter Deduktiver Software-Entwurf. KI, 12(4):40--41, 1998. [ bib ] |
| [31] | Uwe Glässer and Peter H. Schmitt. Workshop: Abstract state machines. In GI Jahrestagung, pages 381--382, 1998. [ bib ] |
| [32] | Harald Ganzinger, Jörg H. Siekmann, and Peter H. Schmitt. Wohin geht die automatische deduktion? KI, 12(4):33--37, 1998. [ bib ] |
| [33] | Nikolaj S. Bjørner, Reiner Hähnle, Wolfram Menzel, Wofgang Reif, and Peter H. Schmitt. Integration of deductive systems. Technical report, Workshop at the 15th International Conference on Automated Deduction, Lindau, Germany, July 5-10, 1998. [ bib ] |
| [34] | Uwe Glässer and Peter H. Schmitt. Proceedings of the fifth international workshop on abstract state machines. Technical report, Otto von Guericke University Magdeburg, Magdeburg, Germany, September 21-22, 1998. [ bib ] |
| [35] | (Eds.) Peter H. Schmitt, Daniele Mundici, and Lotfi Zadeh. Multiple-valued logic. Dagstuhl-Seminar-Report 194, IBFI, Schloss Dagstuhl, 1997. [ bib ] |
| [36] | (Eds.) Gerard Allwein, Joachim Posegga, and Peter H. Schmitt. Visual reasoning. Workshop at CADE 13, Rutgers University, New Brunswick, 1996. [ bib ] |
| [37] | (Hrsg.) Peter H. Schmitt. Logik in der Informatik. 3. Jahrestagung der GI-Fachgruppe 0.1.6. Technical Report 23/95, Universität Karlsruhe, Mai 1995. [ bib ] |
| [38] | Peter H. Schmitt. Proving WAM compiler correctness. Technical Report 33/94, Fakultät für Informatik, Universität Karlsruhe, 1994. [ bib ] |
| [39] | Victor Marek and Peter H. Schmitt, editors. Special issue on: Non-classical logics and computer science, volume 12, Nos. 3,4 of Annals of Mathematics and Artificial Intelligence, 1994. [ bib ] |
| [40] | Schmitt Peter H. Review of: Nichtklassische Logik, eine Einführung. Journal of Symbolic Logic, 57(3):1138 -- 1140, September 1992. [ bib ] |
| [41] | Egon Börger and Peter H. Schmitt. A formal operational semantics for prolog iii: Using dynamic algebras. IWBS Report, 144, 1990. [ bib ] |
| [42] | Christoph Beierle, Ulrich Hedtstück, Udo Pletat, Peter H. Schmitt, and Jörg H. Siekmann. An order-sorted logic for knowledge representation systems. IWBS Report, 113, 1990. [ bib ] |
| [43] | Ulrich Hedtstück and Peter H. Schmitt. A calculus for order-sorted predicate logic with sort literals. IWBS Report, 95, 1989. [ bib ] |
| [44] | Peter H. Schmitt and Michael Schmitz. Knuth-Bendix Algorithmen. Technical Report 88.06.005, IBM Heidelberg Scientific Center, 1988. [ bib ] |
| [45] | Peter H. Schmitt. Vererbungshierarchien und Prädikatenlogik. In G. Rahmstorf, editor, Wissensrepräsentation in Expertensystemen, volume 172 of Informatik Fachberichte, pages 79 -- 97. Springer Verlag, 1987. [ bib ] |
| [46] | Peter H. Schmitt. Topics in three-valued logic. In PROLOG und PROLOG-Anwendungen, Proc. of the 9th 5-Tage-Kurs, pages 131 -- 155. Universität Bielefeld, FSP Mathematisierung, 1987. [ bib ] |
| [47] | Peter H. Schmitt. The THOT theorem prover. Technical Report TR--87.09.007, IBM Heidelberg Scientific Center, 1987. [ bib ] |
| [48] | Peter H. Schmitt. Mathematical logic and artificial intelligence. LILOG Report 6, IBM Deutschland GmbH, Stuttgart, 1986. [ bib ] |
| [49] | Otthein Herzog, Claus-Rainer Rollinger, Peter H. Schmitt, Petra Steffens, Rudi Studer, Birgit Wesche, Brigitte Bartsch-Spörl, F. Günthner, Christopher Habel, Siegfried Kanngießer, and Christian Rohrer. LILOG - Linguistische und logische Methoden für das maschinelle Verstehen des Deutschen - Projektbeschreibung. LILOG-Report, 1, 1986. [ bib ] |
| [50] | Peter H. Schmitt. Model theory of ordered abelian groups. Habilitationsschrift, 1982. [ bib ] |
| [51] | Peter H. Schmitt. Categorical Lattices. PhD thesis, Universität Heidelberg, 1975. [ bib ] |
This file was generated by