2488 search results - page 341 / 498 » An improvement in formal verification |
112
click to vote
ICFCA
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. The “Semantic Mirrors Method” (Dyvik, 1998) is a means for automatic derivation of thesaurus entries from a word-aligned parallel corpus. The method is based on the c...
113
click to vote
ICLP
1997
Springer
15 years 5 months ago
1997
Springer
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
111
click to vote
ASIACRYPT
2008
Springer
15 years 3 months ago
2008
Springer
The collision-resistance of hash functions is an important foundation of many cryptographic protocols. Formally, collision-resistance can only be expected if the hash function in f...
121
click to vote
ENGL
2007
15 years 1 months ago
2007
Abstract—In any formal theory, a proof is a sequence of well formed formulas (wff). Here, we consider the digraph whose nodes are proofs and the edges are pairs of proofs such t...
131
click to vote
IAJIT
2010
15 years 5 days ago
2010
: The specification of the dynamic behaviour of reactive distributed systems must exhibit the structures of control and has to imply explicitly the relevant aspects of the distribu...