525 search results - page 63 / 105 » Using Checkable Types in Automatic Protocol Analysis |
ICCAD
2002
IEEE
14 years 5 months ago
2002
IEEE
This paper presents a way of encoding some kinds of dynamic reconfiguration behaviour in the interface portion of circuit descriptions. This has many advantages. The user of a rec...
PLDI
2009
ACM
14 years 9 months ago
2009
ACM
As computer systems continue to become more powerful and comdo programs. High-level abstractions introduced to deal with complexity in large programs, while simplifying human reas...
JSAC
2008
13 years 9 months ago
2008
If a network is to operate successfully, its users need to collaborate. Collaboration takes the form of following a network protocol and involves some resource expenditure on the p...
NFM
2011
13 years 3 months ago
2011
Abstract. We present a new open source model checker, opaal, for automatic verification of models using lattice automata. Lattice automata allow the users to incorporate abstracti...
POPL
2003
ACM
14 years 9 months ago
2003
ACM
We show how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs. The analysis takes space reuse by explicit deallocation ...