347 search results - page 12 / 70 » Computable Versions of Basic Theorems in Functional Analysis |
112
Voted
WSC
2004
15 years 5 months ago
2004
The authors present the requirement definition and methodological approach for developing a new generation of Computer Generated Forces (CGF) based on Intelligent Agents. The anal...
133
Voted
IPPS
2006
IEEE
15 years 9 months ago
2006
IEEE
We present an overview of the Jahob system for modular analysis of data structure properties. Jahob uses a subset of Java as the implementation language and annotations with formu...
125
Voted
ESOP
2006
Springer
15 years 7 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...
124
Voted
ASIAN
2006
Springer
15 years 7 months ago
2006
Springer
We present formal proof rules for inductive reasoning about the way that data transmitted on the network remains secret from a malicious attacker. Extending a compositional protoco...
128
Voted
HPCN
1997
Springer
15 years 7 months ago
1997
Springer
This paper describes a distributed algorithm for Boolean function manipulation. The algorithm is based on Binary Decision Diagrams (BDDs), which are one of the most commonly used ...