Sciweavers

442 search results - page 15 / 89
» Proof Abstraction for Imperative Languages
Sort
View
COGSYS
2005
Springer
13 years 10 months ago
Natural Language Dialog with a Tutor System for Mathematical Proofs
Abstract. Natural language interaction between a student and a tutoring or an assistance system for mathematics is a new multi-disciplinary challenge that requires the interaction ...
Christoph Benzmüller, Helmut Horacek, Ivana K...
EKAW
2006
Springer
14 years 8 days ago
From Natural Language to Formal Proof Goal
Guidelines (Extended abstract) Ruud Stegers1 , Annette ten Teije1 , and Frank van Harmelen1 Vrije Universiteit, Amsterdam The main problem encountered when starting verification of...
Ruud Stegers, Annette ten Teije, Frank van Harmele...
SAS
2004
Springer
103views Formal Methods» more  SAS 2004»
14 years 1 months ago
Information Flow Analysis in Logical Form
Abstract. We specify an information flow analysis for a simple imperative language, using a Hoare-like logic. The logic facilitates static checking of a larger class of programs t...
Torben Amtoft, Anindya Banerjee
CADE
2003
Springer
14 years 9 months ago
Proving Pointer Programs in Higher-Order Logic
This paper develops sound modelling and reasoning methods for imperative programs with pointers: heaps are modelled as mappings from addresses to values, and pointer structures are...
Farhad Mehta, Tobias Nipkow
LISP
2002
81views more  LISP 2002»
13 years 8 months ago
Secure Information Flow via Linear Continuations
Security-typed languages enforce secrecy or integrity policies by type-checking. This paper investigates continuation-passing style (CPS) as a means of proving that such languages...
Steve Zdancewic, Andrew C. Myers