1894 search results - page 245 / 379 » A TLA Proof System |
122
click to vote
HASE
2007
IEEE
15 years 8 months ago
2007
IEEE
Automated verification plays an important role for high assurance software. This typically uses a pair of pre/post conditions as a formal (but possibly partial) specification of e...
131
click to vote
ESOP
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We present a type system for a compile-time analysis of heapspace requirements of Java style object-oriented programs with explicit deallocation. Our system is based on a...
132
click to vote
EUROCRYPT
2006
Springer
15 years 8 months ago
2006
Springer
Non-interactive zero-knowledge (NIZK) proof systems are fundamental cryptographic primitives used in many constructions, including CCA2-secure cryptosystems, digital signatures, an...
145
click to vote
CSFW
1998
IEEE
15 years 8 months ago
1998
IEEE
In previous work [16], we give a type system that guarantees that well-typed multithreaded programs are possibilistically noninterfering. If thread scheduling is probabilistic, ho...
142
click to vote
ICLP
2010
Springer
15 years 7 months ago
2010
Springer
We present a novel approach to non-monotonic ILP and its implementation called tal (Top-directed Abductive Learning). tal overcomes some of the completeness problems of ILP systems...