1036 search results - page 99 / 208 » Verification Programs for Abduction |
136
click to vote
APLAS
2001
ACM
15 years 8 months ago
2001
ACM
We verified two versions of the CPS transformation in Isabelle/HOL: one by Plotkin by Danvy and Filinski. We adopted first order abstract syntax so that the formalization is close...
165
click to vote
FMCAD
2008
Springer
15 years 5 months ago
2008
Springer
We present a method for verifying information flow properties of software programs using inductive assertions and theorem proving. Given a program annotated with information flow a...
106
click to vote
ENTCS
2006
15 years 4 months ago
2006
The goal of this paper is to translate (fragments of) the quantified discrete duration calculus QDDC, proposed by P. Pandya, into symbolic acceptors with counters. Acceptors are w...
166
click to vote
POPL
2010
ACM
15 years 6 months ago
2010
ACM
Angelic nondeterminism can play an important role in program development. It simplifies specifications, for example in deriving programs with a refinement calculus; it is the form...
254
click to vote
POPL
2009
ACM
16 years 4 months ago
2009
ACM
Asynchronous or "event-driven" programming is a popular technique to efficiently and flexibly manage concurrent interactions. In these programs, the programmer can post ...