77 search results - page 8 / 16 » On expressiveness of the chain graph interpretations |
160
click to vote
TLCA
2005
Springer
15 years 12 months ago
2005
Springer
We explore foundational typing support for strong updates — updating a memory cell to hold values of unrelated types at different points in time. We present a simple, but expres...
122
click to vote
AGP
1999
IEEE
15 years 10 months ago
1999
IEEE
Domains Decomposing Non-Redundant Sharing by Complementation . . . . . . . . . . . . . 69 Enea Zaffanella, Patricia M. Hill, Roberto Bagnara Freeness Analysis Through Linear Refine...
148
click to vote
AUTOMATICA
2007
15 years 6 months ago
2007
This paper is devoted to the generic observability analysis for structured bilinear systems using a graph-theoretic approach. On the basis of a digraph representation, we express ...
149
click to vote
WEBI
2009
Springer
16 years 29 days ago
2009
Springer
The World Wide Web has transformed into an environment where users both produce and consume information. In order to judge the validity of information, it is important to know how...
205
click to vote
ATVA
2011
Springer
14 years 6 months ago
2011
Springer
We present the Self-Loop Aggregation Product (SLAP), a new hybrid technique that replaces the synchronized product used in the automata-theoretic approach for LTL model checking. T...