634 search results - page 86 / 127 » Separability in the Ambient Logic |
163
click to vote
CSL
2007
Springer
16 years 8 days ago
2007
Springer
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
159
click to vote
CSL
2005
Springer
15 years 11 months ago
2005
Springer
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
149
click to vote
CHARME
2003
Springer
15 years 11 months ago
2003
Springer
We consider the problem of bounded model checking of systems expressed in a decidable fragment of first-order logic. While model checking is not guaranteed to terminate for an ar...
173
click to vote
ICDCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We argue that joint administration of access policies for a dynamic coalition formed by autonomous domains requires that these domains set up a coalition authority that distribute...
174
click to vote
ICSE
2001
IEEE-ACM
15 years 10 months ago
2001
IEEE-ACM
Support for dynamic and client-specific customization is required in many application areas. We present a (distributed) application as consisting of a minimal functional core – ...