797 search results - page 41 / 160 » MODULA-2 and Its Compilation |
AAAI
2007
13 years 10 months ago
2007
This paper deals with the monitoring and diagnosis of large discrete-event systems. The problem is to determine, online, all faults and states that explain the flow of observatio...
WIESS
2000
13 years 9 months ago
2000
As IPC mechanisms become faster, stub-code efficiency becomes a performance issue for local client/server RPCs and inter-component communication. Inefficient and unnecessary compl...
JSC
2010
13 years 6 months ago
2010
The topic of this article is decision procedures for satisfiability modulo theories (SMT) of arbitrary quantifier-free formulæ. We propose an approach that decomposes the formu...
CRYPTO
2011
Springer
12 years 8 months ago
2011
Springer
Abstract. We present EasyCrypt, an automated tool for elaborating security proofs of cryptographic systems from proof sketches—compact, formal representations of the essence of a...
IPPS
1995
IEEE
14 years 6 hour ago
1995
IEEE
Abstract. To e ectively parallelize real programs, parallelizing compilers need powerful symbolic analysis techniques 13, 6 . In previous work we have introduced an algorithm calle...