References

  1. L. de Alfaro, P. Godefroid & R. Jagadeesan (2004): Three-Valued Abstractions of Games: Uncertainty, but with Precision. In: LICS, pp. 170–179, doi:10.1109/LICS.2004.1319611.
  2. E. M. Clarke, O. Grumberg & D. E. Long (1992): Model Checking and Abstraction. In: POPL, pp. 342–354, doi:10.1145/143165.143235.
  3. E. M. Clarke, Jr., O. Grumberg & D. A. Peled (1999): Model checking. MIT Press, Cambridge, MA, USA.
  4. E.M. Clarke, O. Grumberg, S. Jha, Y. Lu & H. Veith (2003): Counterexample-guided abstraction refinement for symbolic model checking. J. ACM 50(5), pp. 752–794, doi:10.1145/876638.876643.
  5. P. Cousot & R. Cousot (1977): Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In: POPL, pp. 238–252, doi:10.1145/512950.512973.
  6. D. Dams, R. Gerth & O. Grumberg (1997): Abstract interpretation of reactive systems. ACM Trans. Program. Lang. Syst. 19(2), pp. 253–291, doi:10.1145/244795.244800.
  7. D. Dams & K. S. Namjoshi (2004): The Existence of Finite Abstractions for Branching Time Model Checking. In: LICS, pp. 335–344, doi:10.1109/LICS.2004.1319628.
  8. D. Dams & K.S. Namjoshi (2005): Automata as Abstractions. In: VMCAI, LNCS 3385, pp. 216–232, doi:10.1007/978-3-540-30579-8_15.
  9. H. Fecher, D. de Frutos-Escrig, G. Luttgen & H. Schmidt (2009): On the Expressiveness of Refinement Settings. In: FSEN, LNCS 5961, pp. 276–291, doi:10.1007/978-3-642-11623-0_16.
  10. H. Fecher & S. Shoham (2011): Local abstraction-refinement for the μ-calculus. STTT 13(4), pp. 289–306, doi:10.1007/s10009-011-0202-1.
  11. P. Godefroid & R. Jagadeesan (2003): On the Expressiveness of 3-Valued Models. In: VMCAI, pp. 206–222, doi:10.1007/3-540-36384-X_18.
  12. A. Gurfinkel & M. Chechik (2005): How Thorough Is Thorough Enough?. In: Dominique Borrione & Wolfgang J. Paul: CHARME, Lecture Notes in Computer Science 3725. Springer, pp. 65–80, doi:10.1007/11560548_8.
  13. M. Huth, R. Jagadeesan & D.A. Schmidt (2001): Modal Transition Systems: A Foundation for Three-Valued Program Analysis. In: ESOP, LNCS 2028, pp. 155–169, doi:10.1007/3-540-45309-1_11.
  14. K. G. Larsen, U. Nyman & Andrzej Wasowski (2007): On Modal Refinement and Consistency. In: Luís Caires & Vasco Thudichum Vasconcelos: CONCUR, Lecture Notes in Computer Science 4703. Springer, pp. 105–119, doi:10.1007/978-3-540-74407-8_8.
  15. K. G. Larsen & B. Thomsen (1988): A Modal Process Logic. In: LICS. IEEE Computer Society, pp. 203–210, doi:10.1109/LICS.1988.5119.
  16. K. G. Larsen & L. Xinxin (1990): Equation Solving Using Modal Transition Systems. In: LICS, pp. 108–117, doi:10.1109/LICS.1990.113738.
  17. S. Shoham & O. Grumberg (2004): Monotonic Abstraction-Refinement for CTL. In: TACAS, LNCS 2988, pp. 546–560, doi:10.1007/978-3-540-24730-2_40.
  18. S. Shoham & O. Grumberg (2008): 3-Valued abstraction: More precision at less cost. Inf. Comput. 206(11), pp. 1313–1333, doi:10.1016/j.ic.2008.07.004.
  19. O. Wei, A. Gurfinkel & M. Chechik (2011): On the consistency, expressiveness, and precision of partial modeling formalisms. Inf. Comput. 209(1), pp. 20–47, doi:10.1016/j.ic.2010.08.001.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org