Sciweavers

375 search results - page 27 / 75
» Declarative Reasoning about the Structure of Object-Oriented...
Sort
View
ATAL
2009
Springer
14 years 2 months ago
Reasoning intra-dependency in commitments for robust scheduling
Commitment-modeled protocols enable flexible and robust interactions among agents. However, existing work has focused on features and capabilities of protocols without considerin...
Mingzhong Wang, Kotagiri Ramamohanarao, Jinjun Che...
TACAS
2007
Springer
103views Algorithms» more  TACAS 2007»
14 years 1 months ago
A Reachability Predicate for Analyzing Low-Level Software
Reasoning about heap-allocated data structures such as linked lists and arrays is challenging. The reachability predicate has proved to be useful for reasoning about the heap in ty...
Shaunak Chatterjee, Shuvendu K. Lahiri, Shaz Qadee...
PEPM
2009
ACM
14 years 4 months ago
Bidirectional data-flow analyses, type-systematically
We show that a wide class of bidirectional data-flow analyses and program optimizations based on them admit declarative descriptions in the form of type systems. The salient feat...
Maria João Frade, Ando Saabas, Tarmo Uustal...
CSFW
2007
IEEE
14 years 2 months ago
Secure Implementations for Typed Session Abstractions
mplementations for Typed Session Abstractions Ricardo Corin1,2,3 Pierre-Malo Deni´elou1,2 C´edric Fournet1,2 Karthikeyan Bhargavan1,2 James Leifer1 1 MSR-INRIA Joint Centre 2 Mic...
Ricardo Corin, Pierre-Malo Deniélou, C&eacu...
JAPLL
2007
88views more  JAPLL 2007»
13 years 7 months ago
Some comments on history based structures
History based models, introduced by Parikh and Ramanujam, provide a natural mathematical model of social interactive situations. These models offer a ”low level” description ...
Eric Pacuit