Sciweavers

3228 search results - page 584 / 646
» Computationally Sound Proofs
Sort
View
POPL
2008
ACM
14 years 9 months ago
High-level small-step operational semantics for transactions
Software transactions have received significant attention as a way to simplify shared-memory concurrent programming, but insufficient focus has been given to the precise meaning o...
Katherine F. Moore, Dan Grossman
POPL
2005
ACM
14 years 9 months ago
Precise interprocedural analysis using random interpretation
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...
Sumit Gulwani, George C. Necula
CADE
2006
Springer
14 years 9 months ago
CEL - A Polynomial-Time Reasoner for Life Science Ontologies
CEL (Classifier for EL) is a reasoner for the small description logic EL+ which can be used to compute the subsumption hierarchy induced by EL+ ontologies. The most distinguishing ...
Franz Baader, Carsten Lutz, Boontawee Suntisrivara...
ICFP
2008
ACM
14 years 8 months ago
Transactional events for ML
Transactional events (TE) are an approach to concurrent programming that enriches the first-class synchronous message-passing of Concurrent ML (CML) with a combinator that allows ...
Laura Effinger-Dean, Matthew Kehrt, Dan Grossman
HRI
2010
ACM
14 years 3 months ago
Validating interaction patterns in HRI
— In recent work, “interaction patterns” have been proposed as a means to characterize essential features of humanrobot interaction. A problem arises, however, in knowing whe...
Peter H. Kahn Jr., Brian T. Gill, Aimee L. Reicher...