Sciweavers

1058 search results - page 58 / 212
» It's Doomed; We Can Prove It
Sort
View
FM
2003
Springer
108views Formal Methods» more  FM 2003»
14 years 3 months ago
Correctness of Source-Level Safety Policies
Abstract. Program certification techniques formally show that programs satisfy certain safety policies. They rely on the correctness of the safety policy which has to be establish...
Ewen Denney, Bernd Fischer 0002
FOSSACS
1998
Springer
14 years 2 months ago
Functor Categories and Two-Level Languages
Abstract. We propose a denotational semantics for the two-level language of [GJ91, Gom92], and prove its correctness w.r.t. a standard denotational semantics. Other researchers (se...
Eugenio Moggi
AIMSA
1998
Springer
14 years 2 months ago
A Blackboard Architecture for Guiding Interactive Proofs
The acceptance and usability of current interactive theorem proving environments is, among other things, strongly influenced by the availability of an intelligent default suggestio...
Christoph Benzmüller, Volker Sorge
ISSTA
1998
ACM
14 years 2 months ago
Verifying Systems with Integer Constraints and Boolean Predicates: A Composite Approach
Symbolic model checking has proved highly successful for large nite-state systems, in which states can be compactly encoded using binary decision diagrams (BDDs) or their variants...
Tevfik Bultan, Richard Gerber, Christopher League
ACNS
2007
Springer
96views Cryptology» more  ACNS 2007»
14 years 1 months ago
Universal Accumulators with Efficient Nonmembership Proofs
Based on the notion of accumulators, we propose a new cryptographic scheme called universal accumulators. This scheme enables one to commit to a set of values using a short accumul...
Jiangtao Li, Ninghui Li, Rui Xue