Noetherian Spaces in Verification (original) (raw)
Related papers
22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 2007
Electronic Proceedings in Theoretical Computer Science, 2016
A Decidability Result for the Model Checking of Infinite-State Systems
Journal of Automated Reasoning, 2012
Infinitary Noetherian constructions I. Infinite words
Colloquium Mathematicum
Well Quasi-Orders in Computer Science
2016
Noetherianity and Combination Problems
Lecture Notes in Computer Science, 2007
Verifying systems with infinite but regular state spaces
1998
Better Quasi-Ordered Transition Systems
Corr, 2004
Verification of Infinite State Systems
2002
Preface to the special issue: Computing with infinite data: topological and logical foundations
Mathematical Structures in Computer Science, 2014
1977
08271 Abstracts Collection--Topological and Game-Theoretic Aspects of Infinite Computations}
Uniform approaches to the verification of finite state systems
State University of New York at Albany, Albany, NY, 1997
Local Theory Extensions, Hierarchical Reasoning and Applications to Verification
2007
Recursion and topology on 2⩽ω for possibly infinite computations
Theoretical Computer Science, 2004
The Topology of Provability in Complexity Theory
Journal of Computer and System Sciences, 1986
Proving safety properties of infinite state systems by compilation into Presburger arithmetic
CONCUR '97: Concurrency Theory, 1997
Completeness with Finite Systems of Intermediate Assertions for Recursive Program Schemes
SIAM Journal on Computing, 1980
07441 Abstracts Collection--Algorithmic-Logical Theory of Infinite Structures}
1 Automata-based presentations of infinite structures
2010
Better is better than well: On efficient verification of infinite-state systems
Logic in Computer Science, 2000. …, 2000
A general approach to comparing infinite-state systems with their finite-state specifications
Theoretical Computer Science, 2006
Global model-checking of infinite-state systems
2004
Abstract Logical Model Checking of Infinite-State Systems Using Narrowing
2013
Automata-based presentations of infinite structures
On problems of databases over a fixed infinite universe
Banach Center Publications, 1999
Types and verification for infinite state systems
Mendel Gleason Gavin Types and Verification For Infinite State Systems Phd Thesis Dublin City University, 2012
Computing with Infinite Data: Topological and Logical Foundations (Dagstuhl Seminar 11411)
Computing with Infinite Data: Topological and Logical Foundations Edited by
2011
Theoretical Computer Science, 1998
Verifying Properties of Infinite Sequences of Description Logic Actions
Proceeding of the 2010 conference on ECAI …, 2010
An automata-theoretic approach to reasoning about infinite-state systems
2000