Sciweavers

2490 search results - page 301 / 498
» Complexity of Contextual Reasoning
Sort
View
CAV
2009
Springer
209views Hardware» more  CAV 2009»
16 years 5 months ago
Static and Precise Detection of Concurrency Errors in Systems Code Using SMT Solvers
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
Shuvendu K. Lahiri, Shaz Qadeer, Zvonimir Rakamari...
OSDI
2004
ACM
16 years 4 months ago
FFPF: Fairly Fast Packet Filters
FFPF is a network monitoring framework designed for three things: speed (handling high link rates), scalability (ability to handle multiple applications) and flexibility. Multiple...
Herbert Bos, Willem de Bruijn, Mihai-Lucian Criste...
ICSE
2008
IEEE-ACM
16 years 4 months ago
FeatureMapper: mapping features to models
Variability modelling with feature models is one key technique for specifying the problem space of Software Product Lines (SPLs). To allow for the automatic derivation of a concre...
Florian Heidenreich, Jan Kopcsek, Christian Wende
151
Voted
ICFP
2008
ACM
16 years 4 months ago
From ML to MLF: graphic type constraints with efficient type inference
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
Boris Yakobowski, Didier Rémy
IAT
2009
IEEE
15 years 11 months ago
Simulating BDI-Based Wireless Sensor Networks
—“Autonomic systems” merge advancements in the field of multi-agent software design, dynamic analysis, and decentralized control in order to assist designers in constructing...
Alexis Morris, Paolo Giorgini, Sameh Abdel-Naby