Sciweavers

903 search results - page 6 / 181
» Completeness Results for Memory Logics
Sort
View
DATE
1999
IEEE
72views Hardware» more  DATE 1999»
13 years 11 months ago
On Programmable Memory Built-In Self Test Architectures
The design and architectures of a microcode-based memory BIST and programmable FSM-based memory BIST unit are presented. The proposed microcode-based memory BIST unit is more e ci...
Kamran Zarrineh, Shambhu J. Upadhyaya
IGPL
2010
120views more  IGPL 2010»
13 years 6 months ago
A complete axiom set for Hansson's deontic logic DSDL2
The main contribution of this paper is a (strong) completeness result for an axiomatization of Hansson [13]’s deontic system DSDL2, whose semantics involves a non-necessarily tr...
Xavier Parent
JSYML
2010
107views more  JSYML 2010»
13 years 5 months ago
A proof of completeness for continuous first-order logic
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
Arthur Paul Pedersen, Itay Ben-Yaacov
STACS
2009
Springer
14 years 2 months ago
Strong Completeness of Coalgebraic Modal Logics
ABSTRACT. Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction...
Lutz Schröder, Dirk Pattinson
LATIN
2004
Springer
14 years 24 days ago
Pure Future Local Temporal Logics Are Expressively Complete for Mazurkiewicz Traces
The paper settles a long standing problem for Mazurkiewicz traces: the pure future local temporal logic defined with the basic modalities exists-next and until is expressively com...
Volker Diekert, Paul Gastin