Sciweavers

55 search results - page 5 / 11
» Reasoning About Imperative Quantum Programs
Sort
View
JANCL
2006
112views more  JANCL 2006»
13 years 8 months ago
KAT-ML: an interactive theorem prover for Kleene algebra with tests
We describe KAT-ML, an implementation of an interactive theorem prover for Kleene algebra with tests (KAT). The system is designed to reflect the natural style of reasoning with K...
Kamal Aboul-Hosn, Dexter Kozen
KR
1991
Springer
14 years 8 days ago
Meta-Reasoning in Executable Temporal Logic
Temporal logic can be used as a programming language. If temporal formulae are represented in the form of an implication where the antecedent refers to the past, and the consequen...
Howard Barringer, Michael Fisher, Dov M. Gabbay, A...
CSFW
2006
IEEE
14 years 2 months ago
Information-Flow Security for Interactive Programs
Abstract. Interactive programs allow users to engage in input and output throughout execution. The ubiquity of such programs motivates the development of models for reasoning about...
Kevin R. O'Neill, Michael R. Clarkson, Stephen Cho...
ICTAC
2010
Springer
13 years 6 months ago
Mechanized Verification with Sharing
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...
J. Gregory Malecha, Greg Morrisett
ENTCS
2002
97views more  ENTCS 2002»
13 years 8 months ago
Plan in Maude: Specifying an Active Network Programming Language
PLAN is a language designed for programming active networks, and can more generally be regarded as a model of mobile computation. PLAN generalizes the paradigm of imperative funct...
Mark-Oliver Stehr, Carolyn L. Talcott