|
|
|
Paolo Baldan, Andrea Corradini, Barbara König, and Stefan Schwoon. McMillan's complete prefix for contextual nets. Transactions on Petri Nets and Other Models of Concurrency, 1:199–220, November 2008. Volume 5100 of Lecture Notes in Computer Science. |
|
|
Javier Esparza, Stefan Kiefer, and Michael Luttenberger. Derivation tree analysis for accelerated fixed-point computation. Technical report, Technische Universität München, Institut für Informatik, September 2008. |
|
|
Martin Sachenbacher and Stefan Schwoon. Model-based test generation using quantified CSPs. In Alban Grastien, Wolfgang Mayer, and Markus Stumptner, editors, Proceedings of the 19th International Workshop on Principles of Diagnosis (DX), pages 159–165, Blue Mountains, Australia, September 2008. |
|
|
Dejvuth Suwimonteerabuth, Javier Esparza, and Stefan Schwoon. Symbolic context-bounded analysis of multithreaded java programs. In Klaus Havelund and Rupak Majumdar, editors, Proceedings of SPIN 2008, volume 5156 of Lecture Notes in Computer Science, pages 270–287, Los Angeles, USA, August 2008. Springer. |
|
|
Stefan Kugele and Wolfgang Haberl. Mapping Data-Flow Dependencies onto Distributed Embedded Systems. In Hamid R. Arabnia and Hassan Reza, editors, Proceedings of the 2008 International Conference on Software Engineering Research & Practice, SERP 2008, volume 1, pages 272–278. CSREA Press, July 2008. |
|
|
Martin Sachenbacher and Stefan Schwoon. Model-based test generation using quantified CSPs: A map. In Bernhard Peischl, Neal Snooke, Gerald Steinbauer, and Cees Witteveen, editors, Proceedings of the ECAI 2008 Workshop on Model-Based Systems, pages 37–41, Patras, Greece, July 2008. |
|
|
Zhonglei Wang, Wolfgang Haberl, Stefan Kugele, and Michael Tautschnig. Automatic Generation of SystemC Models from Component-based Designs for Early Design Validation and Performance Analysis. In Proceedings of the 7th International Workshop on Software and Performance, WOSP 2008, pages 23–26, Princeton, NJ, USA, June 2008. ACM. |
|
|
Javier Esparza, Stefan Kiefer, and Stefan Schwoon. Abstraction refinement with Craig interpolation and symbolic pushdown systems. Journal on Satisfiability, Boolean Modeling and Computation, 5:27–56, June 2008. Special Issue on Constraints to Formal Verification. |
|
|
Achim Rettinger, Matthias Nickles, and Volker Tresp. A statistical relational model for trust learning. In Proceedings of the 7th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), May 2008. |
|
|
Michael Luttenberger. Strategy iteration using non-deterministic strategies for solving parity games. Technical report, Technische Universität München, Institut für Informatik, April 2008. |
|
|
Ahmed Bouajjani, Javier Esparza, Stefan Schwoon, and Dejvuth Suwimonteerabuth. SDSIrep: A reputation system based on SDSI. In C.R. Ramakrishnan and Jakob Rehof, editors, Proceedings of the 14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), volume 4963 of Lecture Notes in Computer Science, pages 501–516, Budapest, Hungary, April 2008. Springer. |
|
|
Sven Bünte and Michael Tautschnig. A Benchmarking Suite for Measurement-Based WCET Analysis Tools. In First International Conference on Software Testing, Verification and Validation (ICST), Lillehammer, Norway, April 2008. IEEE Computer Society Press. |
|
|
Wolfgang Haberl, Michael Tautschnig, and Uwe Baumgarten. Running COLA on Embedded Systems. In Proceedings of The International MultiConference of Engineers and Computer Scientists 2008, Hongkong, China, March 2008. |
|
|
Javier Esparza, Thomas Gawlitza, Stefan Kiefer, and Helmut Seidl. Approximative methods for monotone systems of min-max-polynomial equations. Technical report, Technische Universität München, Institut für Informatik, February 2008. |
|
|
Javier Esparza and Keijo Heljanko. Unfoldings - a partial-order approach to model checking. EATCS Monographs in Theoretical Computer Science. Springer-Verlag, 2008. |
 | PDF (961 kB) |  | Info |  | See www.springer.com ... |  | Author created final book draft made available through our publishing agreement with Springer. Can not be made available on any other Web sites than the author homepages. The book can be purchased from the publisher. If you are interested, follow the link above. | |
|
J. Esparza, P. Jančar, and A. Miller. On the complexity of consistency and complete state coding for signal transition graphs. Fundamenta Informaticae, 86(3):227–253, 2008. |
|
|
J. Bauer, Iovka Boneva, Arend Rensink, and Marcos E. Kurban. A modal-logic based graph abstraction. In Reiko Heckel and Gabriele Taentzer, editors, International Conference of Graph Transformation. Springer, 2008. |
|
|
J. Bauer, Flemming Nielson, Hanne Riis Nielson, and Henrik Pilegaard. Relational analysis of correlation. In 15th International Static Analysis Symposium, volume tba of Lecture Notes in Computer Science. Springer, 2008. |
|
|
Björn Schuller, Matthias Wimmer, Lorenz Moesenlechner, Christian Kern, Dejan Arsic, and Gerhard Rigoll. Brute-forcing hierarchical functionals for paralinguistics: A waste of feature space?. In ICASSP, pages 4501–4504, 2008. |
|
|
Javier Esparza, Stefan Kiefer, and Michael Luttenberger. Convergence thresholds of Newton's method for monotone polynomial equations. In Pascal Weil and Susanne Albers, editors, Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science (STACS), pages 289–300, Bordeaux, France, 2008. Available at http://arxiv.org/abs/0802.2856. |
|
|
Javier Esparza, Thomas Gawlitza, Stefan Kiefer, and Helmut Seidl. Approximative methods for monotone systems of min-max-polynomial equations. In Luca Aceto et al., editor, Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP), part I, volume 5125 of LNCS, pages 698–710, Reykjavik, Iceland, 2008. Springer. |
|
|
Javier Esparza, Stefan Kiefer, and Michael Luttenberger. Solving monotone polynomial equations. In Fifth IFIP International Conference On Theoretical Computer Science (TCS), volume 273 of IFIP International Federation for Information Processing, pages 285–298, Milano, Italy, 2008. Springer. Invited paper. |
|
Javier Esparza, Stefan Kiefer, and Michael Luttenberger. Newton's method for  -continuous semirings. In Luca Aceto et al., editor, Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP), part II, volume 5126 of LNCS, pages 14–26, Reykjavik, Iceland, 2008. Springer. Invited paper. |
|
|
Javier Esparza, Stefan Kiefer, and Michael Luttenberger. Derivation tree analysis for accelerated fixed-point computation. In Masami Ito and Masafumi Toyama, editors, Proceedings of the 12th International Conference on Developments in Language Theory (DLT), volume 5257 of LNCS, pages 301–313, Kyoto, Japan, 2008. Springer. |
|
|
Tomas Brazdil, Vojtech Forejt, Jan Kretinsky, and Antonin Kucera. The satisfiability problem for probabilistic CTL. In LICS, pages 391–402, 2008. |
|
|
Tomas Brazdil, Vojtech Forejt, Jan Kretinsky, and Antonin Kucera. The satisfiability problem for probabilistic CTL. Technical report FIMU-RS-2008-03, Faculty of Informatics, Masaryk University, Brno, 2008. |
|
|
Stefan Kugele, Wolfgang Haberl, Michael Tautschnig, and Martin Wechs. Optimizing automatic deployment using non-functional requirement annotations. In Tiziana Margaria and Bernhard Steffen, editors, Leveraging Applications of Formal Methods, Verification and Validation, volume 17 of CCIS, pages 400–414. Springer, 2008. |
|
|
Javier Esparza, Pradeep Kanade, and Stefan Schwoon. A negative result on depth-first unfoldings. Software Tools for Technology Transfer, 10(2):161–166, 2008. |
|
|
|
Contact
