Sciweavers

1823 search results - page 42 / 365
» Formal specification: a roadmap
Sort
View
IWFM
1998
13 years 11 months ago
Formal Engineering of the Bitonic Sort using PVS
In this paper, we present a proof that the bitonic sort is sound using PVS, a powerful specification and verification environment. First, we briefly introduce this well-known para...
Raphaël Couturier
FMCAD
2008
Springer
13 years 11 months ago
A Theory of Mutations with Applications to Vacuity, Coverage, and Fault Tolerance
The quality of formal specifications and the circuits they are written for can be evaluated through checks such as vacuity and coverage. Both checks involve mutations to the specif...
Orna Kupferman, Wenchao Li, Sanjit A. Seshia
FORTE
2008
13 years 11 months ago
Program Repair Suggestions from Graphical State-Transition Specifications
In software engineering, graphical formalisms, like state-transition tables and automata, are very often indispensable parts of the specifications. Such a formalism usually leads t...
Farn Wang, Chih-Hong Cheng
FAC
2008
100views more  FAC 2008»
13 years 10 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
PTS
2000
58views Hardware» more  PTS 2000»
13 years 11 months ago
Formal Test Automation: The Conference Protocol with PHACT
We discuss a case study of automatic test generation and test execution based on formal methods. The case is the Conference Protocol, a simple, chatbox-like protocol, for which (fo...
Lex Heerink, Jan Feenstra, Jan Tretmans