## Student No 1161482 Table of Contents (2004)

### BibTeX

@MISC{Wang04studentno,

author = {Rui Wang},

title = {Student No 1161482 Table of Contents},

year = {2004}

}

### OpenURL

### Abstract

### Citations

2404 | Model Checking - Clarke, Peled - 1999 |

1203 |
The temporal logic of programs
- Pnueli
- 1977
(Show Context)
Citation Context ...em, the next encountered problem is to specify the properties from the concerns. In 1977, Pnueli first suggested using Temporal Logic for the formal specification of behavioural properties of systems =-=[Pnu77]-=-. The temporal logic is a form of logic specifically tailored for statements and reasoning which involve the notion of order in time. The temporal logics support the formulation of properties of syste... |

1176 | Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications
- Clarke, Emerson, et al.
- 1986
(Show Context)
Citation Context ...rcuits exhibit the same behaviours. Theorem Proving proves system correctness by using axioms and rules. It is useful for verifying algorithm, integrating verification results [DAC98]. Model checking =-=[CES86]-=- is an algorithmic method of automatically verifying correctness of software and reactive systems. A reactive system is a system consisting of several components and these components are designed to i... |

958 |
B.W.: A Spiral Model for Software Development and Enhancement
- Boehm
- 1988
(Show Context)
Citation Context ...roduct to a changed environment. 1.2 Software Life Cycle Model Software life cycle [ER03] is a general model of the software development process, such as the waterfall Model [Roy70], the Spiral Model =-=[Boe88]-=-, and the V-Model [1]. Software life cycle not only classifies all the activities and required work products to several different phases, but also defines the principles and guidelines according to wh... |

519 | Software engineering - Sommerville - 2011 |

356 | HyTech: A Model Checker for Hybrid Systems - Henzinger, Ho, et al. - 1997 |

302 | Proving the correctness of multiprocess programs - Lamport - 1977 |

266 | Automatic symbolic verification of embedded systems - Alur, Henzinger, et al. - 1996 |

232 | A Specifier's Introduction to Formal Met hods - Wing - 1990 |

228 | Seven myths of formal methods - Hall - 1990 |

220 |
Managing the Development of Large Software Systems
- Royce
(Show Context)
Citation Context ...elivery, or to adapt the product to a changed environment. 1.2 Software Life Cycle Model Software life cycle [ER03] is a general model of the software development process, such as the waterfall Model =-=[Roy70]-=-, the Spiral Model [Boe88], and the V-Model [1]. Software life cycle not only classifies all the activities and required work products to several different phases, but also defines the principles and ... |

210 | Kronos: A Verification Tool for Real-time Systems - Yovine - 1997 |

160 |
Using partial orders for the efficient verification of deadlock freedom and safety properties, CAV ’91
- Godefroid, Wolper
- 1992
(Show Context)
Citation Context ...tire state space, when the property can be determined by examining a fragment of the state space. It also applies some optimisation techniques to improve its efficient such as partial order reduction =-=[GW93]-=-, memory bit-hash [Hol98]. In addition, when an error is reported, one can use the SPIN simulator to find the source of the errors. 2.5.2 SMV SMV [5] was developed by Ken McMillan at Carnegie-Mellon U... |

141 |
Proving liveness properties of concurrent programs
- Owicki, Lamport
- 1982
(Show Context)
Citation Context ...in conditions some event will ultimately occur. For example, “if we call on the lift, it is bound to arrive eventually” or “the coffee machine will give you a cup of coffee, after you pay the money.” =-=[OL82]-=- Deadlock-freeness is a special property, stating that the system can never be in a situation in which no progress is possible. It is very important property in some cases. For example, when two tasks... |

135 | Application of temporal logic to the specification and verification of reactive systems: a survey of current trends - Pnueli - 1986 |

106 | Seven more myths of formal methods - Bowen, Hinchey - 1995 |

82 | An analysis of bitstate hashing
- HOLZMANN
- 1998
(Show Context)
Citation Context ...he property can be determined by examining a fragment of the state space. It also applies some optimisation techniques to improve its efficient such as partial order reduction [GW93], memory bit-hash =-=[Hol98]-=-. In addition, when an error is reported, one can use the SPIN simulator to find the source of the errors. 2.5.2 SMV SMV [5] was developed by Ken McMillan at Carnegie-Mellon University. SMV, short for... |

52 |
Software Process: A Roadmap
- Fuggetta
- 2000
(Show Context)
Citation Context ...tured process, which is “a coherent set of policies, organizational structures, technologies, procedures, and artefacts that are needed to conceive, develop, deploy, and maintain a software product.” =-=[Fug00]-=- Commonly, software development process can be structured into five phases, such as - Requirement analysis, - Architecture Design, - Implementation, - Testing, and - Maintenance. The activities of the... |

48 | S.: Interpreting Message Flow Graphs - Leue, Ladkin - 1995 |

38 | Dynamic partitioning in linear relation analysis. application to the verification of reactive systems - Jeannet |

32 | Formal Verification of UML Statecharts with RealTime Extensions," in R.-D. Kutsche and H. Weber (eds - David, Moller, et al. - 2002 |

31 |
Partial Model Checking
- Andersen
- 1995
(Show Context)
Citation Context ...us (buffered) message passing, and communication through shared memory. Synchronous means objects or events that are coordinated in time, otherwise is asynchronous. The SPIN supports on-the-fly check =-=[And94]-=-, which means it constructs states as many as absolutely necessary, instead of the entire state space, when the property can be determined by examining a fragment of the state space. It also applies s... |

31 | P.: Dynamic partitioning in analyses of numerical properties - Jeannet, Halbwachs, et al. - 1999 |

28 |
Semantical considerations on modal logic. Acta Philosophica Fennica 16:83–94
- Kripke
- 1963
(Show Context)
Citation Context ...B, C}; - S = {1, 2, 3, 4}; - S0 = 1; - E = (1, 2, A), (1, 1, B), (1, 1, C), (2, A, 2), (2, B, 3), (2, C, 1), (3, C, 4), (3, B, 1), (3, A, 1)}; - F = {2, 3, 4}. 2.2.2 Kripke Structure Kripke Structure =-=[SAK63]-=- is a non-deterministic finite state automaton. The states of automaton are labelled with boolean variables, which are the evaluations of expressions in that state. Automaton transition function maps ... |

18 |
A Handbook of Software and Systems Engineering
- Endres, Rombach
- 2003
(Show Context)
Citation Context ...o modify the product, to correct errors, to improve performance or other attributes after delivery, or to adapt the product to a changed environment. 1.2 Software Life Cycle Model Software life cycle =-=[ER03]-=- is a general model of the software development process, such as the waterfall Model [Roy70], the Spiral Model [Boe88], and the V-Model [1]. Software life cycle not only classifies all the activities ... |

14 | Formal Methods: State of Art and Future - Clarke - 1996 |

12 |
Partition refinement in real-time model checking
- Spelberg, Toetenel, et al.
- 1998
(Show Context)
Citation Context ...sfies the constrain (or condition) of that transition. PMC separates itself from other formal verification tools by applying a different approach of reachability analysis, namely partition refinement =-=[STA98]-=-, which was inspired by Sokolsky’s technique named MCT [Sok96, SS95]. 2.5.5 Kronos Kronos [8] was developed at VERIMAG, an academic research laboratory of university of Grenoble and CNRS, by S. Yovine... |

10 | Algorithms and Tools for Model Checking - Katoen, “Concept - 1998 |

8 | Software Verification and Validation: Its Role - Wallace, Fujii |

4 | Local model checking for real time systems - Sokolsky, Smolka - 1997 |

3 | Efficient Graph-Based Algorithms for Model Checking in the Modal Mu-Calculus - Sokolsky - 1996 |

1 | Formal Verification for Embedded System Designs”, Design Automation for Embedded Systems - Chen, Hsieh - 2003 |

1 | A Timed Automata Sementics for Real-Time UML Specifications - Totoenel, Roubtsova, et al. - 2001 |