×
Author ID: podelski.andreas Recent zbMATH articles by "Podelski, Andreas"
Published as: Podelski, Andreas
External Links: MGP
all top 5

Co-Authors

5 single-authored
13 Hoenicke, Jochen
13 Rybalchenko, Andrey
9 Heizmann, Matthias
7 Charatonik, Witold
7 Mukhopadhyay, Supratik
7 Nivat, Maurice
6 Aït-Kaci, Hassan
6 Wies, Thomas
5 Bogomolov, Sergiy
5 Delzanno, Giorgio
5 Dietsch, Daniel
5 Farzan, Azadeh
5 Kincaid, Zachary
4 Cook, Byron
4 Muñiz, Marco
4 Westphal, Bernd
3 Calbrix, Hugues
3 Frehse, Goran
3 Malkis, Alexander
3 Niehren, Joachim
3 Nutz, Alexander
3 Smolka, Gert
3 Wagner, Silke
2 Ball, Thomas
2 Beauquier, Danièle
2 Blanchet, Bruno
2 Esparza, Javier
2 Forets, Marcelo
2 Greitschus, Marius
2 Herrera, Christian
2 Jensen, Kurt
2 Kupferschmid, Sebastian
2 Mitrohin, Corina
2 Niwiński, Damian
2 Olderog, Ernst-Rüdiger
2 Rajamani, Sriram K.
2 Schilling, Christian
1 Abdulla, Parosh Aziz
1 Argón, Pablo
1 Atig, Mohamed Faouzi
1 Ayari, Abdelwaheb
1 Basin, David A.
1 Courcelle, Bruno
1 Dimitrova, Rayna
1 Dräger, Klaus
1 Ermis, Evren
1 Feo-Arenis, Sergio
1 Finkbeiner, Bernd
1 Goldstein, Seth Copen
1 Gotsman, Alexey
1 Hoffmann, Jörg
1 Jhala, Ranjit
1 Jones, Neil D.
1 Joshi, Rajeev
1 Klumpp, Dominik
1 Kuncak, Viktor
1 Lam, Patrick P.
1 Langenfeld, Vincent
1 Leike, Jan
1 Leino, K. Rustan M.
1 Leuschel, Michael
1 McAllester, David Allen
1 McMillan, Kenneth L.
1 Müller, Martin
1 Müller, Peter
1 Naouar, Mehdi
1 Padon, Oded
1 Péladeau, Pierre
1 Pnueli, Amir
1 Rinard, Martin C.
1 Sagiv, Mooly
1 Schaefer, Ina
1 Schäf, Martin
1 Schätzle, Claus
1 Seghir, Mohamed Nassim
1 Shoham, Sharon
1 Smaus, Jan-Georg
1 Strump, Thomas
1 Talbot, Jean-Marc
1 Treinen, Ralf
1 Ultes-Nitsche, Ulrich
1 Vardi, Moshe Ya’akov
1 Viry, Frédéric
1 Walukiewicz, Igor
1 Wehrle, Martin

Publications by Year

Citations contained in zbMATH Open

81 Publications have been cited 582 times in 419 Documents Cited by Year
A complete method for the synthesis of linear ranking functions. Zbl 1202.68109
Podelski, Andreas; Rybalchenko, Andrey
50
2004
Transition invariants and transition predicate abstraction for program termination. Zbl 1315.68104
Podelski, Andreas; Rybalchenko, Andrey
34
2011
Boolean and Cartesian abstraction for model checking C programs. Zbl 0978.68540
Ball, Thomas; Podelski, Andreas; Rajamani, Sriram K.
31
2001
Abstraction refinement for termination. Zbl 1141.68365
Cook, Byron; Podelski, Andreas; Rybalchenko, Andrey
24
2005
Nested interpolants. Zbl 1312.68059
Heizmann, Matthias; Hoenicke, Jochen; Podelski, Andreas
22
2010
Ultimately periodic words of rational \(\omega \)-languages. Zbl 1509.68128
Calbrix, Hugues; Nivat, Maurice; Podelski, Andreas
17
1994
A feature constraint system for logic programming with entailment. Zbl 0801.68023
Aït-Kaci, Hassan; Podelski, Andreas; Smolka, Gert
17
1994
Efficient algorithms for pre* and post* on interprocedural parallel flow graphs. Zbl 1323.68407
Esparza, Javier; Podelski, Andreas
17
2000
Model checking of hybrid systems: From reachability towards stability. Zbl 1178.93077
Podelski, Andreas; Wagner, Silke
16
2006
Refinement of trace abstraction. Zbl 1248.68146
Heizmann, Matthias; Hoenicke, Jochen; Podelski, Andreas
13
2009
Towards a meaning of LIFE. Zbl 0801.68018
Aït-Kaci, Hassan; Podelski, Andreas
12
1991
Predicate abstraction for program verification. Zbl 1392.68253
Jhala, Ranjit; Podelski, Andreas; Rybalchenko, Andrey
12
2018
Transition predicate abstraction and fair termination. Zbl 1369.68152
Podelski, Andreas; Rybalchenko, Andrey
12
2005
Relative completeness of abstraction refinement for software model checking. Zbl 1043.68523
Ball, Thomas; Podelski, Andreas; Rajamani, Sriram K.
11
2002
Towards a meaning of LIFE. Zbl 0782.68022
Aït-Kaci, Hassan; Podelski, Andreas
11
1993
Reach set approximation through decomposition with low-dimensional sets and high-dimensional matrices. Zbl 1417.93059
Bogomolov, Sergiy; Forets, Marcelo; Frehse, Goran; Viry, Frédéric; Podelski, Andreas; Schilling, Christian
11
2018
Directed model checking with distance-preserving abstractions. Zbl 1178.68338
Dräger, Klaus; Finkbeiner, Bernd; Podelski, Andreas
11
2006
Tree automata and languages. Zbl 0781.00007
10
1992
Minimal ascending and descending tree automata. Zbl 0868.68080
Nivat, Maurice; Podelski, Andreas
10
1997
Boolean heaps. Zbl 1141.68374
Podelski, Andreas; Wies, Thomas
10
2005
Counterexample-guided focus. Zbl 1312.68067
Podelski, Andreas; Wies, Thomas
10
2010
Inductive data flow graphs. Zbl 1301.68178
Farzan, Azadeh; Kincaid, Zachary; Podelski, Andreas
9
2013
Linear ranking for linear lasso programs. Zbl 1410.68086
Heizmann, Matthias; Hoenicke, Jochen; Leike, Jan; Podelski, Andreas
9
2013
Proving that programs eventually do something good. Zbl 1295.68083
Cook, Byron; Gotsman, Alexey; Podelski, Andreas; Rybalchenko, Andrey; Vardi, Moshe Y.
9
2007
A geometrical view of the determinization and minimization of finite- state automata. Zbl 0722.68080
Courcelle, Bruno; Niwinski, Damian; Podelski, Andreas
8
1991
Verification of cryptographic protocols: Tagging enforces termination. Zbl 1029.94501
Blanchet, Bruno; Podelski, Andreas
8
2003
Verification of cryptographic protocols: tagging enforces termination. Zbl 1070.68033
Blanchet, Bruno; Podelski, Andreas
7
2005
On ultimately periodic words of rational \(\omega\)-languages. (Sur les mots ultimement périodiques des langages rationnels de mots infinis.) Zbl 0917.20053
Calbrix, Hugues; Nivat, Maurice; Podelski, Andreas
6
1994
Definite tree languages (cont’d). Zbl 0677.68066
Nivat, Maurice; Podelski, Andreas
6
1989
Constraint-based deductive model checking. Zbl 0991.68013
Delzanno, Giorgio; Podelski, Andreas
6
2001
The Horn mu-calculus. Zbl 0945.03541
Charatonik, Witold; McAllester, David; Niwiński, Damian; Podelski, Andreas; Walukiewicz, Igor
6
1998
Abstraction refinement for quantified array assertions. Zbl 1248.68151
Seghir, Mohamed Nassim; Podelski, Andreas; Wies, Thomas
6
2009
Size-change termination and transition invariants. Zbl 1306.68028
Heizmann, Matthias; Jones, Neil D.; Podelski, Andreas
6
2010
Region stability proofs for hybrid systems. Zbl 1141.93353
Podelski, Andreas; Wagner, Silke
6
2007
Constraint-based analysis of broadcast protocols. Zbl 0944.68139
Delzanno, Giorgio; Esparza, Javier; Podelski, Andreas
6
1999
Proving liveness of parameterized programs. Zbl 1401.68038
Farzan, Azadeh; Kincaid, Zachary; Podelski, Andreas
6
2016
Thread modularity at many levels: a pearl in compositional verification. Zbl 1380.68274
Hoenicke, Jochen; Majumdar, Rupak; Podelski, Andreas
6
2017
Model checking as constraint solving. Zbl 0966.68121
Podelski, Andreas
5
2000
Proof spaces for unbounded parallelism. Zbl 1345.68102
Farzan, Azadeh; Kincaid, Zachary; Podelski, Andreas
5
2015
Ultimate TreeAutomizer (CHC-COMP tool description). Zbl 1483.68243
Dietsch, Daniel; Heizmann, Matthias; Hoenicke, Jochen; Nutz, Alexander; Podelski, Andreas
5
2019
Feature automata and recognizable sets of feature trees. Zbl 1497.68146
Niehren, Joachim; Podelski, Andreas
5
1993
Fairness modulo theory: a new approach to LTL software model checking. Zbl 1381.68157
Dietsch, Daniel; Heizmann, Matthias; Langenfeld, Vincent; Podelski, Andreas
5
2015
Field constraint analysis. Zbl 1176.68130
Wies, Thomas; Kuncak, Viktor; Lam, Patrick; Podelski, Andreas; Rinard, Martin
5
2006
Verification of infinite-state systems in constraint logic programming. Zbl 0947.68028
Delzanno, Giorgio; Podelski, Andreas
4
1999
Set constraints with intersection. Zbl 1096.68023
Charatonik, Witold; Podelski, Andreas
4
2002
Using predicate abstraction to generate heuristic functions in UPPAAL. Zbl 1196.68139
Hoffmann, Jörg; Smaus, Jan-Georg; Rybalchenko, Andrey; Kupferschmid, Sebastian; Podelski, Andreas
4
2007
On reverse and general definite tree languages (extended abstract). Zbl 1425.68225
Péladeau, Pierre; Podelski, Andreas
4
1992
Push-down automata with gap-order constraints. Zbl 1434.68222
Abdulla, Parosh Aziz; Atig, Mohamed Faouzi; Delzanno, Giorgio; Podelski, Andreas
4
2013
Eliminating spurious transitions in reachability with support functions. Zbl 1364.93056
Frehse, Goran; Bogomolov, Sergiy; Greitschus, Marius; Strump, Thomas; Podelski, Andreas
4
2015
Proofs that count. Zbl 1284.68395
Farzan, Azadeh; Kincaid, Zachary; Podelski, Andreas
4
2014
A feature-based constraint system for logic programming with entailment. Zbl 0862.68024
Aït-Kaci, Hassan; Podelski, Andreas; Smolka, Gert
3
1992
Order-sorted feature theory unification. Zbl 0884.68025
Aït-Kaci, Hassan; Podelski, Andreas; Goldstein, Seth Copen
3
1997
Summarization for termination: No return! Zbl 1185.68412
Cook, Byron; Podelski, Andreas; Rybalchenko, Andrey
3
2009
Splitting via interpolants. Zbl 1326.68091
Ermis, Evren; Hoenicke, Jochen; Podelski, Andreas
3
2012
Explicit fair scheduling for dynamic control. Zbl 1274.68035
Olderog, Ernst-Rüdiger; Podelski, Andreas
3
2010
Thread-modular verification is Cartesian abstract interpretation. Zbl 1168.68423
Malkis, Alexander; Podelski, Andreas; Rybalchenko, Andrey
3
2006
Fairness for dynamic control. Zbl 1284.68400
Hoenicke, Jochen; Olderog, Ernst-Rüdiger; Podelski, Andreas
3
2010
Directional type inference for logic programs. Zbl 0917.68043
Charatonik, Witold; Podelski, Andreas
3
1998
The independence property of a class of set constraints. Zbl 0886.03023
Charatonik, Witold; Podelski, Andreas
2
1996
Tools and algorithms for the construction and analysis of systems. 10th international conference, TACAS 2004, held as part of the joint conferences on theory and practice of software, ETAPS 2004, Barcelona, Spain, March 29 – April 2, 2004. Proceedings. Zbl 1046.68008
2
2004
Timed automata with disjoint activity. Zbl 1374.68263
Muñiz, Marco; Westphal, Bernd; Podelski, Andreas
2
2012
Composing reachability analyses of hybrid systems for safety and stability. Zbl 1305.68110
Bogomolov, Sergiy; Mitrohin, Corina; Podelski, Andreas
2
2010
Composing stability proofs for hybrid systems. Zbl 1348.68107
Mitrohin, Corina; Podelski, Andreas
2
2011
Paths vs. trees in set-based program analysis. Zbl 1323.68201
Charatonik, Witold; Podelski, Andreas; Talbot, Jean-Marc
2
2000
A monoid approach to tree automata. Zbl 0798.68113
Podelski, Andreas
1
1992
Entailment and disentailment of order-sorted feature constraints. Zbl 0793.68022
Aït-Kaci, Hassan; Podelski, Andreas
1
1993
Ordering constraints over feature trees. Zbl 0947.68137
Müller, Martin; Niehren, Joachim; Podelski, Andreas
1
2000
Constraint-based infinite model checking and tabulation for stratified CLP. Zbl 1045.68089
Charatonik, Witold; Mukhopadhyay, Supratik; Podelski, Andreas
1
2002
Separating fairness and well-foundedness for the analysis of fair discrete systems. Zbl 1087.68066
Pnueli, Amir; Podelski, Andreas; Rybalchenko, Andrey
1
2005
Summaries for while programs with recursion. Zbl 1108.68428
Podelski, Andreas; Schaefer, Ina; Wagner, Silke
1
2005
Doomed program points. Zbl 1211.68090
Hoenicke, Jochen; Leino, K. Rustan M.; Podelski, Andreas; Schäf, Martin; Wies, Thomas
1
2010
Precise thread-modular verification. Zbl 1211.68095
Malkis, Alexander; Podelski, Andreas; Rybalchenko, Andrey
1
2007
Transition-based directed model checking. Zbl 1234.68268
Wehrle, Martin; Kupferschmid, Sebastian; Podelski, Andreas
1
2009
Thread-modular counterexample-guided abstraction refinement. Zbl 1306.68031
Malkis, Alexander; Podelski, Andreas; Rybalchenko, Andrey
1
2010
Heap assumptions on demand. Zbl 1155.68446
Podelski, Andreas; Rybalchenko, Andrey; Wies, Thomas
1
2008
Loop invariants from counterexamples. Zbl 1420.68128
Greitschus, Marius; Dietsch, Daniel; Podelski, Andreas
1
2017
Equational and membership constraints for infinite trees. Zbl 1503.68041
Niehren, Joachim; Podelski, Andreas; Treinen, Ralf
1
1993
Fairness for infinitary control. Zbl 1444.68018
Hoenicke, Jochen; Podelski, Andreas
1
2015
Is lazy abstraction a decision procedure for broadcast protocols? Zbl 1138.68445
Dimitrova, Rayna; Podelski, Andreas
1
2008
Temporal prophecy for proving temporal properties of infinite-state systems. Zbl 1522.68340
Padon, Oded; Hoenicke, Jochen; McMillan, Kenneth L.; Podelski, Andreas; Sagiv, Mooly; Shoham, Sharon
1
2021
Quasi-dependent variables in hybrid automata. Zbl 1361.68118
Bogomolov, Sergiy; Herrera, Christian; Muñiz, Marco; Westphal, Bernd; Podelski, Andreas
1
2014
Temporal prophecy for proving temporal properties of infinite-state systems. Zbl 1522.68340
Padon, Oded; Hoenicke, Jochen; McMillan, Kenneth L.; Podelski, Andreas; Sagiv, Mooly; Shoham, Sharon
1
2021
Ultimate TreeAutomizer (CHC-COMP tool description). Zbl 1483.68243
Dietsch, Daniel; Heizmann, Matthias; Hoenicke, Jochen; Nutz, Alexander; Podelski, Andreas
5
2019
Predicate abstraction for program verification. Zbl 1392.68253
Jhala, Ranjit; Podelski, Andreas; Rybalchenko, Andrey
12
2018
Reach set approximation through decomposition with low-dimensional sets and high-dimensional matrices. Zbl 1417.93059
Bogomolov, Sergiy; Forets, Marcelo; Frehse, Goran; Viry, Frédéric; Podelski, Andreas; Schilling, Christian
11
2018
Thread modularity at many levels: a pearl in compositional verification. Zbl 1380.68274
Hoenicke, Jochen; Majumdar, Rupak; Podelski, Andreas
6
2017
Loop invariants from counterexamples. Zbl 1420.68128
Greitschus, Marius; Dietsch, Daniel; Podelski, Andreas
1
2017
Proving liveness of parameterized programs. Zbl 1401.68038
Farzan, Azadeh; Kincaid, Zachary; Podelski, Andreas
6
2016
Proof spaces for unbounded parallelism. Zbl 1345.68102
Farzan, Azadeh; Kincaid, Zachary; Podelski, Andreas
5
2015
Fairness modulo theory: a new approach to LTL software model checking. Zbl 1381.68157
Dietsch, Daniel; Heizmann, Matthias; Langenfeld, Vincent; Podelski, Andreas
5
2015
Eliminating spurious transitions in reachability with support functions. Zbl 1364.93056
Frehse, Goran; Bogomolov, Sergiy; Greitschus, Marius; Strump, Thomas; Podelski, Andreas
4
2015
Fairness for infinitary control. Zbl 1444.68018
Hoenicke, Jochen; Podelski, Andreas
1
2015
Proofs that count. Zbl 1284.68395
Farzan, Azadeh; Kincaid, Zachary; Podelski, Andreas
4
2014
Quasi-dependent variables in hybrid automata. Zbl 1361.68118
Bogomolov, Sergiy; Herrera, Christian; Muñiz, Marco; Westphal, Bernd; Podelski, Andreas
1
2014
Inductive data flow graphs. Zbl 1301.68178
Farzan, Azadeh; Kincaid, Zachary; Podelski, Andreas
9
2013
Linear ranking for linear lasso programs. Zbl 1410.68086
Heizmann, Matthias; Hoenicke, Jochen; Leike, Jan; Podelski, Andreas
9
2013
Push-down automata with gap-order constraints. Zbl 1434.68222
Abdulla, Parosh Aziz; Atig, Mohamed Faouzi; Delzanno, Giorgio; Podelski, Andreas
4
2013
Splitting via interpolants. Zbl 1326.68091
Ermis, Evren; Hoenicke, Jochen; Podelski, Andreas
3
2012
Timed automata with disjoint activity. Zbl 1374.68263
Muñiz, Marco; Westphal, Bernd; Podelski, Andreas
2
2012
Transition invariants and transition predicate abstraction for program termination. Zbl 1315.68104
Podelski, Andreas; Rybalchenko, Andrey
34
2011
Composing stability proofs for hybrid systems. Zbl 1348.68107
Mitrohin, Corina; Podelski, Andreas
2
2011
Nested interpolants. Zbl 1312.68059
Heizmann, Matthias; Hoenicke, Jochen; Podelski, Andreas
22
2010
Counterexample-guided focus. Zbl 1312.68067
Podelski, Andreas; Wies, Thomas
10
2010
Size-change termination and transition invariants. Zbl 1306.68028
Heizmann, Matthias; Jones, Neil D.; Podelski, Andreas
6
2010
Explicit fair scheduling for dynamic control. Zbl 1274.68035
Olderog, Ernst-Rüdiger; Podelski, Andreas
3
2010
Fairness for dynamic control. Zbl 1284.68400
Hoenicke, Jochen; Olderog, Ernst-Rüdiger; Podelski, Andreas
3
2010
Composing reachability analyses of hybrid systems for safety and stability. Zbl 1305.68110
Bogomolov, Sergiy; Mitrohin, Corina; Podelski, Andreas
2
2010
Doomed program points. Zbl 1211.68090
Hoenicke, Jochen; Leino, K. Rustan M.; Podelski, Andreas; Schäf, Martin; Wies, Thomas
1
2010
Thread-modular counterexample-guided abstraction refinement. Zbl 1306.68031
Malkis, Alexander; Podelski, Andreas; Rybalchenko, Andrey
1
2010
Refinement of trace abstraction. Zbl 1248.68146
Heizmann, Matthias; Hoenicke, Jochen; Podelski, Andreas
13
2009
Abstraction refinement for quantified array assertions. Zbl 1248.68151
Seghir, Mohamed Nassim; Podelski, Andreas; Wies, Thomas
6
2009
Summarization for termination: No return! Zbl 1185.68412
Cook, Byron; Podelski, Andreas; Rybalchenko, Andrey
3
2009
Transition-based directed model checking. Zbl 1234.68268
Wehrle, Martin; Kupferschmid, Sebastian; Podelski, Andreas
1
2009
Heap assumptions on demand. Zbl 1155.68446
Podelski, Andreas; Rybalchenko, Andrey; Wies, Thomas
1
2008
Is lazy abstraction a decision procedure for broadcast protocols? Zbl 1138.68445
Dimitrova, Rayna; Podelski, Andreas
1
2008
Proving that programs eventually do something good. Zbl 1295.68083
Cook, Byron; Gotsman, Alexey; Podelski, Andreas; Rybalchenko, Andrey; Vardi, Moshe Y.
9
2007
Region stability proofs for hybrid systems. Zbl 1141.93353
Podelski, Andreas; Wagner, Silke
6
2007
Using predicate abstraction to generate heuristic functions in UPPAAL. Zbl 1196.68139
Hoffmann, Jörg; Smaus, Jan-Georg; Rybalchenko, Andrey; Kupferschmid, Sebastian; Podelski, Andreas
4
2007
Precise thread-modular verification. Zbl 1211.68095
Malkis, Alexander; Podelski, Andreas; Rybalchenko, Andrey
1
2007
Model checking of hybrid systems: From reachability towards stability. Zbl 1178.93077
Podelski, Andreas; Wagner, Silke
16
2006
Directed model checking with distance-preserving abstractions. Zbl 1178.68338
Dräger, Klaus; Finkbeiner, Bernd; Podelski, Andreas
11
2006
Field constraint analysis. Zbl 1176.68130
Wies, Thomas; Kuncak, Viktor; Lam, Patrick; Podelski, Andreas; Rinard, Martin
5
2006
Thread-modular verification is Cartesian abstract interpretation. Zbl 1168.68423
Malkis, Alexander; Podelski, Andreas; Rybalchenko, Andrey
3
2006
Abstraction refinement for termination. Zbl 1141.68365
Cook, Byron; Podelski, Andreas; Rybalchenko, Andrey
24
2005
Transition predicate abstraction and fair termination. Zbl 1369.68152
Podelski, Andreas; Rybalchenko, Andrey
12
2005
Boolean heaps. Zbl 1141.68374
Podelski, Andreas; Wies, Thomas
10
2005
Verification of cryptographic protocols: tagging enforces termination. Zbl 1070.68033
Blanchet, Bruno; Podelski, Andreas
7
2005
Separating fairness and well-foundedness for the analysis of fair discrete systems. Zbl 1087.68066
Pnueli, Amir; Podelski, Andreas; Rybalchenko, Andrey
1
2005
Summaries for while programs with recursion. Zbl 1108.68428
Podelski, Andreas; Schaefer, Ina; Wagner, Silke
1
2005
A complete method for the synthesis of linear ranking functions. Zbl 1202.68109
Podelski, Andreas; Rybalchenko, Andrey
50
2004
Tools and algorithms for the construction and analysis of systems. 10th international conference, TACAS 2004, held as part of the joint conferences on theory and practice of software, ETAPS 2004, Barcelona, Spain, March 29 – April 2, 2004. Proceedings. Zbl 1046.68008
2
2004
Verification of cryptographic protocols: Tagging enforces termination. Zbl 1029.94501
Blanchet, Bruno; Podelski, Andreas
8
2003
Relative completeness of abstraction refinement for software model checking. Zbl 1043.68523
Ball, Thomas; Podelski, Andreas; Rajamani, Sriram K.
11
2002
Set constraints with intersection. Zbl 1096.68023
Charatonik, Witold; Podelski, Andreas
4
2002
Constraint-based infinite model checking and tabulation for stratified CLP. Zbl 1045.68089
Charatonik, Witold; Mukhopadhyay, Supratik; Podelski, Andreas
1
2002
Boolean and Cartesian abstraction for model checking C programs. Zbl 0978.68540
Ball, Thomas; Podelski, Andreas; Rajamani, Sriram K.
31
2001
Constraint-based deductive model checking. Zbl 0991.68013
Delzanno, Giorgio; Podelski, Andreas
6
2001
Efficient algorithms for pre* and post* on interprocedural parallel flow graphs. Zbl 1323.68407
Esparza, Javier; Podelski, Andreas
17
2000
Model checking as constraint solving. Zbl 0966.68121
Podelski, Andreas
5
2000
Paths vs. trees in set-based program analysis. Zbl 1323.68201
Charatonik, Witold; Podelski, Andreas; Talbot, Jean-Marc
2
2000
Ordering constraints over feature trees. Zbl 0947.68137
Müller, Martin; Niehren, Joachim; Podelski, Andreas
1
2000
Constraint-based analysis of broadcast protocols. Zbl 0944.68139
Delzanno, Giorgio; Esparza, Javier; Podelski, Andreas
6
1999
Verification of infinite-state systems in constraint logic programming. Zbl 0947.68028
Delzanno, Giorgio; Podelski, Andreas
4
1999
The Horn mu-calculus. Zbl 0945.03541
Charatonik, Witold; McAllester, David; Niwiński, Damian; Podelski, Andreas; Walukiewicz, Igor
6
1998
Directional type inference for logic programs. Zbl 0917.68043
Charatonik, Witold; Podelski, Andreas
3
1998
Minimal ascending and descending tree automata. Zbl 0868.68080
Nivat, Maurice; Podelski, Andreas
10
1997
Order-sorted feature theory unification. Zbl 0884.68025
Aït-Kaci, Hassan; Podelski, Andreas; Goldstein, Seth Copen
3
1997
The independence property of a class of set constraints. Zbl 0886.03023
Charatonik, Witold; Podelski, Andreas
2
1996
Ultimately periodic words of rational \(\omega \)-languages. Zbl 1509.68128
Calbrix, Hugues; Nivat, Maurice; Podelski, Andreas
17
1994
A feature constraint system for logic programming with entailment. Zbl 0801.68023
Aït-Kaci, Hassan; Podelski, Andreas; Smolka, Gert
17
1994
On ultimately periodic words of rational \(\omega\)-languages. (Sur les mots ultimement périodiques des langages rationnels de mots infinis.) Zbl 0917.20053
Calbrix, Hugues; Nivat, Maurice; Podelski, Andreas
6
1994
Towards a meaning of LIFE. Zbl 0782.68022
Aït-Kaci, Hassan; Podelski, Andreas
11
1993
Feature automata and recognizable sets of feature trees. Zbl 1497.68146
Niehren, Joachim; Podelski, Andreas
5
1993
Entailment and disentailment of order-sorted feature constraints. Zbl 0793.68022
Aït-Kaci, Hassan; Podelski, Andreas
1
1993
Equational and membership constraints for infinite trees. Zbl 1503.68041
Niehren, Joachim; Podelski, Andreas; Treinen, Ralf
1
1993
Tree automata and languages. Zbl 0781.00007
10
1992
On reverse and general definite tree languages (extended abstract). Zbl 1425.68225
Péladeau, Pierre; Podelski, Andreas
4
1992
A feature-based constraint system for logic programming with entailment. Zbl 0862.68024
Aït-Kaci, Hassan; Podelski, Andreas; Smolka, Gert
3
1992
A monoid approach to tree automata. Zbl 0798.68113
Podelski, Andreas
1
1992
Towards a meaning of LIFE. Zbl 0801.68018
Aït-Kaci, Hassan; Podelski, Andreas
12
1991
A geometrical view of the determinization and minimization of finite- state automata. Zbl 0722.68080
Courcelle, Bruno; Niwinski, Damian; Podelski, Andreas
8
1991
Definite tree languages (cont’d). Zbl 0677.68066
Nivat, Maurice; Podelski, Andreas
6
1989
all top 5

Cited by 763 Authors

23 Podelski, Andreas
10 Hoenicke, Jochen
9 Giesl, Jürgen
8 Kröning, Daniel
7 Fisman, Dana
6 Angluin, Dana
6 Bouajjani, Ahmed
6 Cook, Byron
6 Frohn, Florian
6 Heizmann, Matthias
6 Kuncak, Viktor
6 Touili, Tayssir
6 Wies, Thomas
5 Atig, Mohamed Faouzi
5 Ben-Amram, Amir M.
5 Bogomolov, Sergiy
5 Delaune, Stéphanie
5 Fedyukovich, Grigory
5 Gallagher, John P.
5 Genaim, Samir
5 Hensel, Jera
5 Li, Yong
5 Niehren, Joachim
5 Sharygina, Natasha
5 Steila, Silvia
5 Treinen, Ralf
4 Abdulla, Parosh Aziz
4 Bak, Stanley
4 Brockschmidt, Marc
4 Cortier, Véronique
4 Frehse, Goran
4 Ghilardi, Silvio
4 Griggio, Alberto
4 Gurfinkel, Arie
4 Hoffmann, Jörg
4 Kapur, Deepak
4 Lugiez, Denis
4 Meyer, Roland
4 Olderog, Ernst-Rüdiger
4 Ouaknine, Joel O.
4 Rümmer, Philipp
4 Rybalchenko, Andrey
4 Schilling, Christian
4 Schneider-Kamp, Peter
4 Seidl, Helmut
4 Smolka, Gert
4 Ströder, Thomas
4 Vojnar, Tomáš
4 Wintersteiger, Christoph M.
4 Worrell, James B.
4 Zhang, Lijun
3 Aït-Kaci, Hassan
3 Backofen, Rolf
3 Beyer, Dirk
3 Carrasco, Rafael C.
3 Cimatti, Alessandro
3 Dietsch, Daniel
3 Duan, Zhenhua
3 Enea, Constantin
3 Falke, Stephan
3 Forets, Marcelo
3 Fuhs, Carsten
3 Ganty, Pierre
3 Gupta, Aarti
3 Hague, Matthew
3 Hermenegildo, Manuel V.
3 Iosif, Radu
3 Kobayashi, Naoki
3 Kochdumper, Niklas
3 Kupferschmid, Sebastian
3 Lengál, Ondřej
3 Li, Yi
3 Miné, Antoine
3 Muskalla, Sebastian
3 Nutz, Alexander
3 Platzer, André
3 Ramakrishnan, C. R.
3 Schnoebelen, Philippe
3 Seki, Hirohisa
3 Strejček, Jan
3 Tan, Yong Kiam
3 Tian, Cong
3 Tonetta, Stefano
3 Vardi, Moshe Ya’akov
3 Wehrle, Martin
3 Weissenbacher, Georg
3 Xia, Bican
3 Zhan, Naijun
3 Zhang, Nan
3 Zuleger, Florian
2 Albert, Elvira
2 Alberti, Francesco
2 Althoff, Matthias
2 Antonopoulos, Timos
2 Arapinis, Myrto
2 Aschermann, Cornelius
2 Barrett, Clark W.
2 Berardi, Stefano
2 Boiret, Adrien
2 Calera-Rubio, Jorge
...and 663 more Authors
all top 5

Cited in 54 Serials

42 Theoretical Computer Science
26 Formal Methods in System Design
19 Information and Computation
15 Journal of Automated Reasoning
10 Formal Aspects of Computing
9 Artificial Intelligence
9 Journal of Logical and Algebraic Methods in Programming
6 Theory and Practice of Logic Programming
6 Logical Methods in Computer Science
5 Acta Informatica
5 Journal of Computer and System Sciences
5 International Journal of Foundations of Computer Science
4 Information Processing Letters
3 Journal of Symbolic Computation
3 Journal of Computer Science and Technology
3 New Generation Computing
3 Constraints
3 Journal of the ACM
3 Fundamenta Informaticae
3 Journal of Systems Science and Complexity
3 Computer Languages, Systems & Structures
2 Automatica
2 Science of Computer Programming
2 Annals of Pure and Applied Logic
2 Mathematical Structures in Computer Science
2 Cybernetics and Systems Analysis
2 Annals of Mathematics and Artificial Intelligence
2 RAIRO. Theoretical Informatics and Applications
2 Journal of Applied Mathematics
2 ACM Transactions on Computational Logic
2 Nonlinear Analysis. Hybrid Systems
1 International Journal of Control
1 International Journal of General Systems
1 Journal of the Franklin Institute
1 Fuzzy Sets and Systems
1 The Journal of Symbolic Logic
1 Programming and Computer Software
1 Studia Logica
1 Applied Mathematics Letters
1 Real-Time Systems
1 Machine Learning
1 Applied Intelligence
1 Pattern Recognition
1 Journal of Logic, Language and Information
1 Journal of Functional Programming
1 The Journal of Artificial Intelligence Research (JAIR)
1 Journal of Combinatorial Optimization
1 Higher-Order and Symbolic Computation
1 The Journal of Logic and Algebraic Programming
1 Sādhanā
1 Mathematics in Computer Science
1 Science China. Information Sciences
1 Frontiers of Computer Science in China
1 Modelirovanie i Analiz Informatsionnykh Sistem

Citations by Year