4370 search results - page 603 / 874 » Algebra of Logic Programming |
115
Voted
PASTE
2004
ACM
15 years 10 months ago
2004
ACM
This work discusses two non-traditional approaches for evaluating the imprecision of static analysis. The approaches are based on proofs of feasibility or infeasibility that are c...
131
Voted
AMAST
2004
Springer
15 years 10 months ago
2004
Springer
JavaFAN uses a Maude rewriting logic specification of the JVM semantics as the basis of a software analysis tool with competitive performance. It supports formal analysis of concu...
165
click to vote
IFIP
2004
Springer
15 years 10 months ago
2004
Springer
Abstract We introduce a generic framework for proof carrying code, developed and mechanically verified in Isabelle/HOL. The framework defines and proves sound a verification con...
142
click to vote
KR
2004
Springer
15 years 10 months ago
2004
Springer
The main contribution of this paper is the definition of the preference description language ¡¢ . This language allows us to combine qualitative and quantitative, penalty bas...
294
click to vote
LICS
1994
IEEE
15 years 8 months ago
1994
IEEE
Higher-order narrowing is a general method for higher-order equational reasoning and serves for instance as the foundation for the integration of functional and logic programming. ...