Sciweavers

1286 search results - page 45 / 258
» From System F to Typed Assembly Language
Sort
View
TLDI
2005
ACM
126views Formal Methods» more  TLDI 2005»
14 years 1 months ago
Type inference for atomicity
Atomicity is a fundamental correctness property in multithreaded programs. This paper presents an algorithm for verifying atomicity via type inference. The underlying type system ...
Cormac Flanagan, Stephen N. Freund, Marina Lifshin
WCE
2007
13 years 8 months ago
An Intelligent Conversational Agent Approach to Extracting Queries from Natural Language
—This paper is concerned with the application of a conversational agent and expert system to provide a natural language interface to a database. Typically, natural language datab...
Karen Pudner, Keeley A. Crockett, Zuhair Bandar
AAAI
2007
13 years 10 months ago
Learning Language Semantics from Ambiguous Supervision
This paper presents a method for learning a semantic parser from ambiguous supervision. Training data consists of natural language sentences annotated with multiple potential mean...
Rohit J. Kate, Raymond J. Mooney
TLDI
2003
ACM
110views Formal Methods» more  TLDI 2003»
14 years 27 days ago
Type-safe multithreading in cyclone
We extend Cyclone, a type-safe polymorphic language at vel of abstraction, with threads and locks. Data races can violate type safety in Cyclone. An extended type system staticall...
Dan Grossman
CSFW
1997
IEEE
13 years 12 months ago
Eliminating Covert Flows with Minimum Typings
A type system is given that eliminates two kinds of covert flows in an imperative programming language. The first kind arises from nontermination and the other from partial oper...
Dennis M. Volpano, Geoffrey Smith