Sciweavers

1050 search results - page 97 / 210
» Towards programming for the non-technical
Sort
View
POPL
2002
ACM
15 years 10 months ago
The first-order theory of subtyping constraints
We investigate the first-order theory of subtyping constraints. We show that the first-order theory of nonstructural subtyping is undecidable, and we show that in the case where a...
Zhendong Su, Alexander Aiken, Joachim Niehren, Tim...
ESOP
2001
Springer
15 years 2 months ago
Secure Information Flow and CPS
Security-typed languages enforce confidentiality or integrity policies by type checking. This paper investigates continuation-passing style (CPS) translation of such languages as ...
Steve Zdancewic, Andrew C. Myers
COMPSAC
1998
IEEE
15 years 2 months ago
A Fresh Look at Programming-in-the-Large
Realizing a shift of software engineering towards a component-based approach to software development requires the development of higher level programming systems supporting the de...
Walter Cazzola, Andrea Savigni, Andrea Sosio, Fran...
CADE
2007
Springer
15 years 10 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard
ECOOP
2007
Springer
15 years 4 months ago
Towards correct evolution of components using VPA-based aspects
Abstract. Interaction protocols are a popular means to construct correct component-based systems. Aspects that modify such protocols are interesting in this context because they su...
Dong Ha Nguyen, Mario Südholt