1894 search results - page 133 / 379 » A TLA Proof System |
151
Voted
TABLEAUX
2009
Springer
15 years 10 months ago
2009
Springer
We consider two sequent calculi for tense logic in which the syntactic judgements are nested sequents, i.e., a tree of traditional onesided sequents built from multisets of formula...
137
Voted
SIGCOMM
2010
ACM
15 years 3 months ago
2010
ACM
We argue that recent hypervisor-vs-microkernel discussions completely miss the point. Fundamentally, the two classes of systems h in common, and provide similar abstractions. We a...
183
Voted
ICDT
2009
ACM
16 years 4 months ago
2009
ACM
World-set algebra is a variable-free query language for uncertain databases. It constitutes the core of the query language implemented in MayBMS, an uncertain database system. Thi...
158
Voted
DCC
2005
IEEE
16 years 3 months ago
2005
IEEE
We give an overview of some of the mathematical results of Dominique de Caen. These include a short proof of K?onig's theorem, results on Tur?an numbers, biclique partitions,...
124
click to vote
RP
2009
Springer
15 years 10 months ago
2009
Springer
In [13], Yen defines a class of formulas for paths in Petri nets and claims that its satisfiability problem is EXPSPACE-complete. In this paper, we show that in fact the satisfi...