31387 search results - page 5969 / 6278 » Abstracting abstract machines |
236
click to vote
FLOPS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Assertion-based contracts provide a powerful mechanism for stating invariants at module boundaries and for enforcing them uniformly. In 2002, Findler and Felleisen showed...
200
click to vote
FMICS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Bounded model checking (BMC) based on satisfiability testing (SAT) has been introduced as a complementary technique to BDDbased symbolic model checking of LTL properties ...
188
click to vote
FPGA
2006
ACM
15 years 10 months ago
2006
ACM
Abstract--Field-programmable gate-array (FPGA) logic synthesis and technology mapping have been studied extensively over the past 15 years. However, progress within the last few ye...
160
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
The use of genotypic populations is necessary for adaptation in Evolutionary Algorithms. We use a technique called form-invariant commutation to study the immediate effect of evol...
185
click to vote
AGP
2003
IEEE
15 years 10 months ago
2003
IEEE
Abstract. The interest in the area of non-monotonic reasoning and declarative logic programming is growing rapidly after the recent development of a number of Answer Set Programmin...