290 search results - page 28 / 58 » entcs 2006 |
130
Voted
ENTCS
2006
15 years 15 days ago
2006
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
118
Voted
ENTCS
2006
15 years 15 days ago
2006
The advent of proof-carrying code has generated significant interest in reasoning about low-level languages. It is widely believed that low-level languages with jumps must be diff...
135
click to vote
ENTCS
2006
15 years 15 days ago
2006
We present a runtime verification framework for Java programs. Properties can be specified in Linear-time Temporal Logic (LTL) over AspectJ pointcuts. These properties are checked...
138
Voted
ENTCS
2006
15 years 16 days ago
2006
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...
104
Voted
ENTCS
2006
15 years 15 days ago
2006
The approaches to automatic formal verification of UML models known up to now require a finite bound on the number of objects existing at each point in time. In [4] we have observ...