255 search results - page 33 / 51 » Proving BDI Properties of Agent-Oriented Programming Languag... |
166
click to vote
SP
2009
IEEE
16 years 21 days ago
2009
IEEE
We present a logic for reasoning about properties of secure systems. The logic is built around a concurrent programming language with constructs for modeling machines with shared ...
159
click to vote
ICTAC
2004
Springer
15 years 11 months ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
188
click to vote
ICALP
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...
139
click to vote
TACAS
2007
Springer
16 years 2 days ago
2007
Springer
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...
173
click to vote
CC
2003
Springer
15 years 11 months ago
2003
Springer
Popular mobile code architectures (Java and .NET) include verifiers to check for memory safety and other security properties. Since their formats are relatively high level, suppor...