255 search results - page 37 / 51 » Proving BDI Properties of Agent-Oriented Programming Languag... |
147
click to vote
ESOP
2008
Springer
15 years 7 months ago
2008
Springer
In this work we address the problem of proving, by static analysis means, that allocating and deallocating regions in the store provides a safe way to achieve memory management. Th...
153
click to vote
CSFW
1999
IEEE
15 years 10 months ago
1999
IEEE
Software systems are becoming heterogeneous: instead of a small number of large programs from well-established sources, a user's desktop may now consist of many smaller compo...
164
click to vote
ICLP
2005
Springer
15 years 11 months ago
2005
Springer
We present a methodology for the modeling of complex program behavior in CLP. In the first part we present an informal description about how to represent a system in CLP. At its ...
249
click to vote
POPL
2011
ACM
14 years 8 months ago
2011
ACM
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
143
Voted
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...