Sciweavers

55 search results - page 9 / 11
» Reasoning About Imperative Quantum Programs
Sort
View
ECIS
2000
13 years 10 months ago
Information Systems Research Education in Australasia: Continuing the Past or Gearing Up for the Future
As the information systems discipline grows, so do the number of programs offering graduate research degrees (GRD). In Australasia these include one year post-graduate (honors) pr...
Beverley G. Hope, M. Fergusson
ACTA
2010
191views more  ACTA 2010»
13 years 9 months ago
Automata-based verification of programs with tree updates
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
Peter Habermehl, Radu Iosif, Tomás Vojnar
CCS
2008
ACM
13 years 10 months ago
Verifiable functional purity in java
Proving that particular methods within a code base are functionally pure--deterministic and side-effect free--would aid verification of security properties including function inve...
Matthew Finifter, Adrian Mettler, Naveen Sastry, D...
RAS
2008
150views more  RAS 2008»
13 years 8 months ago
Logic-based robot control in highly dynamic domains
In this paper we present the robot programming and planning language Readylog, a Golog dialect which was developed to support the decision making of robots acting in dynamic real-...
Alexander Ferrein, Gerhard Lakemeyer
PPDP
2007
Springer
14 years 2 months ago
Formalizing and verifying semantic type soundness of a simple compiler
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...
Nick Benton, Uri Zarfaty