Sciweavers

4513 search results - page 551 / 903
» Logic programming with satisfiability
Sort
View
ICSE
2003
IEEE-ACM
16 years 4 months ago
Modular Verification of Software Components in C
We present a new methodology for automatic verification of C programs against finite state machine specifications. Our approach is compositional, naturally enabling us to decompos...
Sagar Chaki, Edmund M. Clarke, Alex Groce, Somesh ...
FM
2009
Springer
92views Formal Methods» more  FM 2009»
15 years 11 months ago
Field-Sensitive Value Analysis by Field-Insensitive Analysis
Shared and mutable data-structures pose major problems in static analysis and most analyzers are unable to keep track of the values of numeric variables stored in the heap. In this...
Elvira Albert, Puri Arenas, Samir Genaim, Germ&aac...
DATE
2008
IEEE
182views Hardware» more  DATE 2008»
15 years 11 months ago
An adaptable FPGA-based System for Regular Expression Matching
In many applications string pattern matching is one of the most intensive tasks in terms of computation time and memory accesses. Network Intrusion Detection Systems and DNA Seque...
Ivano Bonesana, Marco Paolieri, Marco D. Santambro...
ISER
2004
Springer
108views Robotics» more  ISER 2004»
15 years 10 months ago
The SDR Experience: Experiments with a Large-Scale Heterogeneous Mobile Robot Team
This paper reports on experiments conducted as part of the DARPA SDR (Software for Distributed Robotics) program. The core challenge for this program is to develop a system capable...
Andrew Howard, Lynne E. Parker, Gaurav S. Sukhatme
QSIC
2003
IEEE
15 years 10 months ago
A Note on Test Oracles and Semantics of Algebraic Specifications
Algebraic testing is an automated software testing method based on algebraic formal specifications. It tests if a program correctly implements an algebraic specification by checki...
Hong Zhu