Sciweavers

394 search results - page 32 / 79
» Formal polytypic programs and proofs
Sort
View
DAC
2000
ACM
14 years 9 months ago
Formal verification of iterative algorithms in microprocessors
Contemporary microprocessors implement many iterative algorithms. For example, the front-end of a microprocessor repeatedly fetches and decodes instructions while updating interna...
Mark Aagaard, Robert B. Jones, Roope Kaivola, Kath...
TGC
2007
Springer
14 years 2 months ago
Elimination of Ghost Variables in Program Logics
Abstract. Ghost variables are assignable variables that appear in program annotations but do not correspond to physical entities. They are used to facilitate specification and ver...
Martin Hofmann, Mariela Pavlova
LICS
1994
IEEE
14 years 3 days ago
Subtyping and Parametricity
In this paper we study the interaction of subtyping and parametricity. We describe a logic for a programming language with parametric polymorphism and subtyping. The logic support...
Gordon D. Plotkin, Martín Abadi, Luca Carde...
TYPES
1995
Springer
13 years 11 months ago
A Natural Deduction Approach to Dynamic Logic
Natural Deduction style presentations of program logics are useful in view of the implementation of such logics in interactive proof development environments, based on type theory,...
Furio Honsell, Marino Miculan
AUSAI
1998
Springer
14 years 7 days ago
A Formal Embedding of AgentSpeak(L) in 3APL
Agent-based computing in Arti cial Intelligence has given rise to a number of diverse and competing proposals for agent programming languages. Agents, in the sense we are using it...
Koen V. Hindriks, Frank S. de Boer, Wiebe van der ...