Sciweavers

3591 search results - page 101 / 719
» Typing linear constraints
Sort
View
TACAS
2007
Springer
125views Algorithms» more  TACAS 2007»
15 years 4 months ago
Type-Dependence Analysis and Program Transformation for Symbolic Execution
Symbolic execution can be problematic when applied to real applications. This paper addresses two of these problems: (1) the constraints generated during symbolic execution may be ...
Saswat Anand, Alessandro Orso, Mary Jean Harrold
CIE
2005
Springer
14 years 12 months ago
Domain-Theoretic Formulation of Linear Boundary Value Problems
Abstract. We present a domain theoretic framework for obtaining exact solutions of linear boundary value problems. Based on the domain of compact real intervals, we show how to app...
Dirk Pattinson
CALCO
2011
Springer
225views Mathematics» more  CALCO 2011»
13 years 10 months ago
Linearly-Used State in Models of Call-by-Value
Abstract. We investigate the phenomenon that every monad is a linear state monad. We do this by studying a fully-complete state-passing translation from an impure call-by-value lan...
Rasmus Ejlers Møgelberg, Sam Staton
JLP
2007
74views more  JLP 2007»
14 years 9 months ago
Linearity and bisimulation
Exploiting linear type structure, we introduce a new theory bisimilarity for the π-calculus in which we abstract away not only τ-actions but also non-τ actions which do not aff...
Nobuko Yoshida, Kohei Honda, Martin Berger
WICSA
2008
14 years 11 months ago
Using Types to Enforce Architectural Structure
The right software architecture is critical to achieving essential quality attributes, but these qualities are only realized if the program as implemented conforms to its intended...
Jonathan Aldrich