Sciweavers

1901 search results - page 212 / 381
» Predicting Program Properties from
Sort
View
ENTCS
2002
134views more  ENTCS 2002»
15 years 3 months ago
Implementing Compositional Analysis Using Intersection Types With Expansion Variables
A program analysis is compositional when the analysis result for a particular program fragment is obtained solely from the results for its immediate subfragments via some composit...
Assaf J. Kfoury, Geoffrey Washburn, Joe Wells
CHI
2005
ACM
16 years 3 months ago
Programmatic semantics for natural language interfaces
An important way of making interfaces usable by nonexpert users is to enable the use of natural language input, as in natural language query interfaces to databases, or MUDs and M...
Hugo Liu, Henry Lieberman
VL
2009
IEEE
150views Visual Languages» more  VL 2009»
15 years 10 months ago
Discovery-based edit assistance for spreadsheets
Spreadsheets can be viewed as a highly flexible endusers programming environment which enjoys wide-spread adoption. But spreadsheets lack many of the structured programming conce...
Jácome Cunha, João Saraiva, Joost Vi...
ICRA
2007
IEEE
163views Robotics» more  ICRA 2007»
15 years 9 months ago
Implementing a Control System Framework for Automatic Generation of Manufacturing Cell Controllers
— Quickly adapting the manufacturing system to the production of new or modified products is critical for manufacturers in order to stay competitive. For flexible manufacturing...
Oscar Ljungkrantz, Knut Akesson, Johan Richardsson...
135
Voted
PROVSEC
2007
Springer
15 years 9 months ago
Formal Proof of Provable Security by Game-Playing in a Proof Assistant
Game-playing is an approach to write security proofs that are easy to verify. In this approach, security definitions and intractable problems are written as programs called games ...
Reynald Affeldt, Miki Tanaka, Nicolas Marti