Sciweavers

1894 search results - page 104 / 379
» A TLA Proof System
Sort
View
92
Voted
CORR
2006
Springer
113views Education» more  CORR 2006»
15 years 25 days ago
Combining typing and size constraints for checking the termination of higher-order conditional rewrite systems
In a previous work, the first author extended to higher-order rewriting and dependent types the use of size annotations in types, a termination proof technique called type or size ...
Frédéric Blanqui, Colin Riba
83
Voted
ENTCS
2007
98views more  ENTCS 2007»
15 years 23 days ago
Type Systems for Optimizing Stack-based Code
We give a uniform type-systematic account of a number of optimizations and the underlying analyses for a bytecode-like stack-based low-level language, including analysis soundness...
Ando Saabas, Tarmo Uustalu
100
Voted
POLICY
2005
Springer
15 years 6 months ago
An Audit Logic for Accountability
We describe a policy language and implement its associated proof checking system. In our system, agents can distribute data along with usage policies in a decentralized architectu...
J. G. Cederquist, Ricardo Corin, M. A. C. Dekker, ...
CL
2000
Springer
15 years 5 months ago
Logic Program Synthesis in a Higher-Order Setting
We describe a system for the synthesis of logic programs from specifications based on higher-order logical descriptions of appropriate refinement operations. The system has been ...
David Lacey, Julian Richardson, Alan Smaill
103
Voted
APLAS
2009
ACM
15 years 4 months ago
On Stratified Regions
Type and effect systems are a tool to analyse statically the behaviour of programs with effects. We present a proof based on the so called reducibility candidates that a suitable ...
Roberto M. Amadio