6978 search results - page 216 / 1396 » On Proofs in System P |
151
click to vote
CCS
2004
ACM
15 years 12 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...
160
click to vote
FUIN
2006
15 years 6 months 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...
155
click to vote
MOC
1998
15 years 6 months 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...
160
click to vote
MUM
2004
ACM
16 years 9 hour ago
2004
ACM
While peer-to-peer (P2P) has emerged as a new hot communication concept among the Internet users, mobile usage of P2P applications is still taking its first steps. This article fi...
142
click to vote
ICFP
2008
ACM
16 years 6 months 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...