|
27
|
Set-based Analysis of Reactive Infinite-state Systems
– Witold Charatonik, Andreas Podelski
- 1997
|
|
6
|
Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs
– Andreas Podelski, Witold Charatonik, Martin Müller
- 1999
|
|
27
|
Set Constraints with Intersection
– Witold Charatonik, Andreas Podelski
|
|
50
|
Verification on Infinite Structures
– Olaf Burkart, Didier Caucal, Faron Moller, Bernhard Steffen
- 2000
|
|
100
|
A Direct Symbolic Approach to Model Checking Pushdown Systems (Extended Abstract)
– Alain Finkel, Bernard Willems, Pierre Wolper
- 1997
|
|
2
|
Micro-macro stack systems: A new frontier of decidability for sequential systems
– Nir Piterman
- 2003
|
|
1
|
Complexity results on branching-time pushdown model checking ✩
– Laura Bozzelli
|
|
1
|
Model Checking for Database Theoreticians
– Moshe Y. Vardi
- 2005
|
|
5
|
Global model-checking of infinite-state systems
– Nir Piterman, Moshe Y. Vardi
- 2004
|
|
12
|
Relating Hierarchies of Word and Tree Automata
– Damian Niwinski, Igor Walukiewicz
- 1998
|
|
29
|
An automata-theoretic approach to reasoning about infinite-state systems
– Orna Kupferman, Moshe Y. Vardi
- 2000
|
|
2
|
Set-based Error Diagnosis of Concurrent Constraint Programs
– Andreas Podelski, Witold Charatonik, Martin Müller
- 1997
|
|
4
|
Church’s Problem and a Tour through Automata Theory
– Wolfgang Thomas
|
|
1
|
Automata and Logic
– Igor Walukiewicz
- 2002
|
|
10
|
Stochastic ω-regular Games
– Krishnendu Chatterjee
- 2007
|
|
|
An extension of Rabin's tree theorem to tree-like structures
– Igor Walukiewicz
|
|
|
Solution of Church’s Problem: A Tutorial
– Wolfgang Thomas
|
|
8
|
The Complexity of Quantitative Concurrent Parity Games
– Krishnendu Chatterjee, Luca de Alfaro, Thomas A. Henzinger
- 2006
|
|
3
|
Entailment of Set Constraints is not Feasible
– Martin Müller, Joachim Niehren
- 1997
|
