Sciweavers

408 search results - page 31 / 82
» Relation Algebras for Reasoning about Time and Space
Sort
View
ESOP
2008
Springer
13 years 10 months ago
Inferring Channel Buffer Bounds Via Linear Programming
We present a static analysis for inferring the maximum amount of buffer space used by a program consisting of concurrently running processes communicating via buffered channels. We...
Tachio Terauchi, Adam Megacz
ATVA
2007
Springer
87views Hardware» more  ATVA 2007»
14 years 3 months ago
Latticed Simulation Relations and Games
Multi-valued Kripke structures are Kripke structures in which the atomic propositions and the transitions are not Boolean and can take values from some set. In particular, latticed...
Orna Kupferman, Yoad Lustig
JLP
2007
91views more  JLP 2007»
13 years 8 months ago
Non-bisimulation-based Markovian behavioral equivalences
The behavioral equivalence that is typically used to relate Markovian process terms and to reduce their underlying state spaces is Markovian bisimilarity. One of the reasons is th...
Marco Bernardo
SAC
2008
ACM
13 years 8 months ago
Removing useless variables in cost analysis of Java bytecode
Automatic cost analysis has interesting applications in the context of verification and certification of mobile code. For instance, the code receiver can use cost information in o...
Elvira Albert, Puri Arenas, Samir Genaim, Germ&aac...
CBMS
2007
IEEE
14 years 3 months ago
Managing Conceptual Revisions in a Temporal Fungal Taxonomy
Representing and Reasoning about time and change is one of the primary issues in the area of Artificial Intelligence (AI) and Knowledge Representation (KR). Despite the importance...
Arash Shaban-Nejad, Volker Haarslev