Sciweavers

1194 search results - page 77 / 239
» A Calculus for Predicative Programming
Sort
View
FMCO
2004
Springer
105views Formal Methods» more  FMCO 2004»
15 years 7 months ago
Program Generation and Components
Abstract. The first part of the paper gives a brief overview of metaprogramming, in particular program generation, and its use in software development. The second part introduces ...
Davide Ancona, Eugenio Moggi
FPCA
1991
15 years 5 months ago
Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire
We develop a calculus for lazy functional programming based on recursion operators associated with data type de nitions. For these operators we derive various algebraic laws that ...
Erik Meijer, Maarten M. Fokkinga, Ross Paterson
WDAG
2001
Springer
122views Algorithms» more  WDAG 2001»
15 years 6 months ago
Computation Slicing: Techniques and Theory
We generalize the notion of slice introduced in our earlier paper [6]. A slice of a distributed computation with respect to a global predicate is the smallest computation that cont...
Neeraj Mittal, Vijay K. Garg
SAS
2010
Springer
141views Formal Methods» more  SAS 2010»
15 years 11 days ago
Statically Inferring Complex Heap, Array, and Numeric Invariants
We describe Deskcheck, a parametric static analyzer that is able to establish properties of programs that manipulate dynamically allocated memory, arrays, and integers. Deskcheck c...
Bill McCloskey, Thomas W. Reps, Mooly Sagiv
ICALP
2009
Springer
16 years 2 months ago
Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...
Naoki Kobayashi, C.-H. Luke Ong