Formal verification of Ada programs

Guaspari, David; Marceau, Carla; Polak, Wolfgang

doi:10.1109/32.58790

Cited by 61 publications

(7 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…To perform all necessary constraint checks as a program components are constructed, it is necessary to utilise specification and design information, and relate it to the program architecture and code, To do this tools such as [17], and [19] use a system of annotations ('formal Ada comments'), as discussed in 4.1.5. Introduction of an annotation system may also bring with it some stylistic restrictions on the use of Ada, for instance to reduce overloading and limit visibility.…”

Section: The Choice Of Languagementioning

confidence: 99%

Guidance for the use of the Ada programming language in high integrity systems

Wichmann¹

1998

Ada Lett.

View full text Add to dashboard Cite

This paper is the current result of a study by the ISO HRG Rapporteur group which is being circulated for comment. Many people have contributed to this, but those who have either attended two recent meetings of group or have made substantial e-mail comments are: Praful V Bhansali (Boeing, USA), Alan Burns (University of York, UK), Bernard Carre' (Praxis Critical Systems, UK), Dan Craigen (ORA, Canada), Nick Johnson MoD, UK), Stephen Michell (Canada), Gilles Motet (DGEI/INSA, France), George Romanski (AONIX, USA), Mark Saaltink (ORA, Canada), Gareth Rowlands (MoD, UK), Adam Tacy (MoD, UK), (Phil) JP Thornley (BAe, UK), David Tombs (DERA, UK), Tullio Vardanega (ESA/ESTEC, Netherlands), Brian Wichmann (NPL, UK).

show abstract

Section: The Choice Of Languagementioning

confidence: 99%

Guidance for the use of the Ada programming language in high integrity systems

Wichmann¹

1998

Ada Lett.

View full text Add to dashboard Cite

show abstract

“…Comprobar que tanto la condición de carrera como el abrazo mortal no se dan en una aplicación es complejo, utilizándose para tal fin las herramientas de validación formal. Diversas herramientas existentes para lenguajes de programación como C (Volanski, 2008), Ada (Guaspari, Marceau, Polak 1990) o Java (Visser, Pireanu, Khurshid 2004) permiten garantizar formalmente la no existencia de condiciones de carrera ni de abrazo mortal. En esencia dicha comprobación se hace recorriendo todos los estados de un programa verificando si se cumple alguna de invariante que garantice que no hay condición de carrera ni abrazo mortal.…”

Section: Introductionunclassified

Módulo Empresarial para la Validación Formal de Ejercicios aplicado a la Programación Concurrente en Java

Val

García-Valls

Estévez-Ayres

et al. 2012

Revista Iberoamericana de Automática e Informática Industrial R

View full text Add to dashboard Cite

La utilización de herramientas que permitan detectar problemas de programación es de utilidad tanto para el docente, el cual puede probar de una forma más exhaustiva las prácticas entregadas, como para el discente, el cual puede utilizar dichas herramientas. En muchos casos, existen herramientas previas utilizadas en el desarrollo software, que pueden ser adaptadas para ser utilizadas en un entorno formativo. Este trabajo aporta la integración de una herramienta de validación formal de sistemas concurrentes Java, la cual garantiza la no existencia de defectos como son el abrazo mortal y las condiciones de carrera, en un entorno Web abierto. Más concretamente, la herramienta que se ha escogido es denominada JPF (Java Path Finder) y se la ha dotado de interfaces dentro de un servidor Java EE (Enterprise Edition), lo que facilita la utilización de servicios propios de la plataforma Java EE y la interoperabilidad entre estos con el módulo diseñado. El artículo trata aspectos tecnológicos derivados de dicha integración como son el diseño de una arquitectura que da soporte a la validación vía web. También detalla una serie de experimentos relativos al rendimiento de la plataforma realizados sobre un curso real, lo que permite medir costes computacionales y su utilidad en la evaluación.

show abstract

“…For more than a decade there have been subsets of Ada to support the development and formal analysis of sequential Ada code [6,8]. The most successful of these is the SPARK [15] language, a heavily restricted sequential subset of Ada [1] with sufficient analysis tools to do a reasonable job of statically verifying some classes of programs.…”

Section: Introductionmentioning

confidence: 99%

“…The reasons for the formal analysis of a program are well documented, and there have been a number of attempts to formally verify sequential Ada programs [8,6] and Concurrent Ada programs [11,10,9]. To date, these analyses either tackle the sequential portions of the code, subprograms, data elements, preconditions, postconditions, invariance; or the analyses tackle the concurrent portions to show correct scheduling, produce timing and load budgets, and analyze priority inversions.…”

Section: Introductionmentioning

confidence: 99%

An approach to formal verication of real time concurrent Ada programs

Howe¹,

Michell²

2003

Proceedings of the 12th International Workshop on Real-Time Ada - IRTAW '03

View full text Add to dashboard Cite

The SPARK system provides static analysis tools for a highly restricted sequential Ada subset, including a proof checking tool for verifying partial correctness properties. Recently, SPARK Ada has been extended to include much of the Ravenscar Tasking Pro le which supports construction of high integrity real time systems. However, the veri cation machinery has not been changed, and can only handle purely sequential properties of the code. This paper sketches an approach to reasoning about the concurrent and real-time aspects that SPARK cannot handle. The approach involves compiling an abstract model of the Ada program that can be embedded in a general purpose theorem prover (e.g. PVS). The compilation makes heavy use of SPARK's existing static analysis tools.

show abstract

Formal verification of Ada programs

Cited by 61 publications

References 16 publications

Guidance for the use of the Ada programming language in high integrity systems

Guidance for the use of the Ada programming language in high integrity systems

Módulo Empresarial para la Validación Formal de Ejercicios aplicado a la Programación Concurrente en Java

An approach to formal verication of real time concurrent Ada programs

Contact Info

Product

Resources

About