Results 1 
5 of
5
A Programming Logic for Java Bytecode Programs
 In Proceedings of the 16th International Conference on Theorem Proving in Higher Order LOglCS, volume 2758 of Lecture Notes in Computer Science
, 2003
"... A copy can be downloaded for personal noncommercial research or study, without prior permission or charge This thesis cannot be reproduced or quoted extensively from without first obtaining permission in writing from the Author The content must not be changed in any way or sold commercially in any ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
A copy can be downloaded for personal noncommercial research or study, without prior permission or charge This thesis cannot be reproduced or quoted extensively from without first obtaining permission in writing from the Author The content must not be changed in any way or sold commercially in any format or medium without the formal permission of the Author When referring to this work, full bibliographic details including the author, title, awarding institution and date of the thesis must be given
Labelled Natural Deduction for Interval Logics
 In CSL'01, volume 2142 of LNCS
, 2001
"... We develop a Labelled Natural Deduction framework for a certain class of interval logics. With emphasis on Signed Interval Logic we consider normalization properties and show that normal derivations satisfy a subformula property. We have encoded our framework in the generic theorem proving system Is ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We develop a Labelled Natural Deduction framework for a certain class of interval logics. With emphasis on Signed Interval Logic we consider normalization properties and show that normal derivations satisfy a subformula property. We have encoded our framework in the generic theorem proving system Isabelle. The labelled formalism turns out very convenient for conducting proofs and seems much closer to informal \pen and paper" reasoning than other proof systems. We give an example which supports this claim. We also sketch how the results are applicable to (nonsigned) interval logic and Duration Calculus. 1
Department of Computing Science A Programming Logic for Java
, 2004
"... One significant disadvantage of interpreted bytecode languages, such as Java, is their low execution speed in comparison to compiled languages like C. The mobile nature of bytecode adds to the problem, as many checks are necessary to ensure that downloaded code from untrusted sources is rendered as ..."
Abstract
 Add to MetaCart
One significant disadvantage of interpreted bytecode languages, such as Java, is their low execution speed in comparison to compiled languages like C. The mobile nature of bytecode adds to the problem, as many checks are necessary to ensure that downloaded code from untrusted sources is rendered as safe as possible. But there do exist ways of speeding up such systems. One approach is to carry out static type checking at load time, as in the case of the Java Bytecode Verifier. This reduces the number of runtime checks that must be done and also allows certain instructions to be replaced by faster versions. Another approach is the use of a Just In Time (JIT) Compiler, which takes the bytecode and produces corresponding native code at runtime. Some JIT compilers also carry out some code optimization. There are, however, limits to the amount of optimization that can
General Terms
"... We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on MartinLöf’s intuitionistic type theory. We show how to embed an external programming logic, Aczel’s Logical Theory of Constructions (LTC) inside Agda. To ..."
Abstract
 Add to MetaCart
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on MartinLöf’s intuitionistic type theory. We show how to embed an external programming logic, Aczel’s Logical Theory of Constructions (LTC) inside Agda. To this end we postulate the existence of a domain of untyped functional programs and the conversion rules for these programs. Furthermore, we represent the inductive notions in LTC (intuitionistic predicate logic and totality predicates) as inductive notions in Agda. To illustrate our approach we specify an LTCstyle logic for PCF, and show how to prove the termination and correctness of a general recursive algorithm for computing the greatest common divisor of two numbers. Categories and Subject Descriptors F.3.1 [Logics and meanings of programs]: Specifying and Verifying and Reasoning about Programs–Logics of programs; D.2.4 [Software Engineering]:
Automated Proof Support for Interval Logics
"... We outline the background and motivation for the use of interval logics and consider some initial attempts toward proof support and automation. The main focus, though, is on recent work on these subjects. We compare dierent proof theoretical formalisms, in particular a \classical" versus a ..."
Abstract
 Add to MetaCart
We outline the background and motivation for the use of interval logics and consider some initial attempts toward proof support and automation. The main focus, though, is on recent work on these subjects. We compare dierent proof theoretical formalisms, in particular a \classical" versus a \labelled" one. We discuss encodings of these in the generic proof assistant Isabelle and consider some examples which show that in some cases the labelled formalism gives an order of magnitude improvement in proof length compared to a classical approach.