608 search results - page 33 / 122 » Tests, Proofs and Refinements |
107
click to vote
ICFEM
2000
Springer
15 years 4 months ago
2000
Springer
Retrenchment is presented in a simple relational framework as a more flexible development concept than refinement for capturing the early preformal stages of development, and brie...
113
Voted
LICS
1994
IEEE
15 years 4 months ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
93
Voted
IANDC
2008
15 years 17 days ago
2008
A previous paper introduced eternity variables as an alternative to the prophecy variables of Abadi and Lamport and proved the formalism to be semantically complete: every simulat...
115
Voted
JAR
2006
15 years 15 days ago
2006
We describe an approach to verifying bit-level pipelined machine models using a combination of deductive reasoning and decision procedures. While theorem proving systems such as AC...
TSE
2002
15 years 5 days ago
2002
In this paper, we propose a means to enhance an architecture description language with a description of component behavior. A notation used for this purpose should be able to expr...