129 search results - page 9 / 26 » Benchmarking Reasoners for Multi-Ontology Applications |
170
click to vote
CADE
2007
Springer
16 years 6 months ago
2007
Springer
We present an encoding that is able to specify LTL bounded model checking problems within the Bernays-Sch?onfinkel fragment of first-order logic. This fragment, which also correspo...
143
click to vote
CL
2008
Springer
15 years 6 months ago
2008
Springer
Dynamic, unanticipated adaptation of running systems is of interest in a variety of situations, ranging from functional upgrades to on-the-fly debugging or monitoring of critical ...
126
click to vote
ESOP
2010
Springer
16 years 3 months ago
2010
Springer
Abstract. We describe a symbolic heap abstraction that unifies reasoning about arrays, pointers, and scalars, and we define a fluid update operation on this symbolic heap that rela...
150
click to vote
APCCAS
2006
IEEE
15 years 12 months ago
2006
IEEE
— A data driven approach to design and optimization of low power combinational multipliers is presented. This technique depends on signal gating to avoid un-necessary computation...
158
click to vote
SAS
2005
Springer
15 years 11 months ago
2005
Springer
A technique for generating invariant polynomial inequalities of bounded degree is presented using the abstract interpretation framework. It is based on overapproximating basic semi...