Sciweavers

128 search results - page 11 / 26
» Verifying Process Algebra Proofs in Type Theory
Sort
View
CORR
2008
Springer
143views Education» more  CORR 2008»
13 years 7 months ago
A Type System for Data-Flow Integrity on Windows Vista
The Windows Vista operating system implements an interesting model of multi-level integrity. We observe that in this model, trusted code must participate in any information-flow a...
Avik Chaudhuri, Prasad Naldurg, Sriram K. Rajamani
ICFP
2009
ACM
14 years 8 months ago
Effective interactive proofs for higher-order imperative programs
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
Adam J. Chlipala, J. Gregory Malecha, Greg Morrise...
KI
1990
Springer
13 years 11 months ago
The Representation of Program Synthesis in Higher Order Logic
ue to a lack of abstraction in the formalization of deductive mechanisms involved in programming reasoning tools for the development of program synthesizers are not yet available. ...
Christoph Kreitz
POPL
2006
ACM
14 years 8 months ago
Decidability and proof systems for language-based noninterference relations
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
Mads Dam
MKM
2004
Springer
14 years 1 months ago
Flexible Encoding of Mathematics on the Computer
This paper reports on refinements and extensions to the MathLang framework that add substantial support for natural language text. We show how the extended framework supports mult...
Fairouz Kamareddine, Manuel Maarek, J. B. Wells