9842 search results - page 590 / 1969 » Compositional timing analysis |
199
click to vote
FOSSACS
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. The reachability analysis of recursive programs that communicate asynchronously over reliable Fifo channels calls for restrictions to ensure decidability. We extend here ...
192
click to vote
CIBCB
2008
IEEE
16 years 1 months ago
2008
IEEE
— We introduce a graph-based relational learning approach using graph-rewriting rules for temporal and structural analysis of biological networks changing over time. The analysis...
212
click to vote
IWPSE
2007
IEEE
16 years 1 months ago
2007
IEEE
Software systems need to change over time to cope with new requirements, and due to design decisions, the changes happen to crosscut the system’s structure. Understanding how ch...
162
click to vote
DATE
2005
IEEE
16 years 24 days ago
2005
IEEE
It is a hot research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. The BFL algorithm is the most effective counterexample minimi...
218
click to vote
APLAS
2005
ACM
16 years 22 days ago
2005
ACM
Many problems in program analysis can be expressed naturally and concisely in a declarative language like Datalog. This makes it easy to specify new analyses or extend or compose e...