Sciweavers

8132 search results - page 12 / 1627
» Dependability, Abstraction, and Programming
Sort
View
CAV
2009
Springer
165views Hardware» more  CAV 2009»
15 years 1 months ago
Equivalence Checking of Static Affine Programs Using Widening to Handle Recurrences
Designers often apply manual or semi-automatic loop and data transformations on array and loop intensive programs to improve performance. The transformations should preserve the fu...
Sven Verdoolaege, Gerda Janssens, Maurice Bruynoog...
POPL
1991
ACM
15 years 1 months ago
Dependence Flow Graphs: An Algebraic Approach to Program Dependencies
Keshav Pingali, Micah Beck, Richard Johnson, Mayan...
CAV
2006
Springer
143views Hardware» more  CAV 2006»
15 years 1 months ago
Automatic Termination Proofs for Programs with Shape-Shifting Heaps
We describe a new program termination analysis designed to handle imperative programs whose termination depends on the mutation rogram's heap. We first describe how an abstrac...
Josh Berdine, Byron Cook, Dino Distefano, Peter W....
CORR
2010
Springer
158views Education» more  CORR 2010»
14 years 9 months ago
Epistemic Model Checking for Knowledge-Based Program Implementation: an Application to Anonymous Broadcast
Knowledge-based programs provide an abstract level of description of protocols in which agent actions are related to their states of knowledge. The paper describes how epistemic mo...
Omar I. Al-Bataineh, Ron van der Meyden
CORR
2010
Springer
146views Education» more  CORR 2010»
14 years 9 months ago
Liberalizing Dependency
Abstract. The dependency core calculus (DCC), a simple extension of the computational lambda calculus, captures a common notion of dependency that arises in many programming langua...
Avik Chaudhuri