“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Generating data flow analysis algorithms from modal specifications
TACS'91 Selected papers of the conference on Theoretical aspects of computer software
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
An improved algorithm for the evaluation of fixpoint expressions
Theoretical Computer Science
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
Data flow analysis is model checking of abstract interpretations
POPL '98 Proceedings of the 25th 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
Complete Abstract Interpretations Made Constructive
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation
PLILP '92 Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming
Optimality in Abstractions of Model Checking
SAS '95 Proceedings of the Second International Symposium on Static Analysis
A Tool for Symbolic Program Verification and Abstration
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Verification of Real-Time Systems by Successive Over and Under Approximation
Proceedings of the 7th International Conference on Computer Aided Verification
Automatically validating temporal safety properties of interfaces
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
Theoretical Computer Science
Parsing as abstract interpretation of grammar semantics
Theoretical Computer Science
Modal Transition Systems: A Foundation for Three-Valued Program Analysis
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
On the Completeness of Model Checking
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
Combining Forward and Backward Analyses of Temporal Properties
PADO '01 Proceedings of the Second Symposium on Programs as Data Objects
Possibilistic and Probabilistic Abstraction-Based Model Checking
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Partial Completeness of Abstract Fixpoint Checking
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
On Small Depth Threshold Circuits
SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory
Model Checking Modal Transition Systems Using Kripke Structures
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Abstraction-Based Model Checking Using Modal Transition Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Verification of Embedded Software: Problems and Perspectives
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Making Abstract Model Checking Strongly Preserving
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
States vs. Traces in Model Checking 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.
Alias Analysis by Means of a Model Checker
CC '01 Proceedings of the 10th International Conference on Compiler Construction
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
Automatic Abstraction Using Generalized Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Automatic Verification by Abstract Interpretation
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
A domain equation for refinement of partial systems
Mathematical Structures in Computer Science
Weighted pushdown systems and their application to interprocedural dataflow analysis
Science of Computer Programming - Special issue: Static analysis symposium (SAS 2003)
Imcompleteness of States w.r.t traces in model Checking
Information and Computation
Extracting Program Logics From Abstract Interpretations Defined by Logical Relations
Electronic Notes in Theoretical Computer Science (ENTCS)
A type system equivalent to a model checker
ACM Transactions on Programming Languages and Systems (TOPLAS)
On model checking multiple hybrid views
Theoretical Computer Science
The Verification Grand Challenge and Abstract Interpretation
Verified Software: Theories, Tools, Experiments
Observational Completeness on Abstract Interpretation
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
ACM Computing Surveys (CSUR)
Partial model checking via abstract interpretation
Information Processing Letters
Efficient Patterns for Model Checking Partial State Spaces in CTL ∩ LTL
Electronic Notes in Theoretical Computer Science (ENTCS)
Incompleteness of states w.r.t. traces in model checking
Information and Computation
Weighted pushdown systems and their application to interprocedural dataflow analysis
SAS'03 Proceedings of the 10th international conference on Static analysis
Verifying temporal heap properties specified via evolution logic
ESOP'03 Proceedings of the 12th European conference on Programming
Internal and external logics of abstract interpretations
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
Static analysis, abstract interpretation and verification in (constraint logic) programming
A 25-year perspective on logic programming
A state/event-based model-checking approach for the analysis of abstract system properties
Science of Computer Programming
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Underapproximating predicate transformers
SAS'06 Proceedings of the 13th international conference on Static Analysis
An abstract interpretation perspective on linear vs. branching time
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
A type system equivalent to a model checker
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Strong preservation of temporal fixpoint-based operators by abstract interpretation
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Comparing completeness properties of static analyses and their logics
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
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
TSL: A System for Generating Abstract Interpreters and its Application to Machine-Code Analysis
ACM Transactions on Programming Languages and Systems (TOPLAS)
Generalizing simulation to abstract domains
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
A galois connection calculus for abstract interpretation
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
| Hi-index | 0.00 |
We study the abstract interpretation of temporal calculi and logics in a general syntax, semantics and abstraction independent setting. This is applied to the @@@@-calculus, a generalization of the &mgr;-calculus with new reversal and abstraction modalities as well as a new time-symmetric trace-based semantics. The more classical set-based semantics is shown to be an abstract interpretation of the trace-based semantics which leads to the understanding of model-checking and its application to data-flow analysis as incomplete temporal abstract interpretations. Soundness and incompleteness of the abstractions are discussed. The sources of incompleteness, even for finite systems, are pointed out, which leads to the identification of relatively complete sublogics, à la CTL.