State Machines : Invariants and Termination 1 Modeling Processes
نویسندگان
چکیده
Proving the correctness of a program is a quite different activity than debugging and testing a program. Since programs are typically intended to handle a huge, if not infinite, number of different inputs, completely testing a program on all inputs is rarely feasible, and partial testing always leaves open the possibility that something will go wrong in the untested cases. A proof of correctness ensures there are no such loopholes. Correctness proofs for hardware and software are playing a growing role in assuring system quality, especially for systems performing critical tasks such as flying airplanes, controlling traffic, and handling financial transactions.
منابع مشابه
Invariants and Termination 1 State machines
A state machine is really nothing more than a digraph, except that the vertices are called “states” and the edges are called “transitions.” The transition (edge) from state p to state q will be written p → q. A state machine also comes equipped with a designated start state. State machines used in digital logic and compilers usually have only a finite number of states, but machines that model c...
متن کاملThe Impact of Class Model Redesign on State Machines
Change is a constant factor in software development process It should come as side effect Domino effect: Change to sequence diagrams impacts the corresponding collaboration diagrams. .. Redesign class models impacts on state machines Pattern Application Structure of State Machines [UML Standard] If a composite state is active and not orthogonal, at most one of its substates is active Each regio...
متن کاملCCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence
A remarkable result in [4] shows that in spite of its being less expressive than CCS w.r.t. weak bisimilarity, CCS! (a CCS variant where infinite behavior is specified by using replication rather than recursion) is Turing powerful. This is done by encoding Random Access Machines (RAM) in CCS!. The encoding is said to be non-faithful because it may move from a state which can lead to termination...
متن کاملAbstraction Refinement for Termination
ion Refinement for Termination⋆ Byron Cook, Andreas Podelski, and Andrey Rybalchenko 1 Microsoft Research, Cambridge 2 Max-Planck-Institut für Informatik, Saarbrücken Abstract. Abstraction can often lead to spurious counterexamples. Counterexample-guided abstraction refinement is a method of strengthening abstractions based on the analysis of these spurious counterexamples. For invariance prope...
متن کاملOn the verification of EPCs using T-invariants
To verify a (business) process model, for example expressed in terms of an Event-driven Process Chain (EPC), most of the approaches described in literature require the construction of its state space. Unfortunately, for complex business processes the state space can be extremely large (if at all finite) and, as a result, constructing the state space may require excessive time. Moreover, semi-fo...
متن کامل