Sciweavers

4340 search results - page 391 / 868
» Formal Methods and Cryptography
Sort
View
MSWIM
2006
ACM
16 years 23 days ago
Testing methodology for an ad hoc routing protocol
In this paper, we define a model of an ad hoc routing protocol, i.e. the OLSR (Optimized Link-State Routing) protocol. This model handles novel constraints related to such networ...
Stéphane Maag, Fatiha Zaïdi
AGTIVE
2007
Springer
15 years 10 months ago
Transforming Timeline Specifications into Automata for Runtime Monitoring
Abstract. In runtime monitoring, a programmer specifies code to execute whenever a sequence of events occurs during program execution. Previous and related work has shown that runt...
Eric Bodden, Hans Vangheluwe
SIGSOFT
2003
ACM
16 years 7 months ago
Policy-enforced linking of untrusted components
d Abstract) Eunyoung Lee Andrew W. Appel Department of Computer Science Princeton University {elee,appel}@cs.princeton.edu Categories and Subject Descriptors D.2.4 [Software Engine...
Eunyoung Lee, Andrew W. Appel
CAV
2009
Springer
164views Hardware» more  CAV 2009»
16 years 7 months ago
InvGen: An Efficient Invariant Generator
Abstract. In this paper we present InvGen, an automatic linear arithmetic invariant generator for imperative programs. InvGen's unique feature is in its use of dynamic analysi...
Ashutosh Gupta, Andrey Rybalchenko
CAV
2009
Springer
105views Hardware» more  CAV 2009»
16 years 7 months ago
Transactional Memory: Glimmer of a Theory
Transactional memory (TM) is a promising paradigm for concurrent programming. This paper is an overview of our recent theoretical work on defining a theory of TM. We first recall s...
Rachid Guerraoui, Michal Kapalka