Three partition refinement algorithms
SIAM Journal on Computing
Characterizing finite Kripke structures in propositional temporal logic
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Declarative modeling of the operational behavior of logic languages
Theoretical Computer Science
Abstract interpretation and application to logic programs
Journal of Logic Programming
Completeness and predicate-based abstract interpretation
PEPM '93 Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
A unifying view of abstract domain design
ACM Computing Surveys (CSUR)
Complementation in abstract interpretation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Types as abstract interpretations
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Disjunctive program analysis for algebraic data types
ACM Transactions on Programming Languages and Systems (TOPLAS)
A logical model for relational abstract domains
ACM Transactions on Programming Languages and Systems (TOPLAS)
The reduced relative power operation on abstract domains
Theoretical Computer Science
Optimal domains for disjunctive abstract interpretation
Science of Computer Programming - Special issue on the 6th European symposium on programming
Temporal abstract interpretation
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
Model checking
Making abstract interpretations complete
Journal of the ACM (JACM)
Science of Computer Programming
Solving coverability problems of petri nets by partial deduction
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Compositionality in the puzzle of semantics
PEPM '02 Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Set-sharing is redundant for pair-sharing
Theoretical Computer Science
Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
Theoretical Computer Science
Logical optimality of groundness analysis
Theoretical Computer Science
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A Model Checker for Value-Passing Mu-Calculus Using Logic Programming
PADL '01 Proceedings of the Third International Symposium on Practical Aspects of Declarative Languages
An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Refining and Compressing Abstract Domains
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Fighting Livelock in the i-Protocol: A Comparative Study of Verification Tools
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Verification of Parameterized Systems Using Logic Program Transformations
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
An Experiment in Domain Refinement: Type Domains and Type Representations for Logic Programs
PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Infinite State Model Checking by Abstract Interpretation and Program Specialisation
LOPSTR'99 Selected papers from the 9th International Workshop on Logic Programming Synthesis and Transformation
Verification of Sets of Infinite State Processes Using Program Transformation
LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Symbolic Verification with Gap-Order Constraints
LOPSTR '96 Proceedings of the 6th International Workshop on Logic Programming Synthesis and Transformation
Incompleteness, Counterexamples, and Refinements in Abstract Model-Checking
SAS '01 Proceedings of the 8th International Symposium on Static Analysis
Progress on the State Explosion Problem in Model Checking
Informatics - 10 Years Back. 10 Years Ahead.
Coverability of Reset Petri Nets and Other Well-Structured Transition Systems by Partial Deduction
CL '00 Proceedings of the First International Conference on Computational Logic
Efficient Model Checking Using Tabled Resolution
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Complementing Logic Program Semantics
ALP '96 Proceedings of the 5th International Conference on Algebraic and Logic Programming
Expected forms of data flow analyses
Programs as Data Objects, Proceedings of a Workshop
Pair-independence and freeness analysis through linear refinement
Information and Computation
Computing simulations on finite and infinite graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
A constraint-based approach for specification and verification of real-time systems
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
From Bisimulation to Simulation: Coarsest Partition Problems
Journal of Automated Reasoning
Model checking linear logic specifications
Theory and Practice of Logic Programming
A classification of symbolic transition systems
ACM Transactions on Computational Logic (TOCL)
Making abstract domains condensing
ACM Transactions on Computational Logic (TOCL)
Monadic concurrent linear logic programming
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Transforming semantics by abstract interpretation
Theoretical Computer Science
A New Efficient Simulation Equivalence Algorithm
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Optimality and condensing of information flow through linear refinement
Theoretical Computer Science
Generalizing the Paige--Tarjan algorithm by abstract interpretation
Information and Computation
The Bedwyr System for Model Checking over Syntactic Expressions
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Transforming Abstract Interpretations by Abstract Interpretation
SAS '08 Proceedings of the 15th international symposium on Static Analysis
Correcting a Space-Efficient Simulation Algorithm
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Query-Based Model Checking of Ad Hoc Network Protocols
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Abstract interpretation of resolution-based semantics
Theoretical Computer Science
Incompleteness of states w.r.t. traces in model checking
Information and Computation
Transformational verification of parameterized protocols using array formulas
LOPSTR'05 Proceedings of the 15th international conference on Logic Based Program Synthesis and Transformation
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Parameterized verification of π-calculus systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A 25-year perspective on logic programming
Proof-theoretic and higher-order extensions of logic programming
A 25-year perspective on logic programming
| Hi-index | 0.00 |
We survey some general principles and methodologies for program analysis and verification. In particular, we focus on abstract interpretation and model checking techniques, and on their applications to constraint logic programs.