6274 search results - page 98 / 1255 » Proofs, Programs, Processes |
100
click to vote
LOPSTR
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL∗ ) properties of finite state reactive systems. The finite state ...
IPL
2008
14 years 12 months ago
2008
Slicing is a program transformation technique with numerous applications, as it allows the user to focus on the parts of a program that are relevant for a given purpose. Ideally, ...
163
click to vote
PPSWR
2005
Springer
15 years 5 months ago
2005
Springer
We present typing rules for the Web query language Xcerpt. The rules provide a descriptive type system: the typing of a program is an ation of its semantics. The rules can also be ...
IFIP
2004
Springer
15 years 5 months ago
2004
Springer
Abstract The computational proof model of Bellare and Rogaway for cryptographic protocol analysis is complemented by providing a formal specification of the actions of the adversa...
112
click to vote
RTA
2010
Springer
15 years 3 months ago
2010
Springer
This paper shows the equivalence of applicative similarity and contextual approximation, and hence also of bisimilarity and contextual equivalence, in the deterministic call-by-nee...