6978 search results - page 235 / 1396 » On Proofs in System P |
197
click to vote
AIMSA
1998
Springer
15 years 11 months ago
1998
Springer
The acceptance and usability of current interactive theorem proving environments is, among other things, strongly influenced by the availability of an intelligent default suggestio...
203
click to vote
ENTCS
2006
15 years 6 months ago
2006
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
195
click to vote
APPROX
2010
Springer
15 years 8 months ago
2010
Springer
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
128
click to vote
ASIACRYPT
2000
Springer
15 years 11 months ago
2000
Springer
In a recent Stanford Law Review article, Ayres and Bulow [1] propose a radical anonymity-based solution to disrupt the “market” for monetary influence in political campaigns. ...
189
click to vote
ENTCS
2008
15 years 6 months ago
2008
HOL-TestGen is a specification and test case generation environment extending the interactive theorem prover Isabelle/HOL. The HOL-TestGen method is two-staged: first, the origina...