Statecharts are extended to deal with events when no applicable transition is available, and to resolve conflicts relative to event scheduling and response that can arise whenever multiple states can be active simultaneously. Event closure and event scheduling are achieved without having to clutter up a basic statechart. The extensions are effected by means of declarative event disposition rules. These rules, together with the statechart topology, determine the contents of one or more disposition matrices. These matrices are combined with the statechart state to determine the response of the event dispatcher to incoming events. The operation of the event dispatcher is also described. A detailed example illustrates these concepts, which are further characterized, for the benefit of working programmers, in the form of a behavioral design pattern. A tool called StateCraft embodies these notions.

article Free Access Share on Strategies for object-oriented technology transfer (panel) Authors: Dennis de Champeaux View Profile , Andrew J. Baer View Profile , Brian Bernsen View Profile , Alan R. Korncoff View Profile , Tim Korson View Profile , Daniel S. Tkach View Profile Authors Info & Claims ACM SIGPLAN NoticesVolume 28Issue 10Oct. 1, 1993 pp 437–447https://doi.org/10.1145/167962.165936Online:01 October 1993Publication History 0citation354DownloadsMetricsTotal Citations0Total Downloads354Last 12 Months7Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

article Free Access Share on Case study of object-oriented software development Authors: Dennis de Champeaux View Profile , Al Anderson View Profile , Ed Feldhousen View Profile Authors Info & Claims ACM SIGPLAN NoticesVolume 27Issue 10Oct. 1992 pp 377–391https://doi.org/10.1145/141937.141967Online:31 October 1992Publication History 9citation893DownloadsMetricsTotal Citations9Total Downloads893Last 12 Months8Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

Article Free Access Share on The OO software development process (panel) Authors: Dennis de Champeaux View Profile , Bob Balzer View Profile , Dave Bulman View Profile , Kathleen Culver-Lozo View Profile , Ivar Jacobson View Profile , Stephen J. Mellor View Profile Authors Info & Claims OOPSLA '92: Conference proceedings on Object-oriented programming systems, languages, and applicationsOctober 1992Pages 484–489https://doi.org/10.1145/141936.141974Published:31 October 1992Publication History 0citation383DownloadsMetricsTotal Citations0Total Downloads383Last 12 Months9Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

The object-oriented design process is investigated within the classic software development classification of Analysis, Design, and Implementation.When all development is performed using object oriented methods, OOD is best characterized as a transformational process, mapping declarative descriptions of objects and classes to implementation plans.Subphases of class design, system design, and program design accommodate and rationalize 00 practices including abstraction, prototyping, refinement, bottom-up composition, delegation, interoperablity, clustering objects into processes, resource management design, tuning and optimization.

Article Free Access Share on Formal techniques for OO software development Authors: Pierre America Philips Research Laboratories Philips Research LaboratoriesView Profile , Derek Coleman HP-Lab Bristol HP-Lab BristolView Profile , Roger Duke University of Queensland University of QueenslandView Profile , Doug Lea Syracuse University & SUNY-Oswego Syracuse University & SUNY-OswegoView Profile , Gary Leavens Iowa State University Iowa State UniversityView Profile Authors Info & Claims OOPSLA '91: Conference proceedings on Object-oriented programming systems, languages, and applicationsNovember 1991 Pages 166–170https://doi.org/10.1145/117954.117967Published:01 November 1991Publication History 2citation376DownloadsMetricsTotal Citations2Total Downloads376Last 12 Months13Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

Properties are proved about INSTANCE, a theorem prover module that recognizes that a formula is a special case and/or an alphabetic variant of another formula, and about INSURER, another theorem prover module that decomposes a problem, represented by a formula, into independent subproblems, using a conjunction. The main result of INSTANCE is soundness; the main result of INSURER is a maximum decomposition into subproblems (with some provisos). Experimental results show that a connection graph theorem prover extended with these modules is more effective than the resolution-based connection graph theorem prover alone.

Extenswe modificaUons of a previously published bidirectional heuristic search algorithm are presented in order to preserve the property that shortest solutions are found under approprmte circumstances.Theoretical results encompass the generahzation of the unidirectional optimahty theorem Categories and Subject Descriptors: 1.

An optimality theorem and its supporting lemma's are given and proved which apply on a bi-directional heuristic search algorithm.

A modification of Pohl's bidirectional heuristic search algorithm is described together with a simplified implementation. Theorems are proved about conditions yielding shortest paths. The results are given of a worst-case analysis of different algorithms, suggesting a rank order of their quality. Results that Pohl had obtained with a unidirectional heuristic search algorithm on the 15-puzzle are compared with the results obtained with the new — simplified — algorithm.