From verified model to executable program: the PAT approach

Zhu, Huiquan; Sun, Jing; Dong, Jin Song; Lin, Shang-Wei

doi:10.1007/s11334-015-0269-z

Cited by 9 publications

(5 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We would also like to mention the PAT model checker [53,77]. Its conception is similar to ProB but using C-Sharp instead of Prolog as an intermediate language.…”

Section: Other High-level Languagesmentioning

confidence: 99%

Software Architecture of Modern Model Checkers

Kordon¹,

Leuschel²,

Pol³

et al. 2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Automated formal verification using model checking is a mature field with many tools available. We summarize the recent trends in the design and architecture of model checking tools. An important design goal of modern model checkers is to support many input languages (front-end) and many verification strategies (back-end), and to allow arbitrary combinations of them. This widens the applicability of new verification algorithms, avoids duplicate implementation of the analysis techniques, improves quality of the tools, and eases use of verification for a newly introduced high-level specification, such as a domain specific language.

show abstract

“…We would also like to mention the PAT model checker [53,77]. Its conception is similar to ProB but using C-Sharp instead of Prolog as an intermediate language.…”

Section: Other High-level Languagesmentioning

confidence: 99%

Software Architecture of Modern Model Checkers

Kordon¹,

Leuschel²,

Pol³

et al. 2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Specification animation means making formal specification executable by translating formal specifications into executable programs because most formal specification languages are not executable. Specification animations have been used to inspect formal specifications (Li & Liu, 2016), to monitor software through formal specification animation (Liang, et al, 2016), to validate formal models by refinement animation (Hallerstede, et al, 2016) and to make a specification-based testing better (Nagoya & Liu, 2017). Maude is inherently executable and then it is unnecessary to translate Maude specifications into executable programs.…”

Section: Related Workmentioning

confidence: 99%

Guessing, Model Checking and Theorem Proving of State Machine Properties – A Case Study on Qlock

Aung¹,

Nguyen

Ogata

2018

IJSECS

View full text Add to dashboard Cite

It is worth understanding state machines better because various kinds of systems can be formalized as state machines and therefore understanding state machines has something to do with comprehension of systems. Understanding state machines can be interpreted as knowing properties they enjoy and comprehension of systems is interpreted as knowing whether they satisfy requirements. We (mainly the second author) have developed a tool called SMGA that basically takes a finite sequence of states from a state machine and generates a graphical animation of the finite sequence or the state machine. Observing such a graphical animation helps us guess properties of the state machine. We should confirm whether the state machine enjoys the guessed properties because such guessed properties may not be true properties of the state machine. Model checking is one possible technique to do so. If the state machine has a fixed small number of reachable states, model checking is enough. Otherwise, however, it is not. If that is the case, we should use some other techniques to make sure that the system enjoys the guessed properties. Interactive theorem proving is one such technique. The paper reports on a case study in which a mutual exclusion protocol called Qlock is used as an example to exemplify the abovementioned idea or methodology.

show abstract

“…Despite the informal description of the design notations, the generated programs are skeleton code only, which are not executable. Refinement [12] is another related field that aims at deriving less abstract models from formal specifications. However, to the best of our knowledge, there has been no work in refining a formal model directly into executable programs.…”

Section: Introductionmentioning

confidence: 99%

Towards Code Generation from Design Models

Sun

Wang

2017

International Conferences on Software Engineering and Knowledge Engineering

Self Cite

View full text Add to dashboard Cite

Abstract-With the growing in size and complexity of modern computer systems, the need for improving the quality at all stages of software development has become a critical issue. The current software production has been largely depended on manual code development. Despite the slow development process, the errors introduced by the programmers contribute to a substantial portion of defects in the final software product. This paper explores the possibility of generating code and assertion constraints from formal design models and use them to verify the implementation. We translate Z formal models into their OCL counter-parts and Java assertions. With the help of existing tools, we demonstrate various checking at different levels to enhance correctness.

show abstract

From verified model to executable program: the PAT approach

Abstract: Innovations in Systems and Software Engineering manuscript No.

Cited by 9 publications

References 22 publications

Software Architecture of Modern Model Checkers

Software Architecture of Modern Model Checkers

Guessing, Model Checking and Theorem Proving of State Machine Properties – A Case Study on Qlock

Towards Code Generation from Design Models

Contact Info

Product

Resources

About