Sciweavers

2713 search results - page 15 / 543
» Parameterized Tree Systems
Sort
View
JSC
2010
100views more  JSC 2010»
13 years 4 months ago
An invariant-based approach to the verification of asynchronous parameterized networks
A uniform verification problem for parameterized systems is to determine whether a temporal property is satisfied for every instance of the system which is composed of an arbitrar...
Igor V. Konnov, Vladimir A. Zakharov
MST
2011
191views Hardware» more  MST 2011»
13 years 4 months ago
Vertex Cover Problem Parameterized Above and Below Tight Bounds
Abstract. We study the well-known Vertex Cover problem parameterized above and below tight bounds. We show that two of the parameterizations (both were suggested by Mahajan, Raman ...
Gregory Gutin, Eun Jung Kim, Michael Lampis, Valia...
FORTE
2009
13 years 7 months ago
Approximated Context-Sensitive Analysis for Parameterized Verification
Abstract. We propose a verification method for parameterized systems with global conditions. The method is based on context-sensitive constraints, a symbolic representation of infi...
Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezin...
VMCAI
2004
Springer
14 years 3 months ago
Type Inference for Parameterized Race-Free Java
Abstract. We study the type system introduced by Boyapati and Rinard in their paper “A Parameterized Type System for Race-Free Java Programs” and try to infer the type annotati...
Rahul Agarwal, Scott D. Stoller
GECCO
2004
Springer
14 years 3 months ago
Shortcomings with Tree-Structured Edge Encodings for Neural Networks
In evolutionary algorithms a common method for encoding neural networks is to use a tree-structured assembly procedure for constructing them. Since node operators have difficulties...
Gregory Hornby