Sciweavers

858 search results - page 99 / 172
» Abstract Interpretation Based Verification of Logic Programs
Sort
View
ICFP
2003
ACM
16 years 3 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
IFIP
2005
Springer
15 years 8 months ago
A Logic for Analysing Subterfuge in Delegation Chains
Abstract. Trust Management is an approach to construct and interpret the trust relationships among public-keys that are used to mediate security-critical actions. Cryptographic cre...
Hongbin Zhou, Simon N. Foley
FM
2003
Springer
174views Formal Methods» more  FM 2003»
15 years 8 months ago
Model-Checking TRIO Specifications in SPIN
We present a novel application on model checking through SPIN as a means for verifying purely descriptive specifications written in TRIO, a first order, linear-time temporal logic ...
Angelo Morzenti, Matteo Pradella, Pierluigi San Pi...
PEPM
1993
ACM
15 years 7 months ago
The Correctness of an Optimized Code Generation
For a functional programming language with a lazy standard semantics, we define a strictness analysis by means of abstract interpretation. Using the information from the strictne...
Torben Poort Lange
FASE
2009
Springer
15 years 7 months ago
Enhanced Property Specification and Verification in BLAST
Model checking tools based on the iterative refinement of predicate abstraction (e.g., Slam and Blast) often feature a specification language for expressing complex behavior rules....
Ondrej Sery