Sciweavers

322 search results - page 31 / 65
» Satisfiability Coding Lemma
Sort
View
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 7 months ago
The complexity of linear-time temporal logic over the class of ordinals
We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theore...
Stéphane Demri, Alexander Rabinovich
POPL
2002
ACM
14 years 7 months ago
Proving correctness of compiler optimizations by temporal logic
Many classical compiler optimizations can be elegantly expressed using rewrite rules of form: I = I if , where I, I are intermediate language instructions and is a property expre...
David Lacey, Neil D. Jones, Eric Van Wyk, Carl Chr...
VMCAI
2010
Springer
14 years 4 months ago
Model-Checking In-Lined Reference Monitors
Abstract. A technique for elegantly expressing In-lined Reference Monitor (IRM) certification as model-checking is presented and implemented. In-lined Reference Monitors (IRM'...
Meera Sridhar, Kevin W. Hamlen
CODES
2005
IEEE
14 years 1 months ago
Energy conscious online architecture adaptation for varying latency constraints in sensor network applications
Sensor network applications face continuously changing environments, which impose varying processing loads on the sensor node. This paper presents an online control method which a...
Sankalp Kallakuri, Alex Doboli
CODES
1996
IEEE
13 years 11 months ago
Fully Parallel Hardware/Software Codesign for Multi-Dimensional DSP Applications
The design of multi-dimensional systems using hardware/software codesign allows a significant improvement in the development cycle. This paper presents a technique that enables a ...
Michael Sheliga, Nelson L. Passos, Edwin Hsing-Mea...