Sciweavers

72 search results - page 10 / 15
» A Beginner's Course on Reasoning About Imperative Programs
Sort
View
CCS
2008
ACM
14 years 11 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...
DALT
2007
Springer
15 years 3 months ago
Composing High-Level Plans for Declarative Agent Programming
Abstract. Research on practical models of autonomous agents has largely focused on a procedural view of goal achievement. This allows for efficient implementations, but prevents an...
Felipe Rech Meneguzzi, Michael Luck
83
Voted
JELIA
2010
Springer
14 years 8 months ago
Parametrized Logic Programming
Traditionally, a logic program is built up to reason about atomic first-order formulas. The key idea of parametrized logic programming is that, instead of atomic first-order form...
Ricardo Gonçalves, José Júlio...
RAS
2008
150views more  RAS 2008»
14 years 9 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
90
Voted
PPDP
2007
Springer
15 years 3 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