Integrating Theories and Techniques for Program Modelling, Design and Verification

Aichernig, Bernhard K.; He, Jifeng; Liu, Zhiming; Reed, M. D.

doi:10.1007/978-3-540-69149-5_31

Cited by 2 publications

(2 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We will investigate how the research results at UNU-IIST in theories and techniques of program modelling, design and verification can be used in the design of software development tools at TRDDC. A separate position paper by UNU-IIST is also presented at this conference [2].…”

Section: Automatic Code Generators That Implement the Implementation mentioning

confidence: 98%

“…To achieve this goal, the whole computing community have to deal with a wide range of issues, among which are [2] 1. arriving at automated procedures of abstraction that enables a compiler to work in combination with different program verification tools including testing tools, 2. studying what, where, when and how the correctness properties, i.e. assertions and annotations, are identified and specified, 3. identifying properties that can be verified compositionally, and designing specification notations and models to support more compositional specification, analysis and verification.…”

Section: Formal Software Engineering and The Grand Challengementioning

confidence: 99%

See 1 more Smart Citation

Methods and Tools for Formal Software Engineering

Liu

Venkatesh²

2008

Verified Software: Theories, Tools, Experiments

Self Cite

View full text Add to dashboard Cite

Abstract. We propose a collaboration project to integrate the research effort and results obtained at UNU-IIST on formal techniques in component and object systems with research at TRDDC in modelling and development of tools that support object-oriented and component-based design. The main theme is an integration of verification techniques with engineering methods of modelling and design, and an integration of verification tools and transformation tools. This will result in a method in which a correct program can be developed through transformations that are either proven to be correct or by showing that the transformed model can be proven correct by a verification tool. Formal Software Engineering and the Grand ChallengeThe goal of the Verifying Compiler Grand Challenge [7,6] is to build a verifying compiler that "uses mathematical and logical reasoning to check the programs that it compiles."This implies that "a program should be allowed to run only if it is both syntactically and semantically correct" [20]. To achieve this goal, the whole computing community have to deal with a wide range of issues, among which are [2] 1. arriving at automated procedures of abstraction that enables a compiler to work in combination with different program verification tools including testing tools, 2. studying what, where, when and how the correctness properties, i.e. assertions and annotations, are identified and specified, 3. identifying properties that can be verified compositionally, and designing specification notations and models to support more compositional specification, analysis and verification. 4. making tools that are scalable even with specified correctness criteria, In our view, theories and techniques are a long way from being able to solve the first three problems, and solutions to these problems is obviously vital for dealing with the fourth problem.

show abstract

Section: Automatic Code Generators That Implement the Implementation mentioning

confidence: 98%

Section: Formal Software Engineering and The Grand Challengementioning

confidence: 99%