366 search results - page 68 / 74 » Reasoning about relational granulation in modal logics |
110
Voted
POPL
2011
ACM
14 years 8 days ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
SIGSOFT
2006
ACM
15 years 10 months ago
2006
ACM
A method for extracting syntactic specifications from heapmanipulating code is described. The state of the heap is represented as an environment mapping each variable or field to ...
RTA
2009
Springer
15 years 4 months ago
2009
Springer
Reasoning about the knowledge of an attacker is a necessary step in many formal analyses of security protocols. In the framework of the applied pi calculus, as in similar languages...
SAC
2008
ACM
14 years 9 months ago
2008
ACM
se a new abstraction for pointer analysis that represents reads and writes to memory instead of traditional points-to relations. Compared to points-to graphs, our Assign-Fetch Gra...
ICFP
2005
ACM
15 years 9 months ago
2005
ACM
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...