1894 search results - page 83 / 379 » A TLA Proof System |
107
click to vote
CADE
2003
Springer
16 years 1 months ago
2003
Springer
We describe the integration of permutation group algorithms with proof planning. We consider eight basic questions arising in computational permutation group theory, for which our ...
148
Voted
ASIAN
2009
Springer
15 years 1 months ago
2009
Springer
In cryptographic protocols, zero knowledge proofs are employed for a principal A to communicate some non-trivial information t to B while at the same time ensuring that B cannot de...
116
Voted
JAR
2006
15 years 21 days ago
2006
The dependency pair technique [1, 11, 12] is a powerful method for automated termination and innermost termination proofs of term rewrite systems (TRSs). For any TRS, it generates ...
115
click to vote
TCS
2011
14 years 7 months ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
172
click to vote
PLPV
2011
ACM
14 years 3 months ago
2011
ACM
Soundness proofs of program logics such as Hoare logics and type systems are often made easier by decorating the operational semantics with information that is useful in the proof...