Sciweavers

850 search results - page 73 / 170
» A Logic Programming Language Based on Binding Algebras
Sort
View
APLAS
2008
ACM
15 years 3 months ago
Reasoning about Java's Reentrant Locks
This paper presents a verification technique for a concurrent Java-like language with reentrant locks. The verification technique is based on permissionaccounting separation logic....
Christian Haack, Marieke Huisman, Clément H...
LISP
2008
96views more  LISP 2008»
15 years 1 months ago
Dynamic slicing of lazy functional programs based on redex trails
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
Claudio Ochoa, Josep Silva, Germán Vidal
FPCA
1995
15 years 5 months ago
Shortcut Deforestation in Calculational Form
In functional programming, intermediate data structures are often used to “glue’) together small programs. Deforestation is a program transformation to remove these intermedia...
Akihiko Takano, Erik Meijer
AOSD
2007
ACM
15 years 5 months ago
A static aspect language for checking design rules
Design rules express constraints on the behavior and structure of a program. These rules can help ensure that a program follows a set of established practices, and avoids certain ...
Clint Morgan, Kris De Volder, Eric Wohlstadter
ICFP
2005
ACM
16 years 1 months ago
Types with semantics: soundness proof assistant
We present a parametric Hoare-like logic for computer-aided reasoning about typeable properties of functional programs. The logic is based on the concept of a specialised assertio...
Olha Shkaravska