793 search results - page 42 / 159 » Argumentation and standards of proof |
224
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
149
click to vote
SIGSOFT
2003
ACM
16 years 7 months ago
2003
ACM
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker ...
194
click to vote
POPL
2010
ACM
16 years 4 months ago
2010
ACM
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions. The compiler is programmed in th...
164
click to vote
CALCO
2007
Springer
16 years 28 days ago
2007
Springer
Metric coinduction is a form of coinduction that can be used to establish properties of objects constructed as a limit of finite approximations. One can prove a coinduction step s...
176
click to vote
EUROCRYPT
2000
Springer
15 years 10 months ago
2000
Springer
We show that if any one-way function exists, then 3-round concurrent zero-knowledge arguments for all NP problems can be built in a model where a short auxiliary string with a pres...