Sciweavers

394 search results - page 39 / 79
» Formal polytypic programs and proofs
Sort
View
COMPASS
1994
14 years 3 days ago
Types, Subtypes, and ASL+
ASL+ is a formalism for speci cation and programming in-the-large, based on an arbitrary institution. It has rules for proving the satisfaction and re nement of speci cations, whic...
David Aspinall
ICDAR
2009
IEEE
14 years 2 months ago
Inductive Logic Programming for Symbol Recognition
In this paper, we make an attempt to use Inductive Logic Programming (ILP) to automatically learn non trivial descriptions of symbols, based on a formal description. This work is ...
K. C. Santosh, Bart Lamiroy, Jean-Philippe Ropers
SCP
2008
115views more  SCP 2008»
13 years 8 months ago
Goto elimination in program algebra
This paper shows that program algebra (PGA) [8] offers a mathematical and systematic framework for reasoning about correctness and equivalence of algorithms and transformation rul...
Thuy Duong Vu
CORR
2000
Springer
133views Education» more  CORR 2000»
13 years 7 months ago
On Exponential-Time Completeness of the Circularity Problem for Attribute Grammars
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
Pei-Chi Wu
ESOP
2005
Springer
14 years 1 months ago
Asserting Bytecode Safety
Abstract. We instantiate an Isabelle/HOL framework for proof carrying code to Jinja bytecode, a downsized variant of Java bytecode featuring objects, inheritance, method calls and ...
Martin Wildmoser, Tobias Nipkow