429 search results - page 36 / 86 » Theorem Proving Languages for Verification |
81
Voted
MICAI
2000
Springer
15 years 2 months ago
2000
Springer
Unique Fixpoint Induction, UFI, is a chief inference rule to prove the equivalence of recursive processes in CCS [7]. It plays a major role in the equational approach to verificati...
85
Voted
WWW
2007
ACM
15 years 11 months ago
2007
ACM
XACML has emerged as a popular access control language on the Web, but because of its rich expressiveness, it has proved difficult to analyze in an automated fashion. In this pape...
177
click to vote
POPL
2008
ACM
15 years 11 months ago
2008
ACM
Translation validation consists of transforming a program and a posteriori validating it in order to detect a modification of its semantics. This approach can be used in a verifie...
AMAI
2004
Springer
15 years 4 months ago
2004
Springer
In reasoning tasks involving logical formulas, high expressiveness is desirable, although it often leads to high computational complexity. We study a simple measure of expressiven...
TCS
2002
14 years 10 months ago
2002
In this work, we investigate various specification languages and their relation to Casl, the recently developed Common Algebraic Specification Language. In particular, we consider...