Sciweavers

84 search results - page 7 / 17
» An Imperative Extension to Alloy
Sort
View
POPL
2012
ACM
13 years 5 months ago
Recursive proofs for inductive tree data-structures
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...
Parthasarathy Madhusudan, Xiaokang Qiu, Andrei Ste...
71
Voted
ENTCS
2000
154views more  ENTCS 2000»
14 years 9 months ago
Debugging Haskell by Observing Intermediate Data Structures
Haskell has long needed a debugger. Although there has been much research into the topic of debugging lazy functional programs, no robust tool has yet come from the Haskell commun...
Andy Gill
ENTCS
2002
127views more  ENTCS 2002»
14 years 9 months ago
A Calculus for "Environment-Aware" Computation
We present a calculus for modelling "environment-aware" computations, that is computations that adapt their behaviour according to the capabilities of the environment. T...
Viviana Bono, Ferruccio Damiani, Paola Giannini
TOOLS
2010
IEEE
15 years 2 months ago
Welterweight Java
This paper presents Welterweight Java (WJ), a new minimal core Java calculus intended to be a suitable starting point for investigations in the semantics of Java-like programs. To ...
Johan Östlund, Tobias Wrigstad
ENTCS
2008
109views more  ENTCS 2008»
14 years 9 months ago
Separation Logic for Multiple Inheritance
As an extension to Floyd-Hoare logic, separation logic has been used to facilitate reasoning about imperative programs manipulating shared mutable data structures. Recently, it ha...
Chenguang Luo, Shengchao Qin