Sciweavers

429 search results - page 57 / 86
» Theorem Proving Languages for Verification
Sort
View
POPL
1992
ACM
14 years 23 days ago
Abstract Semantics for a Higher-Order Functional Language with Logic Variables
Semantics for a Higher-Order Functional Language with Logic Variables Radha Jagadeesan Imperial College, London, UK SW7 2BZ. Keshav Pingali Cornell University, Ithaca, NY 14853. A...
Radha Jagadeesan, Keshav Pingali
JLP
2007
89views more  JLP 2007»
13 years 8 months ago
Universality and semicomputability for nondeterministic programming languages over abstract algebras
tract Algebras Wei Jiang∗ , Yuan Wang† , and Jeffery Zucker‡ September 11, 2006 The Universal Function Theorem (UFT) originated in 1930s with the work of Alan Turing, who p...
Wei Jiang, Yuan Wang, Jeffery I. Zucker
IFIP
2004
Springer
14 years 2 months ago
Decidability of Opacity with Non-Atomic Keys
The most studied property, secrecy, is not always sufficient to prove the security of a protocol. Other properties such as anonymity, privacy or opacity could be useful. Here, we u...
Laurent Mazaré
VMCAI
2004
Springer
14 years 2 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...
JUCS
2006
104views more  JUCS 2006»
13 years 8 months ago
Introducing the ITP Tool: a Tutorial
: We present a tutorial of the ITP tool, a rewriting-based theorem prover that can be used to prove inductive properties of membership equational specifications. We also introduce ...
Manuel Clavel, Miguel Palomino, Adrián Ries...