Sciweavers

8132 search results - page 346 / 1627
» Dependability, Abstraction, and Programming
Sort
View
APLAS
2007
ACM
15 years 10 months ago
Monadic, Prompt Lazy Assertions in Haskell
Abstract. Assertions test expected properties of run-time values without disrupting the normal computation of a program. We present a library for enriching Haskell programs with as...
Olaf Chitil, Frank Huch
CORR
2002
Springer
117views Education» more  CORR 2002»
15 years 6 months ago
Computing stable models: worst-case performance estimates
Abstract. We study algorithms for computing stable models of propositional logic programs and derive estimates on their worst-case performance that are asymptotically better than t...
Zbigniew Lonc, Miroslaw Truszczynski
ICFP
2012
ACM
13 years 9 months ago
Functional programming with structured graphs
This paper presents a new functional programming model for graph structures called structured graphs. Structured graphs extend conventional algebraic datatypes with explicit defi...
Bruno C. d. S. Oliveira, William R. Cook
TGC
2007
Springer
16 years 28 days ago
Elimination of Ghost Variables in Program Logics
Abstract. Ghost variables are assignable variables that appear in program annotations but do not correspond to physical entities. They are used to facilitate specification and ver...
Martin Hofmann, Mariela Pavlova
VMCAI
2007
Springer
16 years 28 days ago
Model Checking Nonblocking MPI Programs
Abstract. This paper explores a way to apply model checking techniques to parallel programs that use the nonblocking primitives of the Message Passing Interface (MPI). The method h...
Stephen F. Siegel