1894 search results - page 61 / 379 » A TLA Proof System |
99
Voted
STOC
2006
ACM
16 years 29 days ago
2006
ACM
We prove that every problem in NP that has a zero-knowledge proof also has a zero-knowledge proof where the prover can be implemented in probabilistic polynomial time given an NP ...
91
Voted
CCS
2004
ACM
15 years 6 months ago
2004
ACM
Information flow type systems provide an elegant means to enforce confidentiality of programs. Using the proof assistant Isabelle/HOL, we have machine-checked a recent work of B...
92
Voted
FUIN
2006
15 years 20 days ago
2006
We prove that negative hyper-resolution using any liftable and well-founded ordering refinement is a sound and complete procedure for answering queries in disjunctive logic program...
MOC
1998
15 years 10 days ago
1998
Abstract. Details of a new technique for obtaining rigorous results concerning the global dynamics of nonlinear systems is described. The technique abstract existence results based...
ICFP
2008
ACM
16 years 19 days ago
2008
ACM
There has been a lot of interest of late for programming languages that incorporate features from dependent type systems and proof assistants in order to capture in the types impo...