Sciweavers

1712 search results - page 217 / 343
» Abstract Constraint Data Types
Sort
View
AUSAI
2007
Springer
15 years 3 months ago
Effectiveness of Methods for Syntactic and Semantic Recognition of Numeral Strings: Tradeoffs Between Number of Features and Len
Abstract. This paper describes and compares the use of methods based on Ngrams (specifically trigrams and pentagrams), together with five features, to recognise the syntactic and s...
Kyongho Min, William H. Wilson, Byeong Ho Kang
ATVA
2008
Springer
139views Hardware» more  ATVA 2008»
15 years 1 months ago
Compositional Verification for Component-Based Systems and Application
We present a compositional method for the verification of component-based systems described in a subset of the BIP language encompassing multi-party interaction without data transf...
Saddek Bensalem, Marius Bozga, Joseph Sifakis, Tha...
ATVA
2008
Springer
87views Hardware» more  ATVA 2008»
15 years 1 months ago
Goanna: Syntactic Software Model Checking
Goanna is an industrial-strength static analysis tool used in academia and industry alike to find bugs in C/C++ programs. Unlike existing approaches Goanna uses the off-the-shelf N...
Ralf Huuck, Ansgar Fehnker, Sean Seefried, Jö...
EUROPAR
2008
Springer
15 years 1 months ago
Mapping Heterogeneous Distributed Applications on Clusters
Performance of distributed applications largely depends on the mapping of their components on the underlying architecture. On one mponent-based approaches provide an abstraction su...
Sylvain Jubertie, Emmanuel Melin, Jér&eacut...
ATVA
2010
Springer
128views Hardware» more  ATVA 2010»
15 years 11 days ago
What's Decidable about Sequences?
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...
Carlo A. Furia