Sciweavers

508 search results - page 11 / 102
» A logical account of pspace
Sort
View
IANDC
2007
111views more  IANDC 2007»
13 years 7 months ago
Expressiveness and complexity of graph logic
We investigate the complexity and expressive power of a spatial logic for reasoning about graphs. This logic was previously introduced by Cardelli, Gardner and Ghelli, and provide...
Anuj Dawar, Philippa Gardner, Giorgio Ghelli
DATE
1999
IEEE
123views Hardware» more  DATE 1999»
13 years 11 months ago
Accounting for Various Register Allocation Schemes During Post-Synthesis Verification of RTL Designs
This paper reports a formal methodology for verifying a broad class of synthesized register-transfer-level (RTL) designs by accommodating various register allocation/optimization ...
Nazanin Mansouri, Ranga Vemuri
MFCS
1995
Springer
13 years 11 months ago
An Abstract Account of Composition
act Account of Composition Mart n Abadi1 and Stephan Merz2 1 Digital Equipment Corporation, Systems Research Center, 130 Lytton Avenue, Palo Alto, CA 94301, U.S.A. 2 Institut fur I...
Martín Abadi, Stephan Merz
FUIN
2000
71views more  FUIN 2000»
13 years 7 months ago
The Nondeterministic Information Logic NIL is PSPACE-complete
The nondeterministic information logic NIL has been introduced by Orlowska and Pawlak in 1984 as a logic for reasoning about total information systems with the similarity, the forw...
Stéphane Demri
AIML
2004
13 years 9 months ago
Complexity of Strict Implication
abstract. The aim of the present paper is to analyze the complexity of strict implication (together with falsum, conjunction and disjunction). We prove that Ladner's Theorem r...
Félix Bou