Sciweavers

661 search results - page 14 / 133
» What Can We Expect from Program Verification
Sort
View
ICFP
2007
ACM
14 years 8 months ago
McErlang: a model checker for a distributed functional programming language
We present a model checker for verifying distributed programs written in the Erlang programming language. Providing a model checker for Erlang is especially rewarding since the la...
Hans Svensson, Lars-Åke Fredlund
MICAI
2000
Springer
14 years 4 days ago
Searching for a Solution to Program Verification=Equation Solving in CCS
Unique Fixpoint Induction, UFI, is a chief inference rule to prove the equivalence of recursive processes in CCS [7]. It plays a major role in the equational approach to verificati...
Raul Monroy, Alan Bundy, Ian Green
ICALP
2010
Springer
13 years 8 months ago
What Is a Pure Functional?
Abstract. Given an ML function f : (int->int)->int how can we rigorously specify that f is pure, i.e., produces no side-effects other than those arising from calling its func...
Martin Hofmann, Aleksandr Karbyshev, Helmut Seidl
POPL
2008
ACM
14 years 9 months ago
Relevance heuristics for program analysis
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
Kenneth L. McMillan
JFP
2007
85views more  JFP 2007»
13 years 8 months ago
What is the meaning of these constant interruptions?
Asynchronous exceptions, or interrupts, are important for writing robust, modular programs, but are traditionally viewed as being difficult from a semantic perspective. In this ar...
Graham Hutton, Joel Wright