1818 search results - page 342 / 364 » Granularity-Adaptive Proof Presentation |
127
click to vote
CCS
2000
ACM
15 years 7 months ago
2000
ACM
We consider compositional properties of reactive systems that are secure in a cryptographic sense. We follow the wellknown simulatability approach, i.e., the specification is an ...
122
click to vote
ECAI
2000
Springer
15 years 7 months ago
2000
Springer
Real-time search has two aspects, one as an efficient search method (in a single problem solving trial), and the other as an overall problem solving architecture with learning abi...
129
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
: Given a logical topology and a physical topology , the survivable logical topology design problem in an IP-overWDM optical network is to map the logical links into lightpaths in ...
152
click to vote
ESOP
2009
Springer
15 years 10 months ago
2009
Springer
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
158
Voted
SIGSOFT
2007
ACM
16 years 4 months ago
2007
ACM
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...