119 search results - page 9 / 24 » Boolean Operations on Feature-based Models |
105
Voted
VLSID
2002
IEEE
16 years 1 days 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
14 years 6 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...
92
Voted
WSCG
2000
15 years 1 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...
107
click to vote
CAV
2000
Springer
15 years 3 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...
88
Voted
CORR
2010
Springer
14 years 8 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...