119 search results - page 9 / 24 » Boolean Operations on Feature-based Models |
VLSID
2002
IEEE
14 years 7 months ago
2002
IEEE
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...
JUCS
2010
13 years 2 months ago
2010
: Motivated by our experiences with spatial modelling for the sustainable land use initiative we present a geometrically enhanced ER model (GERM), which preserves the key principle...
WSCG
2000
13 years 8 months ago
2000
Many engineering disciplines can profitably use large high-resolution geometric models whose computational requirements exceed current computer hardware capacities. This paper pre...
CAV
2000
Springer
13 years 11 months ago
2000
Springer
In this paper we show how to do symbolic model checking using Boolean Expression Diagrams (BEDs), a non-canonical representation for Boolean formulas, instead of Binary Decision Di...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. Operator precedence grammars define a classical Boolean and deterministic context-free family (called Floyd languages or FLs). FLs have been shown to strictly include the...