Sciweavers

290 search results - page 28 / 58
» entcs 2006
Sort
View
104
Voted
ENTCS
2006
134views more  ENTCS 2006»
14 years 10 months ago
Computing Over-Approximations with Bounded Model Checking
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 ...
Daniel Kroening
ENTCS
2006
133views more  ENTCS 2006»
14 years 10 months ago
A Compositional Natural Semantics and Hoare Logic for Low-Level Languages
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...
Ando Saabas, Tarmo Uustalu
111
Voted
ENTCS
2006
120views more  ENTCS 2006»
14 years 10 months ago
Temporal Assertions using AspectJ
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...
Volker Stolz, Eric Bodden
114
Voted
ENTCS
2006
113views more  ENTCS 2006»
14 years 10 months ago
A Large-Scale Experiment in Executing Extracted Programs
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...
Luís Cruz-Filipe, Pierre Letouzey
ENTCS
2006
130views more  ENTCS 2006»
14 years 10 months ago
LSC Verification for UML Models with Unbounded Creation and Destruction
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...
Bernd Westphal