Sciweavers

1826 search results - page 303 / 366
» Using Random Forests in the Structured Language Model
Sort
View
PLDI
2009
ACM
15 years 4 months ago
Laminar: practical fine-grained decentralized information flow control
Decentralized information flow control (DIFC) is a promising model for writing programs with powerful, end-to-end security guarantees. Current DIFC systems that run on commodity ...
Indrajit Roy, Donald E. Porter, Michael D. Bond, K...
POPL
2010
ACM
15 years 7 months ago
Dependent Types from Counterexamples
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
Tachio Terauchi
HASKELL
2009
ACM
15 years 4 months ago
A compositional theory for STM Haskell
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
Johannes Borgström, Karthikeyan Bhargavan, An...
VMCAI
2010
Springer
15 years 7 months ago
Shape Analysis with Reference Set Relations
Tracking subset relations between the contents containers on the heap is fundamental to modeling the semantics of many common programing idioms such as applying a function to a sub...
Mark Marron, Rupak Majumdar, Darko Stefanovic, Dee...
IJCAI
2001
14 years 11 months ago
CAST: Collaborative Agents for Simulating Teamwork
Psychological studies on teamwork have shown that an effective team often can anticipate information needs of teammates based on a shared mental model. Existing multi-agent models...
John Yen, Jianwen Yin, Thomas R. Ioerger, Michael ...