Sciweavers

411 search results - page 3 / 83
» Algebraic Imperative Specifications
Sort
View
ICFP
2008
ACM
15 years 11 months ago
Functional translation of a calculus of capabilities
Reasoning about imperative programs requires the ability to track aliasing and ownership properties. We present a type system that provides this ability, by using regions, capabil...
Arthur Charguéraud, François Pottier
FLOPS
2004
Springer
15 years 5 months ago
Relaxing the Value Restriction
Restricting polymorphism to values is now the standard way to obtain soundness in ML-like programming languages with imperative features. While this solution has undeniable advant...
Jacques Garrigue
CSR
2008
Springer
15 years 1 months ago
Invariant Generation for P-Solvable Loops with Assignments
We discuss interesting properties of a general technique for inferring polynomial invariants for a subfamily of imperative loops, called the P-solvable loops, with assignments only...
Laura Kovács
ENTCS
2008
120views more  ENTCS 2008»
14 years 11 months ago
Specifying and Executing Reactive Scenarios With Lutin
This paper presents the language Lutin and its operational semantics. This language specifically targets the domain of reactive systems, where an execution is a (virtually) infini...
Pascal Raymond, Yvan Roux, Erwan Jahier
TOCL
2002
110views more  TOCL 2002»
14 years 11 months ago
Abstract computability and algebraic specification
Computability and Algebraic Specification J. V. TUCKER University of Wales, Swansea and J. I. ZUCKER McMaster University Abstract computable functions are defined by abstract finit...
J. V. Tucker, Jeffery I. Zucker