Sciweavers

133 search results - page 14 / 27
» Proving Properties for Behavioural Specifications with Term ...
Sort
View
KBSE
2007
IEEE
14 years 5 months ago
A dynamic birthmark for java
Code theft is a threat for companies that consider code as a core asset. A birthmark can help them to prove code theft by identifying intrinsic properties of a program. Two progra...
David Schuler, Valentin Dallmeier, Christian Lindi...
ICTAC
2004
Springer
14 years 4 months ago
A Proof of Weak Termination Providing the Right Way to Terminate
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
Olivier Fissore, Isabelle Gnaedig, Hél&egra...
ICTAC
2009
Springer
13 years 8 months ago
A First-Order Policy Language for History-Based Transaction Monitoring
Online trading invariably involves dealings between strangers, so it is important for one party to be able to judge objectively the trustworthiness of the other. In such a setting,...
Andreas Bauer 0002, Rajeev Goré, Alwen Tiu
ICFP
2009
ACM
14 years 11 months ago
Biorthogonality, step-indexing and compiler correctness
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...
Nick Benton, Chung-Kil Hur
ICSE
2010
IEEE-ACM
14 years 22 days ago
Requirements reflection: requirements as runtime entities
Computational reflection is a well-established technique that gives a program the ability to dynamically observe and possibly modify its behaviour. To date, however, reflection is...
Nelly Bencomo, Jon Whittle, Peter Sawyer, Anthony ...