Sciweavers

SAS
2000
Springer
13 years 11 months ago
Tree Schemata and Fair Termination
We present a new representation for possibly infinite sets of possibly infinite trees. This representation makes extensive use of sharing to achieve efficiency. As much as possible...
Laurent Mauborgne
SAS
2000
Springer
149views Formal Methods» more  SAS 2000»
13 years 11 months ago
FULLDOC: A Full Reporting Debugger for Optimized Code
As compilers increasingly rely on optimizations to achieve high performance, the effectiveness of source level debuggers for optimized code continues to falter. Even if values of s...
Clara Jaramillo, Rajiv Gupta, Mary Lou Soffa
SAS
2000
Springer
13 years 11 months ago
Enforcing Design Constraints with Object Logic
Design constraints express essential behavioural properties of a software system. Two key elements of a scheme for enforcing design constraints are presented: a logic for describin...
Daniel Jackson
SAS
2000
Springer
13 years 11 months ago
Polymorphic versus Monomorphic Flow-Insensitive Points-to Analysis for C
Abstract We carry out an experimental analysis for two of the design dimensions of flow-insensitive points-to analysis for C: polymorphic versus monomorphic and equality-based vers...
Jeffrey S. Foster, Manuel Fähndrich, Alexande...
SAS
2000
Springer
13 years 11 months ago
Unified Analysis of Array and Object References in Strongly Typed Languages
Stephen J. Fink, Kathleen Knobe, Vivek Sarkar
SAS
2000
Springer
13 years 11 months ago
A Transformational Approach for Generating Non-linear Invariants
Computing invariants is the key issue in the analysis of infinite-state systems whether analysis means testing, verification or parameter synthesis. In particular, methods that all...
Saddek Bensalem, Marius Bozga, Jean-Claude Fernand...
AFP
1995
Springer
128views Formal Methods» more  AFP 1995»
13 years 11 months ago
Monads for Functional Programming
Abstract. The use of monads to structure functional programs is described. Monads provide a convenient framework for simulating effects found in other languages, such as global st...
Philip Wadler
AFP
1995
Springer
125views Formal Methods» more  AFP 1995»
13 years 11 months ago
Merging Monads and Folds for Functional Programming
Abstract. These notes discuss the simultaneous use of generalised fold operators and monads to structure functional programs. Generalised fold operators structure programs after th...
Erik Meijer, Johan Jeuring
AFP
1995
Springer
126views Formal Methods» more  AFP 1995»
13 years 11 months ago
Functional Programming with Overloading and Higher-Order Polymorphism
The Hindley/Milner type system has been widely adopted as a basis for statically typed functional languages. One of the main reasons for this is that it provides an elegant comprom...
Mark P. Jones
ARTS
1997
Springer
13 years 11 months ago
The Verus Language: Representing Time Efficiently with BDDs
There have been significant advances on formal methods to verify complex systems recently. Nevertheless, these methods have not yet been accepted as a realistic alternative to the ...
Sérgio Vale Aguiar Campos, Edmund M. Clarke