Sciweavers

131 search results - page 15 / 27
» Proof systems that take advice
Sort
View
MKM
2005
Springer
14 years 3 months ago
A Tough Nut for Mathematical Knowledge Management
In this contribution we address two related questions. Firstly, we want to shed light on the question how to use a representation formalism to represent a given problem. Secondly, ...
Manfred Kerber, Martin Pollet
ENTCS
2006
126views more  ENTCS 2006»
13 years 9 months ago
A Congruence Format for Name-passing Calculi
We define and use a SOS-based framework to specify the transition systems of calculi with name-passing properties. This setting uses proof-theoretic tools to take care of some of ...
Axelle Ziegler, Dale Miller, Catuscia Palamidessi
VMCAI
2004
Springer
14 years 3 months ago
Construction of a Semantic Model for a Typed Assembly Language
Typed Assembly Languages (TALs) can be used to validate the safety of assembly-language programs. However, typing rules are usually trusted as axioms. In this paper, we show how to...
Gang Tan, Andrew W. Appel, Kedar N. Swadi, Dinghao...
ENTCS
2000
114views more  ENTCS 2000»
13 years 9 months ago
Syntactic Type Soundness for the Region Calculus
The region calculus of Tofte and Talpin is an annotated polymorphically typed lambda calculus which makes memory allocation and deallocation explicit. It is intended as an interme...
Simon Helsen, Peter Thiemann
SAS
2009
Springer
281views Formal Methods» more  SAS 2009»
14 years 10 months ago
A Verifiable, Control Flow Aware Constraint Analyzer for Bounds Check Elimination
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...
David Niedzielski, Jeffery von Ronne, Andreas Gamp...