1894 search results - page 77 / 379 » A TLA Proof System |
120
Voted
CADE
2004
Springer
15 years 6 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...
114
click to vote
AIMSA
1998
Springer
15 years 5 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...
125
Voted
ENTCS
2006
15 years 22 days 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...
68
Voted
ASIACRYPT
2000
Springer
15 years 5 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. ...
123
Voted
ENTCS
2008
15 years 24 days 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...