Theoretical Computer Science
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
ACM Computing Surveys (CSUR)
Petri nets, commutative context-free grammars, and basic parallel processes
Fundamenta Informaticae
Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
Theoretical Computer Science
On Communicating Finite-State Machines
Journal of the ACM (JACM)
Model checking
An efficient automata approach to some problems on context-free grammars
Information Processing Letters
Well-structured transition systems everywhere!
Theoretical Computer Science
Symbolic model checking with rich assertional languages
Theoretical Computer Science
Counter machines and verification Problems
Theoretical Computer Science
Protocol Description and Analysis Based on a State Transition Model with Channel Expressions
Proceedings of the IFIP WG6.1 Seventh International Conference on Protocol Specification, Testing and Verification VII
BRAIN: Backward Reachability Analysis with Integers
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Timed Automata and the Theory of Real Numbers
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Proving Safety Properties of Infinite State Systems by Compilation into Presburger Arithmetic
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
How to Compose Presburger-Accelerations: Applications to Broadcast Protocols
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
The Power of QDDs (Extended Abstract)
SAS '97 Proceedings of the 4th International Symposium on Static Analysis
Verifying Systems with Infinite but Regular State Spaces
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Symbolic Techniques for Parametric Reasoning about Counter and Clock Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
TReX: A Tool for Reachability Analysis of Complex Systems
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
An Improved Reachability Analysis Method for Strongly Linear Hybrid Systems (Extended Abstract)
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Symbolic Model Checking of Infinite State Systems Using Presburger Arithmetic
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Multiple Counters Automata, Safety Analysis and Presburger Arithmetic
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Well-abstracted transition systems: application to FIFO automata
Information and Computation
Permutation Rewriting and Algorithmic Verification
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Using Forward Reachability Analysis for Verification of Lossy Channel Systems
Formal Methods in System Design
Covering sharing trees: a compact data structure for parameterized verification
International Journal on Software Tools for Technology Transfer (STTT)
About Fast and TReX Accelerations
Electronic Notes in Theoretical Computer Science (ENTCS)
Flat counter automata almost everywhere!
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Reachability in Timed Counter Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Forward Analysis for WSTS, Part II: Complete WSTS
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
SAS '09 Proceedings of the 16th International Symposium on Static Analysis
Systematic acceleration in regular model checking
CAV'07 Proceedings of the 19th international conference on Computer aided verification
On verifying fault tolerance of distributed protocols
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Accelerating interpolation-based model-checking
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
On (Omega-)regular model checking
ACM Transactions on Computational Logic (TOCL)
Extending Abstract Acceleration Methods to Data-Flow Programs with Numerical Inputs
Electronic Notes in Theoretical Computer Science (ENTCS)
Forward analysis and model checking for trace bounded WSTS
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
Bottom-up shape analysis using LISF
ACM Transactions on Programming Languages and Systems (TOPLAS)
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Forward analysis for petri nets with name creation
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Towards a model-checker for counter systems
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Formal Methods in System Design
Applying abstract acceleration to (co-)reachability analysis of reactive programs
Journal of Symbolic Computation
Accelerations for the Coverability Set of Petri Nets with Names
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2010
The theory of WSTS: the case of complete WSTS
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Accelerated data-flow analysis
SAS'07 Proceedings of the 14th international conference on Static Analysis
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Computable fixpoints in well-structured symbolic model checking
Formal Methods in System Design
| Hi-index | 0.00 |
Symbolic model checking provides partially effective verification procedures that can handle systems with an infinite state space. So-called “acceleration techniques” enhance the convergence of fixpoint computations by computing the transitive closure of some transitions. In this paper we develop a new framework for symbolic model checking with accelerations. We also propose and analyze new symbolic algorithms using accelerations to compute reachability sets.