Sciweavers

102 search results - page 8 / 21
» Terminator: Beyond Safety
Sort
View
CAV
2006
Springer
133views Hardware» more  CAV 2006»
13 years 11 months ago
Programs with Lists Are Counter Automata
Abstract. We address the verification problem of programs manipulating oneselector linked data structures. We propose a new automated approach for checking safety and termination f...
Ahmed Bouajjani, Marius Bozga, Peter Habermehl, Ra...
LICS
2012
IEEE
11 years 10 months ago
The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...
Serge Haddad, Sylvain Schmitz, Philippe Schnoebele...
OSDI
1996
ACM
13 years 9 months ago
Safe Kernel Extensions Without Run-Time Checking
This paper describes a mechanism by which an operating system kernel can determine with certainty that it is safe to execute a binary supplied by an untrusted source. The kernel r...
George C. Necula, Peter Lee
AICT
2006
IEEE
111views Communications» more  AICT 2006»
14 years 1 months ago
Mobile Web Service Provisioning
This paper, discusses the feasibility of mobile Web Service provisioning from Smart Phones, confluencing two major recent trends in distributed information systems engineering: th...
Satish Narayana Srirama, Matthias Jarke, Wolfgang ...
SAC
2006
ACM
13 years 7 months ago
Design and implementation of a context-aware decision algorithm for heterogeneous networks
Wireless networks and mobile terminals are evolving towards being heterogeneous. In this environment, intelligent handover decision, beyond traditional ones that are based on only...
Tansir Ahmed, Kyandoghere Kyamakya, Markus Ludwig