Sciweavers

2976 search results - page 215 / 596
» On the bounded integer programming
Sort
View
MEMOCODE
2003
IEEE
15 years 11 months ago
Exact Runtime Analysis Using Automata-Based Symbolic Simulation
In this paper, we present a technique for determining tight bounds on the execution time of assembler programs. Thus, our method is independent of the design flow, but takes into...
Tobias Schüle, Klaus Schneider
ESOP
2003
Springer
15 years 11 months ago
Requirements on the Execution of Kahn Process Networks
Kahn process networks (KPNs) are a programming paradigm suitable for streaming-based multimedia and signal-processing applications. We discuss the execution of KPNs, and the criter...
Marc Geilen, Twan Basten
CORR
2006
Springer
91views Education» more  CORR 2006»
15 years 6 months ago
Quasi-friendly sup-interpretations
In a previous paper [16], the sup-interpretation method was proposed as a new tool to control memory resources of first order functional programs with pattern matching by static an...
Jean-Yves Marion, Romain Péchoux
RTSS
1999
IEEE
15 years 10 months ago
A Scalable Solution to the Multi-Resource QoS Problem
The problem of maximizing system utility by allocating a single finite resource to satisfy discrete Quality of Service (QoS) requirements of multiple applications along multiple Q...
Chen Lee, John P. Lehoczky, Daniel P. Siewiorek, R...
IH
2007
Springer
16 years 19 days ago
Software Integrity Checking Expressions (ICEs) for Robust Tamper Detection
Abstract. We introduce software integrity checking expressions (SoftICEs), which are program predicates that can be used in software tamper detection. We present two candidates, pr...
Mariusz H. Jakubowski, Prasad Naldurg, Vijay Patan...