Sciweavers

686 search results - page 46 / 138
» Foundations for Bidirectional Programming
Sort
View
FECS
2007
223views Education» more  FECS 2007»
14 years 11 months ago
Designing Software Engineering Option within Computer Science Bachelor of Science Program
- This paper describes a Software Engineering Option (SEO) within the current BS in Computer Science program at UMASS Dartmouth. The SE Option reuses significant portion of the exi...
Jan Bergandy, Paul L. Bergstein, Boleslaw Mikolajc...
JAIR
2008
98views more  JAIR 2008»
14 years 9 months ago
Loosely Coupled Formulations for Automated Planning: An Integer Programming Perspective
We represent planning as a set of loosely coupled network flow problems, where each network corresponds to one of the state variables in the planning domain. The network nodes cor...
Menkes Hector Louis van den Briel, Thomas Vossen, ...
88
Voted
CSFW
2012
IEEE
13 years 4 days ago
Securing Interactive Programs
Abstract—This paper studies the foundations of informationflow security for interactive programs. Previous research assumes that the environment is total, that is, it must alway...
Willard Rafnsson, Daniel Hedin, Andrei Sabelfeld
72
Voted
ESOP
2007
Springer
15 years 3 months ago
Principal Type Schemes for Modular Programs
Abstract. Two of the most prominent features of ML are its expressive module system and its support for Damas-Milner type inference. However, while the foundations of both these fe...
Derek Dreyer, Matthias Blume
AI
1998
Springer
14 years 9 months ago
What Robots Can Do: Robot Programs and Effective Achievability
In this paper, we propose a definition of goal achievability: given a basic action theory describing an initial state of the world and some primitive actions available to a robot...
Fangzhen Lin, Hector J. Levesque