Boolean Functions for Finite-Tree Dependencies
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Pos(T): Analyzing Dependencies in Typed Logic Programs
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Reexecution-Based Analysis of Logic Programs with Delay Declarations
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Finite-Tree Analysis for Constraint Logic-Based Languages
SAS '01 Proceedings of the 8th International Symposium on Static Analysis
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Sequence-based abstract interpretation of Prolog
Theory and Practice of Logic Programming
Finite-tree analysis for constraint logic-based languages
Information and Computation
A Novel Derivation Framework For Definite Logic Program
Electronic Notes in Theoretical Computer Science (ENTCS)
On model checking multiple hybrid views
Theoretical Computer Science
Theoretical Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Verification of Java Programs with Interacting Analysis Plugins
Electronic Notes in Theoretical Computer Science (ENTCS)
Efficient structural information analysis for real CLP languages
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Widening and narrowing operators for abstract interpretation
Computer Languages, Systems and Structures
Static analysis, abstract interpretation and verification in (constraint logic) programming
A 25-year perspective on logic programming
Statically inferring complex heap, array, and numeric invariants
SAS'10 Proceedings of the 17th international conference on Static analysis
| Hi-index | 0.00 |