Sciweavers

797 search results - page 121 / 160
» Eliminating Proofs from Programs
Sort
View
TLDI
2003
ACM
135views Formal Methods» more  TLDI 2003»
15 years 8 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...
105
Voted
EICS
2009
ACM
15 years 10 months ago
Interactive usability instrumentation
Usage data logged from user interactions can be extremely valuable for evaluating software usability. However, instrumenting software to collect usage data is a time-intensive tas...
Scott Bateman, Carl Gutwin, Nathaniel Osgood, Gord...
FMCO
2007
Springer
15 years 9 months ago
Universe Types for Topology and Encapsulation
The Universe Type System is an ownership type system for object-oriented programming languages that hierarchically structures the object store; it is used to reason modularly about...
Dave Cunningham, Werner Dietl, Sophia Drossopoulou...
139
Voted
LICS
2005
IEEE
15 years 9 months ago
Uniform Distributed Synthesis
We provide a uniform solution to the problem of synthesizing a finite-state distributed system. An instance of the synthesis problem consists of a system architecture and a tempo...
Bernd Finkbeiner, Sven Schewe
ICALP
2001
Springer
15 years 8 months ago
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...
Peter Høyer, Jan Neerbek, Yaoyun Shi