A polymorphic type system for PROLOG.
Artificial Intelligence
An ideal model for recursive polymorphic types
Information and Control
A relational framework for abstract interpretation
on Programs as data objects
Foundations of deductive databases and logic programming
Strictness analysis: a new perspective based on type inference
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Algebraic reconstruction of types and effects
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type systems for programming languages
Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
Co-induction in relational semantics
Theoretical Computer Science
Abstract interpretation and application to logic programs
Journal of Logic Programming
Inductive definitions, semantics and abstract interpretations
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Handbook of logic in computer science (vol. 2)
A type system equivalent to flow analysis
ACM Transactions on Programming Languages and Systems (TOPLAS)
Formal bases for dataflow analysis of logic programs
Advances in logic programming theory
Using abstract interpretation to define a strictness type inference system
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Abstract interpretation: a semantics-based tool for program analysis
Handbook of logic in computer science (vol. 4)
The semantics of types in programming languages
Handbook of logic in computer science (vol. 3)
Formal language, grammar and set-constraint-based program analysis by abstract interpretation
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
ACM Computing Surveys (CSUR)
What are principal typings and what are they good for?
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automatic discovery of linear restraints among variables of a program
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Principal type-schemes for functional programs
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the Fourth Colloquium on Automata, Languages and Programming
A Completeness Theorem for Recursively Defined Types
Proceedings of the 12th Colloquium on Automata, Languages and Programming
Polymorphic Typing for Call-by-Name Semantics
Proceedings of the International Conference on Formal Methods in Programming and Their Applications
Polymorphic Typing by Abstract Interpretation
Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science
System F and Abstract Interpretation
SAS '95 Proceedings of the Second International Symposium on Static Analysis
Refinement Types for Program Analysis
SAS '96 Proceedings of the Third International Symposium on Static Analysis
Polymorphic Type Schemes and Recursive Definitions
Proceedings of the 6th Colloquium on International Symposium on Programming
Proceedings of the 7th International Conference on Computer Aided Verification
From polyvariant flow information to intersection and union types
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Temporal abstract interpretation
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Directions for research in approximate system analysis
ACM Computing Surveys (CSUR)
Making abstract interpretations complete
Journal of the ACM (JACM)
A type system for lock-free processes
Information and Computation - IFIP TCS2000
Parsing as abstract interpretation of grammar semantics
Theoretical Computer Science
How to Transform an Analyzer into a Verifier
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
On Small Depth Threshold Circuits
SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory
An Experiment in Type Inference and Verification by Abstract Interpretation
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Properties of a Type Abstract Interpreter
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Class Analysis of Object-Oriented Programs through Abstract Interpretation
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Jakarta: A Toolset for Reasoning about JavaCard
E-SMART '01 Proceedings of the International Conference on Research in Smart Cards: Smart Card Programming and Security
Security Typings by Abstract Interpretation
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Incompleteness, Counterexamples, and Refinements in Abstract Model-Checking
SAS '01 Proceedings of the 8th 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
Automatic Verification by Abstract Interpretation
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
The essence of computation
Class analyses as abstract interpretations of trace semantics
ACM Transactions on Programming Languages and Systems (TOPLAS)
From Polyvariant flow information to intersection and union types
Journal of Functional Programming
On abstract interpretation of mobile ambients
Information and Computation
Abstraction carrying code and resource-awareness
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
A delta-driven execution model for semantic computing
OOPSLA '05 Companion to the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
A delta-driven execution model for semantic computing
OOPSLA '05 Companion to the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Control Code Obfuscation by Abstract Interpretation
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Abstract non-interference in a fragment of Java bytecode
Proceedings of the 2006 ACM symposium on Applied computing
Type systems equivalent to data-flow analyses for imperative languages
Theoretical Computer Science - Applied semantics
Bi-inductive Structural Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Rank 2 Intersection for Recursive Definitions
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
Type inference for datalog and its application to query optimisation
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A type system equivalent to a model checker
ACM Transactions on Programming Languages and Systems (TOPLAS)
Abstract interpretation and types for systems biology
Theoretical Computer Science
The Verification Grand Challenge and Abstract Interpretation
Verified Software: Theories, Tools, Experiments
On Polymorphic Recursion, Type Systems, and Abstract Interpretation
SAS '08 Proceedings of the 15th international symposium on Static Analysis
A Hierarchy of Quantum Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Bi-inductive structural semantics
Information and Computation
Observational Completeness on Abstract Interpretation
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
An Approach to Behavioral Subtyping Based on Static Analysis
Electronic Notes in Theoretical Computer Science (ENTCS)
A rewriting semantics for type inference
ESOP'07 Proceedings of the 16th European conference on Programming
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
A substructural type system for delimited continuations
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Formal cell biology in biocham
SFM'08 Proceedings of the Formal methods for the design of computer, communication, and software systems 8th international conference on Formal methods for computational systems biology
Abstract interpretation of non-monotone bi-inductive semantic definitions
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
Types from control flow analysis
Program analysis and compilation, theory and practice
Static analysis, abstract interpretation and verification in (constraint logic) programming
A 25-year perspective on logic programming
Runtime instrumentation for precise flow-sensitive type analysis
RV'10 Proceedings of the First international conference on Runtime verification
Programmable verifiers in imperative programming
UTP'10 Proceedings of the Third international conference on Unifying theories of programming
A simple semantics for polymorphic recursion
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Integrating physical systems in the static analysis of embedded control software
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Type inference in systems biology
CMSB'06 Proceedings of the 2006 international conference on Computational Methods in Systems Biology
A type system equivalent to a model checker
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Semantic hierarchy refactoring by abstract interpretation
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Abstract interpretation-based verification of non-functional requirements
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
Rank-2 intersection and polymorphic recursion
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Higher-order abstract non-interference
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Generating c code from LOGS specifications
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Abstract clustering for program comprehension
IW-FM'00 Proceedings of the 4th Irish conference on Formal Methods
Formal verification by abstract interpretation
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
Verification games: making verification fun
Proceedings of the 14th Workshop on Formal Techniques for Java-like Programs
Observational Completeness on Abstract Interpretation
Fundamenta Informaticae - Logic, Language, Information and Computation
Rank 2 Intersection for Recursive Definitions
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
Deriving a complete type inference for hindley-milner and vector sizes using expansion
PEPM '13 Proceedings of the ACM SIGPLAN 2013 workshop on Partial evaluation and program manipulation
A galois connection calculus for abstract interpretation
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
A modular and generic analysis server system for functional logic programs
Proceedings of the ACM SIGPLAN 2014 Workshop on Partial Evaluation and Program Manipulation
| Hi-index | 0.00 |