Symbolic program model compositions

Details Symbolic program model compositions Symbolic program model compositions

2011-04-12

2011-04-12

Kang, Insun (Department: 2193)

Data processing: software development, installation, and managem

Software program development tool

Modeling

C717S124000, C717S132000

Reexamination Certificate

active

07926025

ABSTRACT:
A model composition environment can allow for description of fill or partial symbolic system behavior, as well as the combination of models of specific features into compound models. Compositional operators can include intersection, concatenation, substitution, alternating refinement, as well as a set of regular expression-like operators. Models called “action machines” can represent object-oriented, reactive programs, and an action machine may be composed with another action machine using a compositional operator. This can allow for testing of particular scenarios or behaviors.

REFERENCES:
patent: 7346486 (2008-03-01), Ivancic et al.
patent: 7711525 (2010-05-01), Ganai et al.
patent: 2003/0115037 (2003-06-01), Sumida
patent: 2005/0192789 (2005-09-01), Yang
patent: 2005/0223353 (2005-10-01), Keidar-Barner et al.
patent: 2006/0010428 (2006-01-01), Rushby et al.
patent: 2006/0156261 (2006-07-01), Farkash et al.
patent: 2006/0218534 (2006-09-01), Kahlon et al.
patent: 2007/0143742 (2007-06-01), Kahlon et al.
Bultan et al., “Composite model-checking: verification with type-specific symbolic representations,” ACM, 2000.
Artho et al., “Automated Testing using Symbolic Model Checking and Temporal Monitoring,” Mar. 14, 2004.
Larsen et al., “Compositional and symbolic model-checking of real-time systems,” ACM, 1996.
Iyer, “Efficient and Effective Symbolic Model Checking,” Oct. 26, 2003.
Alfonso et al., “Visual timed event scenarios,”ICSE: Proceedings 26thInternational Conference on Software Engineering, pp. 168-177, IEEE Computer Society, 2004.
Alur et al., “Alternating refinement relations,”Proceedings of the Ninth International Conference on Concurrency Theory(CONCUR '98), vol. 1466 of LNCS, pp. 163-178, 1998.
Barnett et al., “Towards a tool environment for model-based testing with AsmL,” Petrenko and Ulrich, eds.,Formal Approaches to Software Testing, FATES 2003, vol. 2931 ofLNCS, Springer, pp. 264-280, 2003.
Campbell et al., “Model-based testing of object-oriented reactive systems with Spec Explorer,”Technical Report MSR-TR-2005-59, Microsoft Research, submitted, 2005.
Clarke et al., “Model Checking,”MIT Press, 1999.
Clarke et al., “Model checking,” Chapter 21,MIT Press, 1999, pp. 1369-1519.
de Alfaro “Game models for open systems,” N. Dershowitz, ed.,Verification: Theory and Practice: Essays Dedicated to Zohar Manna on the Occasion of His 64thBirthday, vol. 2772 ofLNCS, Springer, pp. 269-289, 2004.
de Alfaro et al., “Interface automata,”Proceedings of the 8thEuropean Software Engineering Conference and the 9thACM SIGSOFT Symposium on the Foundations of Software Engineering(ESEC/FSE), pp. 109-120, ACM, 2001.
Diijkstra, “A Discipline of Programming,”Prentice-Hall, 1976.
Fernandez et al., “An experiment in automatic generation of test suites for protocols with verification technology,”Science of Computer Programming—Special Issue on COST247, Verification and Validation Methods for Formal Descriptions29(1-2):123-146, 1997.
Frantzen et al., “Test generation based on symbolic specifications,” J. Grabowski and B. Nielsen, eds.,Proceedings of the Workshop on Formal Approaches to Software Testing(FATES 2004), pp. 3-17, Linz, Austria, Sep. 2004, to appear inLNCS.
Georg et al, “Composing aspect models,” in F. Akkawi et al., ed.,The 4thAOSD Modeling With UML Workshop, 2003.
Gray et al., “Handling crosscutting constraints in domain-specific modeling,”Commun. ACM44(10):87-93, 2001.
Grieskamp et al., “Action machines—towards a framework for model composition, exploration and conformance testing based on symbolic computation,”Technical Report MSR-TR-2005-60, Microsoft Research, May 2005, accepted for publication at QSIC'05.
Grieskamp et al., “Behavioral composition in symbolic domains,”Aspect-Oriented Modeling(AOM'05), workshop at MoDELS 2005.
Grieskamp et al., “Generating finite state machines from abstract state machines,”ISSTA '02, vol. 27 ofSoftware Engineering Notes, pp. 112-122, ACM, 2002.
Grieskamp et al., “Instrumenting scenarios in a model-driven development environment,”Information and Software Technology, 2004.
Grieskamp et al., “XRT-Exploring Runtime for .NET—Architecture and Applications,”SoftMC 2005: Workshop on Software Model Checking, Electronic Notes in Theoretical Computer, Jul. 2005.
Gurevich “Evolving Algebras 1993: Lipari Guide,” E. Borger, ed.,Specification and Validation Methods, Oxford University Press, pp. 9-36, 1995.
ITU-T. Recommendation Z.120. Message Sequence Charts,Technical Report Z-120, International Telecommunication Union—Standardization Sector, Genève, 2000.
Khurshid et al., “Generalized symbolic execution for model checking and testing,”Proc. 9thInternational Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp. 553-568, 2003.
Kiczales, “Aspect-oriented programming,”ACM Comput. Surv. 28(4es):154, 1996.
Nachmanson et al., “Optimal strategies for testing nondeterministic systems,”ISSTA '04, vol. 29 ofSoftware Engineering Notes, pp. 55-64, ACM, Jul. 2004.
Sengupta et al., “Triggered message sequence charts,”SIGSOFT Softw. Eng. Notes27(6):167-176, 2002.
Spec# tool, <http://research.microsoft.com/specsharp>, Mar. 2005.
Spivey,The Z Notation: A Reference Manual, Prentice Hall International Series in Computer Science, 2ndedition, 1992.
Tretmans et al., “TorX: Automated model based testing,”1stEuropean Conference on Model Driven Software Engineering, pp. 31-43, Nuremberg, Germany, Dec. 2003.
Uchitel et al., “Negative scenarios for implied scenario elicitation,”SIGSOFT '02/FSE-10: Proceedings of the 10thACM SIGSOFT symposium on Foundations of software engineering, pp. 109-118, ACM Press, New York, NY, USA, 2002.

Affiliated with

Also associated with

Rating

Symbolic program model compositions does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Symbolic program model compositions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Symbolic program model compositions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2676929