837 search results - page 10 / 168 » Proof Development with OMEGA |
101
click to vote
SP
2009
IEEE
15 years 8 months ago
2009
IEEE
We present two machine-checked proofs of the existential unforgeability under adaptive chosen-message attacks of the Full Domain Hash signature scheme. These proofs formalize the ...
124
Voted
ICSE
2004
IEEE-ACM
16 years 1 months ago
2004
IEEE-ACM
Most research on automated specification-based software testing has focused on the automated generation of test cases. Before a software system can be tested, it must be set up ac...
100
Voted
AML
2010
15 years 2 months ago
2010
We investigate the development of terms during cut-elimination in first-order logic and Peano arithmetic for proofs of existential formulas. The form of witness terms in cut-free p...
131
click to vote
JAR
2010
15 years 9 days ago
2010
Meta-logics and type systems based on intuitionistic logic are commonly used for specifying natural deduction proof systems. We shall show here that linear logic can be used as a m...
103
click to vote
ICFEM
2009
Springer
15 years 8 months ago
2009
Springer
It is believed that reusability in formal development should reduce the time and cost of formal modelling within a production environment. Along with the ability to reuse formal mo...