Solving Coverability Problem for Monotonic Counter Systems by Supercompilation
DOI10.1007/978-3-642-29709-0_18zbMATH Open1336.68036OpenAlexW119944932MaRDI QIDQ3457979FDOQ3457979
Authors: Andrei Klimov 
Publication date: 7 December 2015
Published in: Perspectives of Systems Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-29709-0_18
Recommendations
- Monoid-based approach to the inclusion problem on superdeterministic pushdown automata
- Monotonic reductions, representative equivalence, and compilation of intractable problems
- An SMT-based approach to coverability analysis
- Solving the set cover problem on a supercomputer
- Hardness results for coverability problem of well-structured pushdown systems
- Efficient coverability analysis by proof minimization
- The circuit-breaking algorithm for monotone systems
- Extensions of MSO and the monadic counting hierarchy
- REACHABILITY ANALYSIS IN VERIFICATION VIA SUPERCOMPILATION
verificationreachabilitysupercompilationwell-structured transition systemscoverabilitycounter systems
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (4)
- REACHABILITY ANALYSIS IN VERIFICATION VIA SUPERCOMPILATION
- Ping-pong protocols as prefix grammars: modelling and verification via program transformation
- Higher-level supercompilation as a metasystem transition
- Multi-result supercompilation as branching growth of the penultimate level in metasystem transitions
This page was built for publication: Solving Coverability Problem for Monotonic Counter Systems by Supercompilation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3457979)
