Sciweavers

131 search results - page 8 / 27
» Proof systems that take advice
Sort
View
JCS
2007
80views more  JCS 2007»
13 years 9 months ago
Secure information flow for a concurrent language with scheduling
Information flow type systems provide an elegant means to enforce confidentiality of programs. Using the proof assistant Isabelle/HOL, we have specified an information flow ty...
Gilles Barthe, Leonor Prensa Nieto
AMAI
2005
Springer
13 years 9 months ago
Resolution cannot polynomially simulate compressed-BFS
Many algorithms for Boolean satisfiability (SAT) work within the framework of resolution as a proof system, and thus on unsatisfiable instances they can be viewed as attempting to...
DoRon B. Motter, Jarrod A. Roy, Igor L. Markov
HICSS
2005
IEEE
175views Biometrics» more  HICSS 2005»
14 years 3 months ago
Creating Value from Digital Content: eBusiness Model Evolution in Online News and Music
The past two years have been a turbulent time for the New Economy generally – and for the digital content industry in particular. In the wake of the dot.com and telecoms crashes...
Kornelia van der Beek, Paula M. C. Swatman, Cornel...
FC
1998
Springer
96views Cryptology» more  FC 1998»
14 years 2 months ago
Compliance Checking in the PolicyMaker Trust Management System
Emerging electronic commerce services that use public-key cryptography on a mass-market scale require sophisticated mechanisms for managing trust. For example, any service that rec...
Matt Blaze, Joan Feigenbaum, Martin Strauss
ENTCS
2008
170views more  ENTCS 2008»
13 years 10 months ago
A Coq Library for Verification of Concurrent Programs
Thanks to recent advances, modern proof assistants now enable verification of realistic sequential programs. However, regarding the concurrency paradigm, previous work essentially...
Reynald Affeldt, Naoki Kobayashi