634 search results - page 86 / 127 » Separability in the Ambient Logic |
CSL
2007
Springer
14 years 4 months 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 ...
CSL
2005
Springer
14 years 3 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...
CHARME
2003
Springer
14 years 3 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...
ICDCS
2002
IEEE
14 years 2 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...
ICSE
2001
IEEE-ACM
14 years 2 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 – ...