Abstract
Abstractions can cause spurious results, which need to be verified in the concrete system to gain conclusive results. Verification based on a multi-valued logic can distinguish between conclusive and inconclusive results, provides increased precision, and allows for encoding additional information into the model. To ensure a correct abstraction, one can use a mixed simulation [Meller et al. 2009]. We extend mixed simulation to include inconsistent values, thereby resolving an asymmetry and allowing for abstractions with increased precision when inconsistent values are available. In addition, we present a set of abstraction rules, compatible with the extended notion, for constructing abstract models.
- N. D. Belnap. 1977. Modern Uses of Multiple-Valued Logics. Reidel, 5--37.Google Scholar
- A. Bialynicki-Birula and H. Rasiowa. 1957. On the representation of quasi-Boolean algebras. Bull. Acad. Polon. Sci. Cl. III 5 (1957), 259--261, XXII.Google Scholar
- G. Bruns and P. Godefroid. 1999. Model checking partial state spaces with 3-valued temporal logics. In CAV, Lecture Notes in Computer Science, Vol. 1633. Springer, 274--287. Google Scholar
Cross Ref
- M. Chechik, B. Devereux, S. M. Easterbrook, and A. Gurfinkel. 2003. Multi-valued symbolic model-checking. ACM TOSEM 12, 4 (2003), 371--408. Google Scholar
Digital Library
- E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. 2000. Counterexample-guided abstraction refinement. In CAV, Lecture Notes in Computer Science, Vol. 1855. Springer, 154--169. Google Scholar
Cross Ref
- D. Dams, R. Gerth, and O. Grumberg. 1997. Abstract interpretation of reactive systems. ACM Trans. Program. Lang. Syst. 19, 2 (1997), 253--291. Google Scholar
Digital Library
- M. de Jonge and T. C. Ruys. 2010. The spinja model checker. In SPIN, Lecture Notes in Computer Science, Vol. 6349. Springer, 124--128. Google Scholar
Cross Ref
- M. Fitting. 1989. Bilattices and the theory of truth. J. Philos. Logic 18, 3 (1989), 225--256. Google Scholar
Cross Ref
- O. Grumberg. 2005. Abstraction and refinement in model checking. In FMCO, Lecture Notes in Computer Science, Vol. 4111. Springer, 219--242.Google Scholar
- A. Gurfinkel and M. Chechik. 2003. Multi-valued model checking via classical model checking. In CONCUR, Lecture Notes in Computer Science, Vol. 2761. Springer, 263--277. Google Scholar
Cross Ref
- A. Gurfinkel and M. Chechik. 2006. Why waste a perfectly good abstraction. In TACAS, Lecture Notes in Computer Science, Vol. 3920. Springer, 212--226. Google Scholar
Digital Library
- A. Gurfinkel, O. Wei, and M. Chechik. 2006. Yasm: A software model-checker for verification and refutation. In CAV, Lecture Notes in Computer Science, Vol. 4144. Springer, 170--174. Google Scholar
Digital Library
- M. Huth, R. Jagadeesan, and D. A. Schmidt. 2001. Modal transition systems: A foundation for three-valued program analysis. In ESOP, Lecture Notes in Computer Science, Vol. 2028. Springer, 155--169. Google Scholar
Cross Ref
- B. Konikowska and W. Penczek. 2002. Reducing model checking from multi-valued CTL* to CTL*. In CONCUR, Lecture Notes in Computer Science, Vol. 2421. Springer, 226--239. Google Scholar
Cross Ref
- D. Kozen. 1983. Results on the propositional mu-calculus. Theor. Comput. Sci. 27 (1983), 333--354. Google Scholar
Cross Ref
- S. A. Kripke. 1963. Semantical considerations on modal logic. Acta Philos. Fenn. 16 (1963).Google Scholar
- Y. Meller, O. Grumberg, and S. Shoham. 2009. A framework for compositional verification of multi-valued systems via abstraction-refinement. In ATVA, Lecture Notes in Computer Science, Vol. 5799. Springer, 271--288. Google Scholar
Digital Library
- C. J. H. Seger and R. E. Bryant. 1995. Formal verification by symbolic evaluation of partially-ordered trajectories. Formal Meth. Syst. Des. 6, 2 (1995), 147--189. Google Scholar
Digital Library
- Y. Shramko, J. M. Dunn, and T. Takenaka. 2001. The trilattice of constructive truth values. J. Log. Comput. 11, 6 (2001), 761--788. Google Scholar
Cross Ref
- S. J. J. Vijzelaar and W. J. Fokkink. 2015. Multi-valued abstraction using lattice operations. In ACSD. IEEE Computer Society, 70--79. Google Scholar
Digital Library
- S. J. J. Vijzelaar, K. Verstoep, W. J. Fokkink, and H. E. Bal. 2011. Distributed MAP in the SpinJa model checker. In PDMC (EPTCS), Vol. 72. 84--90. Google Scholar
Cross Ref
- S. J. J. Vijzelaar, K. Verstoep, W. J. Fokkink, and H. E. Bal. 2014. Bonsai: Cutting models down to size. In PSI, Lecture Notes in Computer Science, Vol. 8974. Springer, 361--375.Google Scholar
Index Terms
Multi-valued Simulation and Abstraction Using Lattice Operations
Recommendations
Multi-valued Abstraction Using Lattice Operations
ACSD '15: Proceedings of the 2015 15th International Conference on Application of Concurrency to System DesignIn model checking, abstractions can cause spurious results, which need to be verified in the concrete system to gain conclusive results. Verification based on a multi-valued logic can distinguish between conclusive and inconclusive results, provides ...
A framework for compositional verification of multi-valued systems via abstraction-refinement
We present a framework for fully automated compositional verification of µ-calculus specifications over multi-valued systems, based on abstraction and refinement.In a multi-valued model of a system, both the system transitions and the state labels are ...
3-Valued Abstraction for (Bounded) Model Checking
ATVA '09: Proceedings of the 7th International Symposium on Automated Technology for Verification and AnalysisModel Checking is the problem of verifying that a given model satisfies a specification, given in a formal specification language. Abstraction is one of the most successful approaches to avoiding the state explosion problem in model checking. It ...






Comments