Unreliable channels are easier to verify than perfect channels
Information and Computation
Handbook of logic in computer science (vol. 3)
Algorithmic analysis of programs with well quasi-ordered domains
Information and Computation - Special issue: LICS 1996—Part 1
Well-structured transition systems everywhere!
Theoretical Computer Science
Ensuring completeness of symbolic verification methods for infinite-state systems
Theoretical Computer Science
Reset Nets Between Decidability and Undecidability
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Polynomial Constants Are Decidable
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
Using Forward Reachability Analysis for Verification of Lossy Channel Systems
Formal Methods in System Design
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
A classification of symbolic transition systems
ACM Transactions on Computational Logic (TOCL)
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Nets with Tokens which Carry Data
Fundamenta Informaticae - PETRI NETS 2007
Deciding Safety Properties in Infinite-State Pi-Calculus via Behavioural Types
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Forward Analysis for WSTS, Part II: Complete WSTS
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
A well-structured framework for analysing petri net extensions
Information and Computation
Journal of Computer and System Sciences
Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS
Journal of Computer and System Sciences
Context-Bounded model checking of concurrent software
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.00 |
Noetherian spaces are a topological concept that generalizes well quasi-orderings. We explore applications to infinite-state verification problems, and show how this stimulated the search for infinite procedures à la Karp-Miller.