Sciweavers

551 search results - page 50 / 111
» {log}: A Logic Programming Language with Finite Sets
Sort
View
CC
1998
Springer
134views System Software» more  CC 1998»
14 years 9 days ago
Flow Logics for Constraint Based Analysis
Abstract. Flow logic offers a compact and versatile notation for expressing the acceptability of solutions to program analysis problems. In contrast to previous logical formulation...
Hanne Riis Nielson, Flemming Nielson
ICFP
2003
ACM
14 years 8 months ago
Compiler implementation in a formal logical framework
The task of designing and implementing a compiler can be a difficult and error-prone process. In this paper, we present proach based on the use of higher-order abstract syntax and...
Jason Hickey, Aleksey Nogin, Adam Granicz
CCS
2010
ACM
14 years 2 months ago
A logic for authorization provenance
In distributed environments, statements from a number of principals, besides the central trusted party, may influence the derivations of authorization decisions. However, existin...
Jinwei Hu, Yan Zhang, Ruixuan Li, Zhengding Lu
SIGSOFT
2006
ACM
14 years 8 months ago
Dynamic slicing long running programs through execution fast forwarding
Fixing runtime bugs in long running programs using trace based analyses such as dynamic slicing was believed to be prohibitively expensive. In this paper, we present a novel execu...
Xiangyu Zhang, Sriraman Tallam, Rajiv Gupta
ICFP
2003
ACM
14 years 8 months ago
Mechanising Hankin and Barendregt using the Gordon-Melham axioms
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
Michael Norrish