1796 search results - page 269 / 360 » An Approach to Compositional Model Checking |
STACS
2001
Springer
14 years 17 days ago
2001
Springer
Using an automata-theoretic approach, we investigate the decidability of liveness properties (called Presburger liveness properties) for timed automata when Presburger formulas on ...
CSFW
2009
IEEE
14 years 2 days ago
2009
IEEE
We present the design and implementation of a compiler that, given high-level multiparty session descriptions, generates custom cryptographic protocols. Our sessions specify pre-a...
APLAS
2008
ACM
13 years 10 months ago
2008
ACM
Abstract. Symbolic execution is a flexible and powerful, but computationally expensive technique to detect dynamic behaviors of a program. In this paper, we present a context-sensi...
CORR
2004
Springer
13 years 8 months ago
2004
Springer
We study codes on graphs combined with an iterative message passing algorithm for quantization. Specifically, we consider the binary erasure quantization (BEQ) problem which is th...
TCAD
2010
13 years 2 months ago
2010
The growing complexity of systems and their implementation into silicon encourages designers to look for model designs at higher levels of abstraction and then incrementally build ...