Sciweavers

6274 search results - page 63 / 1255
» Proofs, Programs, Processes
Sort
View
CL
2000
Springer
14 years 2 months ago
Logic Program Synthesis in a Higher-Order Setting
We describe a system for the synthesis of logic programs from specifications based on higher-order logical descriptions of appropriate refinement operations. The system has been ...
David Lacey, Julian Richardson, Alan Smaill
CADE
2010
Springer
13 years 11 months ago
Multi-Prover Verification of Floating-Point Programs
Abstract. In the context of deductive program verification, supporting floatingpoint computations is tricky. We propose an expressive language to formally specify behavioral proper...
Ali Ayad, Claude Marché
APAL
2008
111views more  APAL 2008»
13 years 10 months ago
Cut elimination for a simple formulation of epsilon calculus
A simple cut elimination proof for arithmetic with epsilon symbol is used to establish termination of a modified epsilon substitution process. This opens a possibility of extensio...
Grigori Mints
ICFP
2010
ACM
13 years 11 months ago
Security-typed programming within dependently typed programming
Several recent security-typed programming languages, such as Aura, PCML5, and Fine, allow programmers to express and enforce access control and information flow policies. Most of ...
Jamie Morgenstern, Daniel R. Licata
AAAI
1990
13 years 11 months ago
Inductive Synthesis of Equational Programs
An equational approach to the synthesis of functional and logic programs is taken. Typically, a target program contains equations that are only true in the standard model of the g...
Nachum Dershowitz, Eli Pinchover