3045 search results - page 500 / 609 » Formal Approaches to Software Architecture |
218
click to vote
ISPASS
2010
IEEE
15 years 8 months ago
2010
IEEE
Abstract—Transactional memory promises to generalize transactional programming to mainstream languages and data structures. The purported benefit of transactions is that they ar...
184
click to vote
BIRTHDAY
2003
Springer
15 years 11 months ago
2003
Springer
One of the central axioms of extreme programming is the disciplined use of regression testing during stepwise software development. Due to recent progress in software model checkin...
168
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
166
click to vote
MOBIHOC
2009
ACM
16 years 7 months ago
2009
ACM
Location-free boundary recognition is crucial and critical for many fundamental network functionalities in wireless ad hoc and sensor networks. Previous designs, often coarse-grai...
185
click to vote
VLSID
2002
IEEE
16 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...