Sciweavers

80 search results - page 15 / 16
» PVS
Sort
View
CADE
2006
Springer
14 years 6 months ago
Extracting Programs from Constructive HOL Proofs Via IZF Set-Theoretic Semantics
Church's Higher Order Logic is a basis for proof assistants -- HOL and PVS. Church's logic has a simple set-theoretic semantics, making it trustworthy and extensible. We ...
Robert L. Constable, Wojciech Moczydlowski
ISW
2004
Springer
13 years 11 months ago
A Distributed High Assurance Reference Monitor
Abstract Ajay Chander1 , Drew Dean2 , and John Mitchell3 1 DoCoMo Communications Laboratories USA, San Jose, CA 95110 2 Computer Science Laboratory, SRI International, Menlo Park, ...
Ajay Chander, Drew Dean, John C. Mitchell
FM
1999
Springer
107views Formal Methods» more  FM 1999»
13 years 10 months ago
A Formalization of Software Architecture
Software architecture addresses the high level specification, design and analysis of software systems. Formal models can provide essential underpinning for architectural descripti...
John Herbert, Bruno Dutertre, Robert A. Riemenschn...
FMCAD
1998
Springer
13 years 10 months ago
Combining Symbolic Model Checking with Uninterpreted Functions for Out-of-Order Processor Verification
We present a new approach to the verification of hardware systems with data dependencies using temporal logic symbolic model checking. As a benchmark we take Tomasulo's algori...
Sergey Berezin, Armin Biere, Edmund M. Clarke, Yun...
IANDC
2008
81views more  IANDC 2008»
13 years 5 months ago
Universal extensions to simulate specifications
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...
Wim H. Hesselink