1717 search results - page 235 / 344 » A Computable Spectral Theorem |
137
click to vote
CTRSA
2009
Springer
16 years 7 days ago
2009
Springer
Abstract. Fault Analysis is a powerful cryptanalytic technique that enables to break cryptographic implementations embedded in portable devices more efficiently than any other tech...
143
click to vote
FOSSACS
2009
Springer
16 years 7 days ago
2009
Springer
Abstract. We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicati...
124
click to vote
WOLLIC
2009
Springer
16 years 1 days ago
2009
Springer
Abstract. We introduce a tree-sequent calculus for inquisitive logic (Groenendijk 2008) as a special form of labelled deductive system (Gabbay 1996). In particular, we establish th...
137
click to vote
LPNMR
2009
Springer
16 years 6 hour ago
2009
Springer
Problems arising from the revision of propositional knowledge bases have been intensively studied for two decades. Many different approaches to revision have thus been suggested, w...
145
click to vote
LICS
2008
IEEE
15 years 12 months ago
2008
IEEE
LF is a dependent type theory in which many other formal systems can be conveniently embedded. However, correct use of LF relies on nontrivial metatheoretic developments such as p...