Search

Your search keyword '"HABERMEHL, PETER"' showing total 349 results
Start Over Author "HABERMEHL, PETER"

Refine your results

more »

more »

more »

more »
349 results on '"HABERMEHL, PETER"'

1. Algebraic Reasoning Meets Automata in Solving Linear Integer Arithmetic (Technical Report)

Author

Habermehl, Peter, Havlena, Vojtěch, Hečko, Michal, Holík, Lukáš, and Lengál, Ondřej

Subjects
Computer Science - Logic in Computer Science
Abstract

We present a new angle on solving quantified linear integer arithmetic based on combining the automata-based approach, where numbers are understood as bitvectors, with ideas from (nowadays prevalent) algebraic approaches, which work directly with numbers. This combination is enabled by a fine-grained version of the duality between automata and arithmetic formulae. In particular, we employ a construction where states of automaton are obtained as derivatives of arithmetic formulae: then every state corresponds to a formula. Optimizations based on techniques and ideas transferred from the world of algebraic methods are used on thousands of automata states, which dramatically amplifies their effect. The merit of this combination of automata with algebraic methods is demonstrated by our prototype implementation being competitive to and even superior to state-of-the-art SMT solvers., Comment: Accepted to CAV'24

Published
2024

2. Algebraic Reasoning Meets Automata in Solving Linear Integer Arithmetic

Author

Habermehl, Peter, Havlena, Vojtěch, Hečko, Michal, Holík, Lukáš, Lengál, Ondřej, Goos, Gerhard, Series Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Gurfinkel, Arie, editor, and Ganesh, Vijay, editor

Published
2024
Full Text
View/download PDF

3. Data-driven Numerical Invariant Synthesis with Automatic Generation of Attributes

Author

Bouajjani, Ahmed, Boutglay, Wael-Amine, and Habermehl, Peter

Subjects
Computer Science - Programming Languages, Computer Science - Machine Learning, F.3.1
Abstract

We propose a data-driven algorithm for numerical invariant synthesis and verification. The algorithm is based on the ICE-DT schema for learning decision trees from samples of positive and negative states and implications corresponding to program transitions. The main issue we address is the discovery of relevant attributes to be used in the learning process of numerical invariants. We define a method for solving this problem guided by the data sample. It is based on the construction of a separator that covers positive states and excludes negative ones, consistent with the implications. The separator is constructed using an abstract domain representation of convex sets. The generalization mechanism of the decision tree learning from the constraints of the separator allows the inference of general invariants, accurate enough for proving the targeted property. We implemented our algorithm and showed its efficiency.

Published
2022

4. On Presburger arithmetic extended with non-unary counting quantifiers

Author

Habermehl, Peter and Kuske, Dietrich

Subjects
Computer Science - Logic in Computer Science
Abstract

We consider a first-order logic for the integers with addition. This logic extends classical first-order logic by modulo-counting, threshold-counting and exact-counting quantifiers, all applied to tuples of variables (here, residues are given as terms while moduli and thresholds are given explicitly). Our main result shows that satisfaction for this logic is decidable in two-fold exponential space. If only threshold- and exact-counting quantifiers are allowed, we prove an upper bound of alternating two-fold exponential time with linearly many alternations. This latter result almost matches Berman's exact complexity of first-order logic without counting quantifiers. To obtain these results, we first translate threshold- and exact-counting quantifiers into classical first-order logic in polynomial time (which already proves the second result). To handle the remaining modulo-counting quantifiers for tuples, we first reduce them in doubly exponential time to modulo-counting quantifiers for single elements. For these quantifiers, we provide a quantifier elimination procedure similar to Reddy and Loveland's procedure for first-order logic and analyse the growth of coefficients, constants, and moduli appearing in this process. The bounds obtained this way allow to restrict quantification in the original formula to integers of bounded size which then implies the first result mentioned above. Our logic is incomparable with the logic considered by Chistikov et al. in 2022. They allow more general counting operations in quantifiers, but only unary quantifiers. The move from unary to non-unary quantifiers is non-trivial, since, e.g., the non-unary version of the H\"artig quantifier results in an undecidable theory.

Published
2022
Full Text
View/download PDF

5. Left-eigenvectors are certificates of the Orbit Problem

Author

de Oliveira, Steven, Prevosto, Virgile, Habermehl, Peter, and Bensalem, Saddek

Subjects
Computer Science - Logic in Computer Science
Abstract

This paper investigates the connexion between the Kannan-Lipton Orbit Problem and the polynomial invariant generator algorithm PILA based on eigenvectors computation. Namely, we reduce the problem of generating linear and polynomial certificates of non-reachability for the Orbit Problem for linear transformations with rational coefficients to the generalized eigenvector problem. Also, we prove the existence of such certificates for any transformation with integer coefficients, which is not the case with rational coefficients., Comment: 12 pages + references, submutted to ICALP 2018

Published
2018

6. Model-checking Counting Temporal Logics on Flat Structures

Author

Decker, Normann, Habermehl, Peter, Leucker, Martin, Sangnier, Arnaud, and Thoma, Daniel

Subjects
Computer Science - Logic in Computer Science
Abstract

We study several extensions of linear-time and computation-tree temporal logics with quantifiers that allow for counting how often certain properties hold. For most of these extensions, the model-checking problem is undecidable, but we show that decidability can be recovered by considering flat Kripke structures where each state belongs to at most one simple loop. Most decision procedures are based on results on (flat) counter systems where counters are used to implement the evaluation of counting operators., Comment: Extended version providing an additional appendix

Published
2017

8. A Robust Class of Data Languages and an Application to Learning

Author

Bollig, Benedikt, Habermehl, Peter, Leucker, Martin, and Monmege, Benjamin

Subjects
Computer Science - Logic in Computer Science, Computer Science - Formal Languages and Automata Theory
Abstract

We introduce session automata, an automata model to process data words, i.e., words over an infinite alphabet. Session automata support the notion of fresh data values, which are well suited for modeling protocols in which sessions using fresh values are of major interest, like in security protocols or ad-hoc networks. Session automata have an expressiveness partly extending, partly reducing that of classical register automata. We show that, unlike register automata and their various extensions, session automata are robust: They (i) are closed under intersection, union, and (resource-sensitive) complementation, (ii) admit a symbolic regular representation, (iii) have a decidable inclusion problem (unlike register automata), and (iv) enjoy logical characterizations. Using these results, we establish a learning algorithm to infer session automata through membership and equivalence queries.

Published
2014
Full Text
View/download PDF

9. On the Path-Width of Integer Linear Programming

Author

Enea, Constantin, Habermehl, Peter, Inverso, Omar, and Parlato, Gennaro

Subjects
Computer Science - Logic in Computer Science, Computer Science - Computational Complexity, Computer Science - Formal Languages and Automata Theory
Abstract

We consider the feasibility problem of integer linear programming (ILP). We show that solutions of any ILP instance can be naturally represented by an FO-definable class of graphs. For each solution there may be many graphs representing it. However, one of these graphs is of path-width at most 2n, where n is the number of variables in the instance. Since FO is decidable on graphs of bounded path- width, we obtain an alternative decidability result for ILP. The technique we use underlines a common principle to prove decidability which has previously been employed for automata with auxiliary storage. We also show how this new result links to automata theory and program verification., Comment: In Proceedings GandALF 2014, arXiv:1408.5560

Published
2014
Full Text
View/download PDF

10. Ordered Navigation on Multi-attributed Data Words

Author

Decker, Normann, Habermehl, Peter, Leucker, Martin, and Thoma, Daniel

Subjects
Computer Science - Logic in Computer Science, Computer Science - Formal Languages and Automata Theory, F.1.1, F.4.1
Abstract

We study temporal logics and automata on multi-attributed data words. Recently, BD-LTL was introduced as a temporal logic on data words extending LTL by navigation along positions of single data values. As allowing for navigation wrt. tuples of data values renders the logic undecidable, we introduce ND-LTL, an extension of BD-LTL by a restricted form of tuple-navigation. While complete ND-LTL is still undecidable, the two natural fragments allowing for either future or past navigation along data values are shown to be Ackermann-hard, yet decidability is obtained by reduction to nested multi-counter systems. To this end, we introduce and study nested variants of data automata as an intermediate model simplifying the constructions. To complement these results we show that imposing the same restrictions on BD-LTL yields two 2ExpSpace-complete fragments while satisfiability for the full logic is known to be as hard as reachability in Petri nets.

Published
2014

12. Regular Transformations of Data Words Through Origin Information

Author

Durand-Gasselin, Antoine, Habermehl, Peter, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Jacobs, Bart, editor, and Löding, Christof, editor

Published
2016
Full Text
View/download PDF

14. On Presburger Arithmetic Extended with Modulo Counting Quantifiers

Author

Habermehl, Peter, Kuske, Dietrich, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, and Pitts, Andrew, editor

Published
2015
Full Text
View/download PDF

17. Learning Transparent Data Automata

Author

Decker, Normann, Habermehl, Peter, Leucker, Martin, Thoma, Daniel, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Kobsa, Alfred, Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Ciardo, Gianfranco, editor, and Kindler, Ekkart, editor

Published
2014
Full Text
View/download PDF

19. A Fresh Approach to Learning Register Automata

Author

Bollig, Benedikt, Habermehl, Peter, Leucker, Martin, Monmege, Benjamin, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Béal, Marie-Pierre, editor, and Carton, Olivier, editor

Published
2013
Full Text
View/download PDF

20. Forest Automata for Verification of Heap Manipulation

Author

Habermehl, Peter, Holík, Lukáš, Rogalewicz, Adam, Šimáček, Jiří, Vojnar, Tomáš, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Gopalakrishnan, Ganesh, editor, and Qadeer, Shaz, editor

Published
2011
Full Text
View/download PDF

21. On the Use of Non-deterministic Automata for Presburger Arithmetic

Author

Durand-Gasselin, Antoine, Habermehl, Peter, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Gastin, Paul, editor, and Laroussinie, François, editor

Published
2010
Full Text
View/download PDF

22. The Downward-Closure of Petri Net Languages

Author

Habermehl, Peter, Meyer, Roland, Wimmel, Harro, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Abramsky, Samson, editor, Gavoille, Cyril, editor, Kirchner, Claude, editor, Meyer auf der Heide, Friedhelm, editor, and Spirakis, Paul G., editor

Published
2010
Full Text
View/download PDF

23. On Yen’s Path Logic for Petri Nets

Author

Atig, Mohamed Faouzi, Habermehl, Peter, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Bournez, Olivier, editor, and Potapov, Igor, editor

Published
2009
Full Text
View/download PDF

24. Automatic Verification of Integer Array Programs

Author

Bozga, Marius, Habermehl, Peter, Iosif, Radu, Konečný, Filip, Vojnar, Tomáš, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Bouajjani, Ahmed, editor, and Maler, Oded, editor

Published
2009
Full Text
View/download PDF

25. Realizability of Concurrent Recursive Programs

Author

Bollig, Benedikt, Grindei, Manuela-Lidia, Habermehl, Peter, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, and de Alfaro, Luca, editor

Published
2009
Full Text
View/download PDF

26. Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata

Author

Bouajjani, Ahmed, Habermehl, Peter, Holík, Lukáš, Touili, Tayssir, Vojnar, Tomáš, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Ibarra, Oscar H., editor, and Ravikumar, Bala, editor

Published
2008
Full Text
View/download PDF

27. A Logic of Singly Indexed Arrays

Author

Habermehl, Peter, Iosif, Radu, Vojnar, Tomáš, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, Cervesato, Iliano, editor, Veith, Helmut, editor, and Voronkov, Andrei, editor

Published
2008
Full Text
View/download PDF

28. Emptiness of Multi-pushdown Automata Is 2ETIME-Complete

Author

Atig, Mohamed Faouzi, Bollig, Benedikt, Habermehl, Peter, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Ito, Masami, editor, and Toyama, Masafumi, editor

Published
2008
Full Text
View/download PDF

29. What Else Is Decidable about Integer Arrays?

Author

Habermehl, Peter, Iosif, Radu, Vojnar, Tomáš, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Amadio, Roberto, editor

Published
2008
Full Text
View/download PDF

30. Rewriting Systems with Data : A Framework for Reasoning About Systems with Unbounded Structures over Infinite Data Domains

Author

Bouajjani, Ahmed, Habermehl, Peter, Jurski, Yan, Sighireanu, Mihaela, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Csuhaj-Varjú, Erzsébet, editor, and Ésik, Zoltán, editor

Published
2007
Full Text
View/download PDF

31. Proving Termination of Tree Manipulating Programs

Author

Habermehl, Peter, Iosif, Radu, Rogalewicz, Adam, Vojnar, Tomáš, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Namjoshi, Kedar S., editor, Yoneda, Tomohiro, editor, Higashino, Teruo, editor, and Okamura, Yoshio, editor

Published
2007
Full Text
View/download PDF

32. ON PRESBURGER ARITHMETIC EXTENDED WITH NON-UNARY COUNTING QUANTIFIERS.

Author

HABERMEHL, PETER and KUSKE, DIETRICH

Subjects
FIRST-order logic, POLYNOMIAL time algorithms, SATISFACTION, COUNTING, LOGIC, INTEGERS, ARITHMETIC
Abstract

We consider a first-order logic for the integers with addition. This logic extends classical first-order logic by modulo-counting, threshold-counting and exact-counting quantifiers, all applied to tuples of variables (here, residues are given as terms while moduli and thresholds are given explicitly). Our main result shows that satisfaction for this logic is decidable in two-fold exponential space. If only threshold- and exact-counting quantifiers are allowed, we prove an upper bound of alternating two-fold exponential time with linearly many alternations. This latter result almost matches Berman's exact complexity of first-order logic without counting quantifiers. To obtain these results, we first translate threshold- and exact-counting quantifiers into classical first-order logic in polynomial time (which already proves the second result). To handle the remaining modulo-counting quantifiers for tuples, we first reduce them in doubly exponential time to modulo-counting quantifiers for single elements. For these quantifiers, we provide a quantifier elimination procedure similar to Reddy and Loveland's procedure for first-order logic and analyse the growth of coefficients, constants, and moduli appearing in this process. The bounds obtained this way allow to restrict quantification in the original formula to integers of bounded size which then implies the first result mentioned above. Our logic is incomparable with the logic considered by Chistikov et al. in 2022. They allow more general counting operations in quantifiers, but only unary quantifiers. The move from unary to non-unary quantifiers is non-trivial, since, e.g., the non-unary version of the Härtig quantifier results in an undecidable theory. [ABSTRACT FROM AUTHOR]

Published
2023
Full Text
View/download PDF

33. Abstract Regular Tree Model Checking of Complex Dynamic Data Structures

Author

Bouajjani, Ahmed, Habermehl, Peter, Rogalewicz, Adam, Vojnar, Tomáš, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Yi, Kwangkeun, editor

Published
2006
Full Text
View/download PDF

34. Programs with Lists Are Counter Automata

Author

Bouajjani, Ahmed, Bozga, Marius, Habermehl, Peter, Iosif, Radu, Moro, Pierre, Vojnar, Tomáš, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Ball, Thomas, editor, and Jones, Robert B., editor

Published
2006
Full Text
View/download PDF

35. Automata-Based Verification of Programs with Tree Updates

Author

Habermehl, Peter, Iosif, Radu, Vojnar, Tomas, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Dough, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Hermanns, Holger, editor, and Palsberg, Jens, editor

Published
2006
Full Text
View/download PDF

36. Wissen und Tradition

Author

Schnurr-Redford, Christine, Rohweder, Christine, Harich-Schwarzbauer, Henriette, Habermehl, Peter, Harder, Ruth E., Späth, Thomas, editor, and Wagner-Hasel, Beate, editor

Published
2006
Full Text
View/download PDF

37. Griechische und Römische Literatur

Author

Zimmermann, Bernhard, Weglage, Matthias, Nünlist, René, Leidl, Christoph, Kugelmeier, Christoph, Pollmann, Karla, Nothers, Thomas, Scheer, Tanja Susanne, Reitz, Christiane, Brodersen, Kai, Hijmans, Ben, Fakas, Christos, Horster, Detlef, Walde, Christine, Friedrich, Claus, Weber, Ekkehard, Kröner, Hans-Otto, Stanzel, Karl-Heinz, Habermehl, Peter, Jehne, Martin, Fellmeth, Ulrich, Gall, Dorothea, Schneider, Helmuth, Fugmann, Joachim, Radicke, Jan, Nesselrath, Heinz-Günther, Hidber, Thomas, Lennartz, Klaus, Jung, Thomas, Zacher, Klaus-Dieter, Krasser, Helmut, Bachmaier, Helmut, Klaus, Luise, Hallof, Luise, Kortekaas, G. A. A., Brandt, Hartwin, Bernard, Wolfgang, Syndikus, Hans Peter, Engels, Johannes, Bloch, René, Ehlers, Widu-Wolfgang, Asper, Markus, Wißmann, Jessica, Kledt, Annette, Krischer, Tilman, Sonnabend, Holger, Christes, Johannes, Dubischar, Markus, Berthold, Heinz, Nauta, Ruurd, Sherberg, Barbara, Hühn, Helmut, Kinsky, Rüdiger, Holzberg, Niklas, Kißel, Walter, Koster, Severin, Weeber, Karl-Wilhelm, Rothe, Susanne, Vöhler, Martin, Martens, Ekkehard, Winkler, Gerhard, Hirsch-Luipold, Rainer, Trampedach, Kai, Benz, Lore, Zinsmaier, Thomas, Krapinger, Gernot, Fornaro, Sotera, Kraus, Manfred, Fuhrmann, Manfred, Klodt, Claudia, Römer, Franz, Baier, Thomas, Spengler, Hans-Dieter, and Schütze, Oliver, editor

Published
2006
Full Text
View/download PDF

38. P

Author

Lersch-Schumacher, Barbara, Havemann, Miriam, Anastasiadis, Athanasios, Voulgari, Sophia, Carbe, Monika, Simonis, Annette, Bisanti, Tatiana, Scharold, Irmgard, Hristozova, Miglena, Walter, Klaus-Peter, Henke, Florian, Freudenthal, David, Loimeier, Manfred, Schlaeger, Jürgen, Paatz, Annette, Pfeiffer, Erna, Scharf, Kurt, Györffy, Miklós, Habermehl, Peter, Parnell, Christina, Friese, Wilhelm, Haas, Alexandra, Scholz, Ute, Vöhler, Martin, Scheffel, Gerda, Müller, Klaus Peter, Moraldo, Sandro, Reichardt, Ulfried, Martens, Ekkehard, Zimmermann, Bernhard, Breinig, Helmbrecht, Müllenbrock, Heinz-Joachim, Müller, Wolfgang G., Bauhaus-Lötzke, Hannelore, Bajković, Dajana, Brandt, Horst, Klein, Holger, Fischer-Junghölter, Katrin, Eschweiler, Gabriele, Franz, Norbert, Ickstadt, Heinz, and Ruckaberle, Axel, editor

Published
2006
Full Text
View/download PDF

39. A

Author

Hijiya-Kirschnereit, Irmela, Lohse, Rolf, Scholz, Ute, Walther, Wiebke, Breitinger, Eckhard, Döring-Smirnov, Johanna Renate, Horatschek, Anna-M., Pflitsch, Andreas, Györffy, Miklós, Weglage, Matthias, Sagaster, Börte, Bohmeier, Ute, Weigelin-Schwiedrzik, Susanne, Schafroth, Heinz F., Thielmann, Pia, Zimmermann, Bernhard, Kessler, Stephan, Walter, Klaus-Peter, Brandt, Horst, Scharf, Kurt, Reinhart, Werner, Harich-Schwarzbauer, Henriette, Anastasiadis, Athanasios, Voulgari, Sophia, Carbe, Monika, Leitner, Claudia, Smolka, Andrea-Eva, Götsch, Dietmar, Munro, Irmtraut, Gago, Carla, Nieragden, Göran, Zerweck, Bruno, Pollmann, Karla, Riemenschneider, Dieter, Lutz, Bernd, Yngborn, Katarina, Nünning, Ansgar, Detering, Klemens, Bajković, Dajana, Mrugalla, Georg, Fischer-Junghölter, Katrin, Pressler, Frank, Baumgart, Angelika, Weiß, Michaela, Nünlist, René, Humphrey, Richard, Köbke, Jörg, Emmerich, Wolfgang, Bisanti, Tatiana, Sabin, Stefana, Horster, Detlef, Heidtmann, Horst, Schwab, Hans-Rüdiger, Kretschmer, Ernst, Reichardt, Ulfried, Schmidt, Klaus Elmar, Nischik, Reingard M., Figueras, Mercedes, Jarfe, Günther, Habermehl, Peter, Müller, Wolfgang G., Berkemeier, Christian, Glaap, Albert-Reiner, and Ruckaberle, Axel, editor

Published
2006
Full Text
View/download PDF

40. Verifying Programs with Dynamic 1-Selector-Linked Structures in Regular Model Checking

Author

Bouajjani, Ahmed, Habermehl, Peter, Moro, Pierre, Vojnar, Tomáš, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Halbwachs, Nicolas, editor, and Zuck, Lenore D., editor

Published
2005
Full Text
View/download PDF

41. Counting in Trees for Free

Author

Seidl, Helmut, Schwentick, Thomas, Muscholl, Anca, Habermehl, Peter, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Díaz, Josep, editor, Karhumäki, Juhani, editor, Lepistö, Arto, editor, and Sannella, Donald, editor

Published
2004
Full Text
View/download PDF

42. Abstract Regular Model Checking

Author

Bouajjani, Ahmed, Habermehl, Peter, Vojnar, Tomáš, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Alur, Rajeev, editor, and Peled, Doron A., editor

Published
2004
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results