Sciweavers

1445 search results - page 61 / 289
» Abstract Interpretation of Logic Programs
Sort
View
VMCAI
2009
Springer
16 years 22 days ago
Thread-Modular Shape Analysis
We present the first shape analysis for multithreaded programs that avoids the explicit enumeration of execution-interleavings. Our approach is to automatically infer a resource ...
Alexey Gotsman, Josh Berdine, Byron Cook, Mooly Sa...
DALT
2003
Springer
15 years 11 months ago
Extending the Operational Semantics of a BDI Agent-Oriented Programming Language for Introducing Speech-Act Based Communication
Work on agent communication languages has since long striven to achieve adequate speech act semantics; partly, the problem is that references to an agent’s architecture (in parti...
Álvaro F. Moreira, Renata Vieira, Rafael H....
CSFW
2000
IEEE
15 years 10 months ago
Local Names in SPKI/SDSI
We analyze the notion of “local names” in SPKI/SDSI. By interpreting local names as distributed groups, we develop a simple logic program for SPKI/SDSI’s linked localname sc...
Ninghui Li
APLAS
2007
ACM
15 years 10 months ago
Call-by-Name and Call-by-Value in Normal Modal Logic
Abstract. This paper provides a call-by-name and a call-by-value calculus, both of which have a Curry-Howard correspondence to the minimal normal logic K. The calculi are extension...
Yoshihiko Kakutani
TLDI
2003
ACM
135views Formal Methods» more  TLDI 2003»
15 years 11 months ago
Typed compilation of recursive datatypes
Standard ML employs an opaque (or generative) semantics of datatypes, in which every datatype declaration produces a new type that is different from any other type, including othe...
Joseph Vanderwaart, Derek Dreyer, Leaf Petersen, K...