2286 search results - page 201 / 458 » Algorithms for Categorical Equivalence |
185
click to vote
TPHOL
2000
IEEE
15 years 11 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 ...
174
click to vote
PKC
1999
Springer
15 years 10 months ago
1999
Springer
Since many applications require the verification of large sets of signatures, it is sometimes advantageous to perform a simultaneous verification instead of checking each signatu...
202
click to vote
HYBRID
1998
Springer
15 years 10 months ago
1998
Springer
We continue investigation of languages, accepted by timed automata of Alur and Dill. In [ACM97] timed regular expressions equivalent to timed automata were introduced. Here we intr...
154
click to vote
ISSAC
1990
Springer
15 years 10 months ago
1990
Springer
Let a system of linear ordinary differential equations of the first order Y' = AY be given, where A is n x n matrix over a field F(X), assume that the degree degx(A) < d a...
164
click to vote
VLDB
1989
ACM
15 years 10 months ago
1989
ACM
In this paper, we introduce Quasi Serializability, a correctness criterion for concurrency control in heterogeneous distributed database environments. A global history is quasi se...