1894 search results - page 117 / 379 » A TLA Proof System |
148
click to vote
EGCDMAS
2004
15 years 2 months ago
2004
Security policies are abstract descriptions of how a system should behave to be secure. They typically express what is obligatory, permitted, or forbidden in the system. When the s...
CDC
2010
IEEE
14 years 8 months ago
2010
IEEE
In this paper, we present a general algebraic framework for analysing decentralized control systems. We consider systems defined by linear fractional functions over a commutative ...
STOC
2010
ACM
15 years 10 months ago
2010
ACM
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a p...
FSTTCS
2004
Springer
15 years 6 months ago
2004
Springer
We present a fragment of separation logic oriented to linked lists, and study decision procedures for validity of entailments. The restrictions in the fragment are motivated by the...
111
click to vote
TPHOL
2000
IEEE
15 years 5 months ago
2000
IEEE
We verify within the Coq proof assistant that ML typing is sound with respect to the dynamic semantics. We prove this property in the framework of a big step semantics and also in ...