Sciweavers

1855 search results - page 137 / 371
» Composing model programs for analysis
Sort
View
ENTCS
2010
88views more  ENTCS 2010»
15 years 22 days ago
Range and Set Abstraction using SAT
d Set Abstraction using SAT Edd Barrett Andy King School of Computing, University of Kent, CT2 7NF, UK Symbolic decision trees are not the only way to correlate the relationship b...
Edd Barrett, Andy King
CLUSTER
2003
IEEE
15 years 8 months ago
Performance Analysis of Java Message-Passing Libraries on Fast Ethernet, Myrinet and SCI Clusters
The use of Java for parallel programming on clusters according to the message-passing paradigm is an attractive choice. In this case, the overall application performance will larg...
Guillermo L. Taboada, Juan Touriño, Ramon D...
139
Voted
SIGSOFT
2008
ACM
16 years 4 months ago
Modular verification of web services using efficient symbolic encoding and summarization
We propose a novel method for modular verification of web service compositions. We first use symbolic fixpoint computations to derive conditions on the incoming messages and relat...
Fang Yu, Chao Wang, Aarti Gupta, Tevfik Bultan
ICALP
2010
Springer
15 years 8 months ago
Compositionality in Graph Transformation
Graph transformation works under a whole-world assumption. In modelling realistic systems, this typically makes for large graphs and sometimes also large, hard to understand rules....
Arend Rensink
ENTCS
2002
78views more  ENTCS 2002»
15 years 3 months ago
Slicing Synchronous Reactive Programs
This paper extends the well-known technique of slicing to synchronous reactive programs. Synchronous languages exemplified by Esterel, Lustre, Signal and Argos, novel model of exe...
Vinod Ganapathy, S. Ramesh