Sciweavers

837 search results - page 10 / 168
» Proof Development with OMEGA
Sort
View
SP
2009
IEEE
114views Security Privacy» more  SP 2009»
15 years 4 months ago
Formally Certifying the Security of Digital Signature Schemes
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 ...
Santiago Zanella Béguelin, Gilles Barthe, B...
78
Voted
ICSE
2004
IEEE-ACM
15 years 10 months ago
Automated Generation of Test Programs from Closed Specifications of Classes and Test Cases
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...
Wee Kheng Leow, Siau-Cheng Khoo, Yi Sun
76
Voted
AML
2010
87views more  AML 2010»
14 years 10 months ago
On the form of witness terms
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...
Stefan Hetzl
JAR
2010
123views more  JAR 2010»
14 years 8 months ago
A Framework for Proof Systems
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...
Vivek Nigam, Dale Miller
ICFEM
2009
Springer
15 years 4 months ago
Supporting Reuse of Event-B Developments through Generic Instantiation
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...
Renato Silva, Michael Butler