Sciweavers

1023 search results - page 97 / 205
» A Formal Method for Program Slicing
Sort
View
LPAR
2004
Springer
15 years 7 months ago
Knowledge-Based Synthesis of Distributed Systems Using Event Structures
Abstract. To produce a program guaranteed to satisfy a given specification one can synthesize it from a formal constructive proof that a computation satisfying that specification...
Mark Bickford, Robert L. Constable, Joseph Y. Halp...
118
Voted
TYPES
2004
Springer
15 years 7 months ago
A Few Constructions on Constructors
We present four constructions for standard equipment which can be generated for every inductive datatype: case analysis, structural recursion, no confusion, acyclicity. Our constru...
Conor McBride, Healfdene Goguen, James McKinna
AGTIVE
1999
Springer
15 years 5 months ago
Graph Algorithm Animation with Grrr
We discuss geometric positioning, highlighting of visited nodes and user defined highlighting that form the algorithm animation facilities in the Grrr graph rewriting programming l...
Peter J. Rodgers, Natalia Vidal
SAS
1999
Springer
15 years 5 months ago
Polyhedral Analysis for Synchronous Languages
We define an operational semantics for the Signal language and design an analysis which allows to verify properties pertaining to the relation between values of the numeric and bo...
Frédéric Besson, Thomas P. Jensen, J...
SAS
1994
Springer
105views Formal Methods» more  SAS 1994»
15 years 5 months ago
Efficient Strictness Analysis of Haskell
Strictness analysis has been a living field of investigation since Mycroft's original work in 1980, and is getting increasingly significant with the still wider use of lazy fu...
Kristian Damm Jensen, Peter Hjæresen, Mads R...