Sciweavers

597 search results - page 84 / 120
» Semantics for Dynamic Logic Programming: A Principle-Based A...
Sort
View
PLDI
2009
ACM
14 years 2 months ago
Snugglebug: a powerful approach to weakest preconditions
Symbolic analysis shows promise as a foundation for bug-finding, specification inference, verification, and test generation. This paper addresses demand-driven symbolic analysi...
Satish Chandra, Stephen J. Fink, Manu Sridharan
ARGMAS
2004
Springer
14 years 1 months ago
Negotiation Among DDeLP Agents
Negotiation can be conceived as the exchange of messages among self-interested agents in order to settle on an agreement over a given issue. They decide which messages to send acco...
Fernando A. Tohmé, Guillermo Ricardo Simari
JFP
2008
72views more  JFP 2008»
13 years 7 months ago
Dynamic rebinding for marshalling and update, via redex-time and destruct-time reduction
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
Peter Sewell, Gareth Stoyle, Michael Hicks, Gavin ...
POPL
2009
ACM
14 years 8 months ago
A combination framework for tracking partition sizes
ibe an abstract interpretation based framework for proving relationships between sizes of memory partitions. Instances of this framework can prove traditional properties such as m...
Sumit Gulwani, Tal Lev-Ami, Mooly Sagiv
CORR
2000
Springer
110views Education» more  CORR 2000»
13 years 7 months ago
Efficient probabilistic top-down and left-corner parsing
This paper examines efficient predictive broadcoverage parsing without dynamic programming. In contrast to bottom-up methods, depth-first top-down parsing produces partial parses ...
Brian Roark, Mark Johnson