Completeness and predicate-based abstract interpretation
PEPM '93 Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Improving abstract interpretations by combining domains
PEPM '93 Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Experimental evaluation of a generic abstract interpretation algorithm for PROLOG
ACM Transactions on Programming Languages and Systems (TOPLAS)
Denotational abstract interpretation of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Combinations of abstract domains for logic programming
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Analyzing logic programs with dynamic scheduling
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Improving abstract interpretations by combining domains
ACM Transactions on Programming Languages and Systems (TOPLAS)
A symbolic constraint solving framework for analysis of logic programs
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Implementation of multiple specialization in logic programs
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Type analysis of logic programs in the presence of type definitions
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Gated SSA-based demand-driven symbolic analysis for parallelizing compilers
ICS '95 Proceedings of the 9th international conference on Supercomputing
Practical program analysis using general purpose logic programming systems—a case study
PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
Global analysis of constraint logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Complementation in abstract interpretation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Program analysis: the abstract interpretation perspective
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Program analysis using binary relations
Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation
Verification of Real-Time Systems using Linear Relation Analysis
Formal Methods in System Design - Special issue on computer aided verification (CAV 93)
Types as abstract interpretations
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Controlling generalization and polyvariance in partial deduction of normal logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Equations as a uniform framework for partial evaluation and abstract interpretation
ACM Computing Surveys (CSUR) - Special issue: electronic supplement to the September 1998 issue
Optimizing modular logic languages
ACM Computing Surveys (CSUR) - Special issue: electronic supplement to the September 1998 issue
A logical model for relational abstract domains
ACM Transactions on Programming Languages and Systems (TOPLAS)
Optimizing compilation of CLP( R )
ACM Transactions on Programming Languages and Systems (TOPLAS)
Abstract Interpretation for Termination Analysis in Functional Active Databases
Journal of Intelligent Information Systems - Special issue on functional approach to intelligent information systems
Non pair-sharing and freeness analysis through linear refinement
PEPM '00 Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Sharing and groundness dependencies in logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Making abstract interpretations complete
Journal of the ACM (JACM)
Data Dependence Analysis of Assembly Code
International Journal of Parallel Programming - Special issue on instruction-level parallelism and parallelizing compilation, part 2
An abstract Monte-Carlo method for the analysis of probabilistic programs
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Compiler optimizations for scalable parallel systems
Path dependent analysis of logic programs
PEPM '02 Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Compositionality in the puzzle of semantics
PEPM '02 Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Parallel execution of prolog programs: a survey
ACM Transactions on Programming Languages and Systems (TOPLAS)
Logical optimality of groundness analysis
Theoretical Computer Science
Approximate reasoning by similarity-based SLD resolution
Theoretical Computer Science
Refining Model Checking by Abstract Interpretation
Automated Software Engineering
Toupie: The µ-calculus over Finite Domains as a Constraint Language
Journal of Automated Reasoning
Managing the granularity of constraint-based analyses by rule transformation
Information Processing Letters
On proving left termination of constraint logic programs
ACM Transactions on Computational Logic (TOCL)
Least and greatest solutions of equations over N
Nordic Journal of Computing
Abstract Domains for Universal and Existential Properties
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Backwards Abstract Interpretation of Probabilistic Programs
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
A Method for Automatic Cryptographic Protocol Verification
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Inferring Termination Conditions for Logic Programs Using Backwards Analysis
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Indexed Categories and Bottom-Up Semantics of Logic Programs
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Boolean Functions for Finite-Tree Dependencies
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Advanced Logic Program Specialisation
Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School
A Flexible Framework for Dynamic and Static Slicing of Logic Programs
PADL '99 Proceedings of the First International Workshop on Practical Aspects of Declarative Languages
PADL '03 Proceedings of the 5th International Symposium on Practical Aspects of Declarative Languages
A New Numerical Abstract Domain Based on Difference-Bound Matrices
PADO '01 Proceedings of the Second Symposium on Programs as Data Objects
Partial Completeness of Abstract Fixpoint Checking
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
WADT '01 Selected papers from the 15th International Workshop on Recent Trends in Algebraic Development Techniques
On Small Depth Threshold Circuits
SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
Abstract Interpretation of Prolog Programs
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
Analysis of Downward Closed Properties of Logic Programs
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
Abstract Compilation for Sharing Analysis
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
Abstraction of Expectation Functions Using Gaussian Distributions
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Verification of Embedded Software: Problems and Perspectives
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Inferring and Compiling Termination for Constraint Logic Programs
LOPSTR '98 Proceedings of the 8th International Workshop on Logic Programming Synthesis and Transformation
Measuring the Precision of Abstract Interpretations
LOPSTR '00 Selected Papers form the 10th International Workshop on Logic Based Program Synthesis and Transformation
Abstract Conjunctive Partial Deduction Using Regular Types and Its Application to Model Checking
LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Approximate Reachability Analysis of Piecewise-Linear Dynamical Systems
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Hybrid Systems' Properties - Classification and Relation to Computer Science
Computer Aided Systems Theory - EUROCAST 2001-Revised Papers
Analysing Approximate Confinement under Uniform Attacks
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Freeness Analysis Through Linear Refinement
SAS '99 Proceedings of the 6th International Symposium on Static Analysis
Parameterizing a Groundness Analysis of Logic Programs
SAS '01 Proceedings of the 8th International Symposium on Static Analysis
Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs
SAS '01 Proceedings of the 8th International Symposium on Static Analysis
An Abstract Analysis of the Probabilistic Termination of Programs
SAS '01 Proceedings of the 8th International Symposium on Static Analysis
Checking Safety Properties of Behavioral VHDL Descriptions by Abstract Interpretation
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Abstract Interpretation Based Formal Methods and Future Challenges
Informatics - 10 Years Back. 10 Years Ahead.
Modular Static Program Analysis
CC '02 Proceedings of the 11th International Conference on Compiler Construction
On Abstraction in Software Verification
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
An Abstract Interpretation Framework for Termination Analysis of Active Rules
DBPL '99 Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database Programming
Optimising Active Database Rules by Partial Evaluation and Abstract Interpretation
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Abstracting Cryptographic Protocols with Tree Automata
SAS '99 Proceedings of the 6th International Symposium on Static Analysis
Abstracting cryptographic protocols with tree automata
Science of Computer Programming - Special issue on static analysis (SAS'99)
Granularity of constraint-based analysis for Java
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Pair-independence and freeness analysis through linear refinement
Information and Computation
A static analyzer for large safety-critical software
PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
A new framework for declarative programming
Theoretical Computer Science
Log Auditing through Model-Checking
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Path Dependent Analysis of Logic Programs
Higher-Order and Symbolic Computation
Query transformations for improving the efficiency of ilp systems
The Journal of Machine Learning Research
Proceedings of the 2nd international conference on Generative programming and component engineering
Symbolic transfer function-based approaches to certified compilation
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A framework for the integration of partial evaluation and abstract interpretation of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Sequence-based abstract interpretation of Prolog
Theory and Practice of Logic Programming
Properties of Hybrid Systems—A Computer Science Perspective
Formal Methods in System Design
Precise and efficient static array bound checking for large embedded C programs
Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation
Finite-tree analysis for constraint logic-based languages
Information and Computation
Inferring termination conditions for logic programs using backwards analysis
Theory and Practice of Logic Programming
cTI: a constraint-based termination inference tool for ISO-Prolog
Theory and Practice of Logic Programming
Toward an automatic parallelization of sparse matrix computations
Journal of Parallel and Distributed Computing
Quantitative static analysis of distributed systems
Journal of Functional Programming
Transforming semantics by abstract interpretation
Theoretical Computer Science
Efficient algorithms for isomorphisms of simple types
Mathematical Structures in Computer Science
Abstract interpretation of programs as Markov decision processes
Science of Computer Programming - Special issue: Static analysis symposium (SAS 2003)
Higher-Order and Symbolic Computation
A backward analysis for constraint logic programs
Theory and Practice of Logic Programming
Using parametric set constraints for locating errors in CLP programs
Theory and Practice of Logic Programming
Deriving escape analysis by abstract interpretation
Higher-Order and Symbolic Computation
Program verification as probabilistic inference
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Measuring the confinement of probabilistic systems
Theoretical Computer Science - Theoretical foundations of security analysis and design II
Optimizing typed feature structure grammar parsing through non-statistical indexing
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
TCTL Inevitability Analysis of Dense-Time Systems: From Theory to Engineering
IEEE Transactions on Software Engineering
The trace partitioning abstract domain
ACM Transactions on Programming Languages and Systems (TOPLAS) - Special Issue ESOP'05
Verification of device drivers and intelligent controllers: a case study
EMSOFT '07 Proceedings of the 7th ACM & IEEE international conference on Embedded software
Improving precision of type analysis using non-discriminative union
Theory and Practice of Logic Programming
Inferring non-suspension conditions for logic programs with dynamic scheduling
ACM Transactions on Computational Logic (TOCL)
The pitfalls of verifying floating-point computations
ACM Transactions on Programming Languages and Systems (TOPLAS)
Test frame updating in CPM testing of Prolog programs
Software Quality Control
A Novel Derivation Framework For Definite Logic Program
Electronic Notes in Theoretical Computer Science (ENTCS)
The complexity of Tarski's fixed point theorem
Theoretical Computer Science
Inferring precise polymorphic type dependencies in logic programs
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Abstract interpretation and types for systems biology
Theoretical Computer Science
Endomorphisms for Non-trivial Non-linear Loop Invariant Generation
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Automatic modular abstractions for linear constraints
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Cardinality Abstraction for Declarative Networking Applications
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Control-flow analysis of function calls and returns by abstract interpretation
Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
A framework for abstract interpretation of timed concurrent constraint programs
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Optimality in goal-dependent analysis of sharing
Theory and Practice of Logic Programming
An Interval-based Abstraction for Quantifying Information Flow
Electronic Notes in Theoretical Computer Science (ENTCS)
Refining Abstract Interpretation-Based Static Analyses with Hints
APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
Fast Escape Analysis for Region-based Memory Management
Electronic Notes in Theoretical Computer Science (ENTCS)
Verification of Java Programs with Interacting Analysis Plugins
Electronic Notes in Theoretical Computer Science (ENTCS)
Combining control and data abstraction in the verification of hybrid systems
MEMOCODE'09 Proceedings of the 7th IEEE/ACM international conference on Formal Methods and Models for Codesign
Semi-automatic derivation of timing models for WCET analysis
Proceedings of the ACM SIGPLAN/SIGBED 2010 conference on Languages, compilers, and tools for embedded systems
Designing prolog semantics for a class of observables
PRICAI'06 Proceedings of the 9th Pacific Rim international conference on Artificial intelligence
TCTL inevitability analysis of dense-time systems
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Abstract interpretation of programs as Markov decision processes
SAS'03 Proceedings of the 10th international conference on Static analysis
A general framework for variable aliasing: towards optimal operators for sharing properties
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
Towards automated reasoning on the properties of numerical constraints
ERCIM'02/CologNet'02 Proceedings of the 2002 Joint ERCIM/CologNet international conference on Constraint solving and constraint logic programming
Design, implementation, and evaluation of a dynamic compilation framework for the YAP system
ICLP'07 Proceedings of the 23rd international conference on Logic programming
A novel test case generation method for prolog programs based on call patterns semantics
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Abstract interpretation of cellular signalling networks
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
A forward-backward abstraction refinement algorithm
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
Non-disjunctive numerical domain for array predicate abstraction
ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
Abstract interpretation for worst and average case analysis
Program analysis and compilation, theory and practice
Automated termination analysis for logic programs with cut*
Theory and Practice of Logic Programming
Relational Abstract Domain of Weighted Hexagons
Electronic Notes in Theoretical Computer Science (ENTCS)
Extending Abstract Acceleration Methods to Data-Flow Programs with Numerical Inputs
Electronic Notes in Theoretical Computer Science (ENTCS)
A Note on the Inversion Join for Polyhedral Analysis
Electronic Notes in Theoretical Computer Science (ENTCS)
Probabilistic semantics and program analysis
SFM'10 Proceedings of the Formal methods for quantitative aspects of programming languages, and 10th international conference on School on formal methods for the design of computer, communication and software systems
Combining control and data abstraction in the verification of hybrid systems
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems - Special section on the ACM IEEE international conference on formal methods and models for codesign (MEMOCODE) 2009
Static analysis, abstract interpretation and verification in (constraint logic) programming
A 25-year perspective on logic programming
Deriving numerical abstract domains via principal component analysis
SAS'10 Proceedings of the 17th international conference on Static analysis
Generating invariants for non-linear hybrid systems by linear algebraic methods
SAS'10 Proceedings of the 17th international conference on Static analysis
A tool which mines partial execution traces to improve static analysis
RV'10 Proceedings of the First international conference on Runtime verification
Precondition inference from intermittent assertions and application to contracts on collections
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
The two variable per inequality abstract domain
Higher-Order and Symbolic Computation
Magic-sets for localised analysis of Java bytecode
Higher-Order and Symbolic Computation
Policy iteration within logico-numerical abstract domains
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Proving the properties of communicating imperfectly-clocked synchronous systems
SAS'06 Proceedings of the 13th international conference on Static Analysis
The parallel implementation of the astrée static analyzer
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Probabilistic linda-based coordination languages
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Control-flow analysis of function calls and returns by abstract interpretation
Information and Computation
Detecting non-cyclicity by abstract compilation into boolean functions
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Symbolic methods to enhance the precision of numerical abstract domains
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
A relational abstraction for functions
SAS'05 Proceedings of the 12th international conference on Static Analysis
Understanding the origin of alarms in ASTRÉE
SAS'05 Proceedings of the 12th international conference on Static Analysis
Pair-sharing analysis of object-oriented programs
SAS'05 Proceedings of the 12th international conference on Static Analysis
Verification of communication protocols using abstract interpretation of FIFO queues
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Widening polyhedra with landmarks
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
Transcendental inductive invariants generation for non-linear differential and hybrid systems
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
Sound non-statistical clustering of static analysis alarms
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Formal verification by abstract interpretation
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
Applying abstract acceleration to (co-)reachability analysis of reactive programs
Journal of Symbolic Computation
Discovering invariants via simple component analysis
Journal of Symbolic Computation
Observational Completeness on Abstract Interpretation
Fundamenta Informaticae - Logic, Language, Information and Computation
Calculating graph algorithms for dominance and shortest path
MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
Optimal abstraction on real-valued programs
SAS'07 Proceedings of the 14th international conference on Static Analysis
Detecting specification errors in declarative languages with constraints
MODELS'12 Proceedings of the 15th international conference on Model Driven Engineering Languages and Systems
Satisfiability solvers are static analysers
SAS'12 Proceedings of the 19th international conference on Static Analysis
A structural soundness proof for shivers's escape technique: a case for galois connections
SAS'12 Proceedings of the 19th international conference on Static Analysis
Abstract conflict driven learning
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
| Hi-index | 0.01 |