MPI-INF Logo
Publications

Server    halma.mpi-inf.mpg.de

Publications

Entries sorted by: 2. Titles of all years

Login to this database


 

Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)


Show entries starting with: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
TitleAuthor(s) [non member]Editor(s) [non member]YearType
Verification-Integrated Falsification of Non-Deterministic Hybrid Systems
In: 2nd IFAC Conference on Analysis and Design of Hybrid Systems, ?
Ratschan, Stefan
[Smaus, Jan-Georg]
[Cassandras, Christos]
[Giua, Alessandro]
[Seatzu, Carla]
[Zaytoon, Janan]
2006Proceedings Article
Verification of an Off-Line Checker for Priority Queues
In: Third IEEE International Conference on Software Engineering and Formal Methods (SEFM 2005), 210-219
de Nivelle, Hans
Piskac, Ruzica
Aichernig, Bernhard K.
Beckert, Bernhard
2005Proceedings Article
Verification of Cryptographic Protocols: Tagging Enforces Termination
In: Foundations of software science and computation structures : 6th International Conference, FOSSACS 2003, 136-152
Blanchet, Bruno
Podelski, Andreas
[Gordon, Andrew D.]2003Proceedings Article
Verification of Cryptographic Protocols: Tagging Enforces Termination
In: Theoretical Computer Science [333], 67-90
Blanchet, Bruno
Podelski, Andreas
2005Journal Article
Well-Behaved Inference Rules for First-Order Theorem Proving
In: Journal of Automated Reasoning [21], 381-400
Wu, Jinzhao
[Liu, Zhuojun]
1998Journal Article
Where Ignoring Delete Lists Works: Local Search Topology in Planning Benchmarks
In: Journal of Artificial Intelligence Research [24], 685-758
Hoffmann, Jörg2005Journal Article
Wiedemann-Algorithmus zur Lösung dünnbesetzter Gleichungssysteme über Fp
Universität des Saarlandes
Klotzki, Pia1995Thesis - Masters thesis
Workshop CPL Computational Propositional Logic
In: KI-95 Activities: Workshops, Posters, Demos, 71-72
Barth, Peter
[Kleine Büning, Hans]
Weidenbach, Christoph
Dreschler-Fischer, Leonie
Pribbenow, Simone
1995Proceedings Article
$\forall\exists^5$-equational theory of context unification is undecidable
In: Theoretical Computer Science [275], 463-479
Vorobyov, Sergei2002Journal Article
Attachment Icon$\forall\exists^\ast$-Equational Theory of Context Unification is $\Pi_1^0$-Hard
In: Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS-98), 597-606
Vorobyov, SergeiBrim, Lubos
Gruska, Jozef
Zlatuska, Jirí
1998Proceedings Article

Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)