# Design of Software Security Verification with Formal Method Tools

@inproceedings{Jang2006DesignOS, title={Design of Software Security Verification with Formal Method Tools}, author={Seung-Ju Jang and J. Ryoo and Changyeol Lee}, year={2006} }

Summary Formal methods ensure the stability and reliability of soft-ware systems by using mathematical principles and proving conformance to a given set of requirements. The stable and reliable operation of software is especially important for system applications dealing with security. Although very effective in identifying a non-conformance in security requirements, formal methods typically involve a steep learning curve before full adoption. Automated tools can be used to alleviate… Expand

No Paper Link Available

#### 2 Citations

Formal Modeling of Navigation System of Autonomous Mobile Robots using Graphs , Automata and Z

- 2011

In recent years, interest has been developed for the problem of mobile robot navigation system because of its applications in various disciplines. The software development of mobile robot navigation… Expand

Modeling Supervisory Control of Autonomous Mobile Robots using Graph Theory, Automata and Z Notation

- 2012

Supervisory control of the mobile robot navigation system has critical importance. The supervisory control software development of mobile robot navigation can be performed in an unknown environment… Expand

#### References

SHOWING 1-10 OF 17 REFERENCES

The SMV System

- Computer Science
- 1993

The language must have a precise mathematical semantics that defines the translation from a program in the langauge to a form suitable for symbolic model checking (ie., a Boolean formula representing the transition relation), and must allow us to conveniently describe non-deterministic choices. Expand

The SLAM Toolkit

- Computer Science
- CAV
- 2001

The SLAM toolkit checks safety properties of software without the need for user-supplied annotations or abstractions using three tools: a predicate abstraction tool that abstracts P into a boolean program BP(P,E) with respect to a set of predicates E over P 1,2. Expand

The Model Checker SPIN

- Computer Science
- IEEE Trans. Software Eng.
- 1997

An overview of the design and structure of the verifier, its theoretical foundation, and an overview of significant practical applications are given. Expand

A Tutorial Introduction to PVS

- Computer Science
- 1998

This document provides an introductory example, a tutorial, and a compact reference to the PVS veri cation system to get you started using PVS and to help appreciate the capabilities of the system and the purposes for which it is suitable. Expand

The Z/EVES System

- Computer Science
- ZUM
- 1997

The Z/EVES system is described, which allows Z specifications to be analysed in a number of different ways and includes a theorem prover that includes a decision procedure for simple arithmetic and a heuristic rewriting mechanism that recognizes “obvious” facts. Expand

Z - an introduction to formal methods

- Computer Science
- 1990

This tutorial introduction to Z contains information on how to relate Z specifications to actual program code and is enhanced to reflect the most current language standards. Expand

Using Jaza to Animate RoZ Specifications of UML Class Diagrams

- Computer Science
- 2006 30th Annual IEEE/NASA Software Engineering Workshop
- 2006

A combination of the Jaza Z animator with the RoZ tool produces a Z specification from an annotated UML class diagram and generates the specification of basic operations associated to the diagram. Expand

The STATEMATE semantics of statecharts

- Computer Science
- TSEM
- 1996

We describe the semantics of statecharts as implemented in the STATEMATE system. This was the first executable semantics defined for the language and has been in use for almost a decade. In terms of… Expand

Specification and Verification Center

- 2006